/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:16:45,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:16:45,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 10:16:45,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:16:45,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:16:45,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:16:45,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:16:45,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:16:45,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:16:45,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:16:45,859 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:16:45,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:16:45,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:16:45,861 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:16:45,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:16:45,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:16:45,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:16:45,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:16:45,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:16:45,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:16:45,862 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:16:45,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:16:45,863 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:16:45,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:16:45,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:16:45,864 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:16:45,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:16:45,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:16:45,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:16:45,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:16:45,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:16:45,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:16:45,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:16:45,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:16:45,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:16:45,867 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 10:16:46,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:16:46,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:16:46,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:16:46,216 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:16:46,216 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:16:46,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i [2023-08-27 10:16:47,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:16:47,792 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:16:47,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i [2023-08-27 10:16:47,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8218c28a/8658deb91bc34a228c3cc14207f567bb/FLAG3c7c1ffca [2023-08-27 10:16:47,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8218c28a/8658deb91bc34a228c3cc14207f567bb [2023-08-27 10:16:47,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:16:47,830 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:16:47,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:16:47,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:16:47,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:16:47,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:16:47" (1/1) ... [2023-08-27 10:16:47,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e531d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:16:47, skipping insertion in model container [2023-08-27 10:16:47,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:16:47" (1/1) ... [2023-08-27 10:16:47,900 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:16:48,257 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:16:48,270 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:16:48,302 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:16:48,304 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:16:48,373 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:16:48,416 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:16:48,417 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:16:48,423 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:16:48,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:16:48 WrapperNode [2023-08-27 10:16:48,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:16:48,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:16:48,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:16:48,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:16:48,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:16:48" (1/1) ... [2023-08-27 10:16:48,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:16:48" (1/1) ... [2023-08-27 10:16:48,520 INFO L138 Inliner]: procedures = 176, calls = 76, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 186 [2023-08-27 10:16:48,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:16:48,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:16:48,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:16:48,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:16:48,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:16:48" (1/1) ... [2023-08-27 10:16:48,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:16:48" (1/1) ... [2023-08-27 10:16:48,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:16:48" (1/1) ... [2023-08-27 10:16:48,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:16:48" (1/1) ... [2023-08-27 10:16:48,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:16:48" (1/1) ... [2023-08-27 10:16:48,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:16:48" (1/1) ... [2023-08-27 10:16:48,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:16:48" (1/1) ... [2023-08-27 10:16:48,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:16:48" (1/1) ... [2023-08-27 10:16:48,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:16:48,583 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:16:48,583 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:16:48,583 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:16:48,584 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:16:48" (1/1) ... [2023-08-27 10:16:48,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:16:48,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:16:48,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 10:16:48,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 10:16:48,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 10:16:48,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:16:48,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:16:48,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:16:48,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:16:48,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:16:48,651 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:16:48,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:16:48,651 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:16:48,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:16:48,651 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:16:48,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:16:48,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:16:48,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:16:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:16:48,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:16:48,654 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 10:16:48,795 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:16:48,797 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:16:49,138 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:16:49,389 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:16:49,390 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:16:49,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:16:49 BoogieIcfgContainer [2023-08-27 10:16:49,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:16:49,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:16:49,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:16:49,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:16:49,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:16:47" (1/3) ... [2023-08-27 10:16:49,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245cd410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:16:49, skipping insertion in model container [2023-08-27 10:16:49,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:16:48" (2/3) ... [2023-08-27 10:16:49,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245cd410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:16:49, skipping insertion in model container [2023-08-27 10:16:49,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:16:49" (3/3) ... [2023-08-27 10:16:49,399 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_power.opt.i [2023-08-27 10:16:49,414 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:16:49,414 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 10:16:49,414 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:16:49,488 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:16:49,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 135 transitions, 285 flow [2023-08-27 10:16:49,594 INFO L124 PetriNetUnfolderBase]: 3/132 cut-off events. [2023-08-27 10:16:49,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:16:49,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 132 events. 3/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-27 10:16:49,600 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 135 transitions, 285 flow [2023-08-27 10:16:49,608 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 132 transitions, 273 flow [2023-08-27 10:16:49,611 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:16:49,629 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 132 transitions, 273 flow [2023-08-27 10:16:49,631 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 132 transitions, 273 flow [2023-08-27 10:16:49,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 132 transitions, 273 flow [2023-08-27 10:16:49,660 INFO L124 PetriNetUnfolderBase]: 3/132 cut-off events. [2023-08-27 10:16:49,662 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:16:49,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 132 events. 3/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-27 10:16:49,666 INFO L119 LiptonReduction]: Number of co-enabled transitions 2516 [2023-08-27 10:16:57,201 INFO L134 LiptonReduction]: Checked pairs total: 8300 [2023-08-27 10:16:57,201 INFO L136 LiptonReduction]: Total number of compositions: 120 [2023-08-27 10:16:57,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:16:57,225 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;@529dcd7e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:16:57,225 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 10:16:57,231 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:16:57,231 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 10:16:57,231 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:16:57,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:16:57,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:16:57,232 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:16:57,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:16:57,237 INFO L85 PathProgramCache]: Analyzing trace with hash 887600878, now seen corresponding path program 1 times [2023-08-27 10:16:57,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:16:57,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286824379] [2023-08-27 10:16:57,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:16:57,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:16:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:16:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:16:57,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:16:57,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286824379] [2023-08-27 10:16:57,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286824379] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:16:57,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:16:57,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:16:57,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383591211] [2023-08-27 10:16:57,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:16:57,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:16:57,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:16:57,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:16:57,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:16:57,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 255 [2023-08-27 10:16:57,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:57,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:16:57,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 255 [2023-08-27 10:16:57,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:16:58,282 INFO L124 PetriNetUnfolderBase]: 1703/2600 cut-off events. [2023-08-27 10:16:58,282 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-27 10:16:58,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5251 conditions, 2600 events. 1703/2600 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12842 event pairs, 567 based on Foata normal form. 0/1893 useless extension candidates. Maximal degree in co-relation 5240. Up to 1889 conditions per place. [2023-08-27 10:16:58,303 INFO L140 encePairwiseOnDemand]: 244/255 looper letters, 42 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-27 10:16:58,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 201 flow [2023-08-27 10:16:58,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:16:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:16:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2023-08-27 10:16:58,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4980392156862745 [2023-08-27 10:16:58,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2023-08-27 10:16:58,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2023-08-27 10:16:58,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:16:58,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2023-08-27 10:16:58,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:58,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:58,338 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:58,340 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 381 transitions. [2023-08-27 10:16:58,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 201 flow [2023-08-27 10:16:58,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 196 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 10:16:58,346 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 98 flow [2023-08-27 10:16:58,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, 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 10:16:58,351 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2023-08-27 10:16:58,352 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 98 flow [2023-08-27 10:16:58,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:58,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:16:58,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:16:58,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:16:58,353 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:16:58,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:16:58,355 INFO L85 PathProgramCache]: Analyzing trace with hash 887663358, now seen corresponding path program 1 times [2023-08-27 10:16:58,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:16:58,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250416589] [2023-08-27 10:16:58,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:16:58,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:16:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:16:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:16:58,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:16:58,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250416589] [2023-08-27 10:16:58,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250416589] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:16:58,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:16:58,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:16:58,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153329029] [2023-08-27 10:16:58,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:16:58,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:16:58,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:16:58,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:16:58,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:16:58,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 255 [2023-08-27 10:16:58,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:58,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:16:58,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 255 [2023-08-27 10:16:58,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:16:58,863 INFO L124 PetriNetUnfolderBase]: 1210/1940 cut-off events. [2023-08-27 10:16:58,863 INFO L125 PetriNetUnfolderBase]: For 166/191 co-relation queries the response was YES. [2023-08-27 10:16:58,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4683 conditions, 1940 events. 1210/1940 cut-off events. For 166/191 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10298 event pairs, 229 based on Foata normal form. 0/1619 useless extension candidates. Maximal degree in co-relation 4672. Up to 1490 conditions per place. [2023-08-27 10:16:58,876 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 41 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-27 10:16:58,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 232 flow [2023-08-27 10:16:58,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:16:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:16:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-27 10:16:58,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49411764705882355 [2023-08-27 10:16:58,879 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-27 10:16:58,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-27 10:16:58,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:16:58,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-27 10:16:58,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:58,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:58,883 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:58,883 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 98 flow. Second operand 3 states and 378 transitions. [2023-08-27 10:16:58,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 232 flow [2023-08-27 10:16:58,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:16:58,885 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 96 flow [2023-08-27 10:16:58,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-08-27 10:16:58,886 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2023-08-27 10:16:58,886 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 96 flow [2023-08-27 10:16:58,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:58,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:16:58,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:16:58,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:16:58,887 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:16:58,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:16:58,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1096449780, now seen corresponding path program 1 times [2023-08-27 10:16:58,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:16:58,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103286038] [2023-08-27 10:16:58,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:16:58,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:16:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:16:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:16:59,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:16:59,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103286038] [2023-08-27 10:16:59,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103286038] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:16:59,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:16:59,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:16:59,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023709278] [2023-08-27 10:16:59,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:16:59,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:16:59,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:16:59,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:16:59,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:16:59,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 255 [2023-08-27 10:16:59,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:59,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:16:59,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 255 [2023-08-27 10:16:59,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:16:59,387 INFO L124 PetriNetUnfolderBase]: 1105/1687 cut-off events. [2023-08-27 10:16:59,388 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2023-08-27 10:16:59,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4041 conditions, 1687 events. 1105/1687 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7735 event pairs, 368 based on Foata normal form. 0/1423 useless extension candidates. Maximal degree in co-relation 4029. Up to 1165 conditions per place. [2023-08-27 10:16:59,398 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 37 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-08-27 10:16:59,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 202 flow [2023-08-27 10:16:59,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:16:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:16:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-08-27 10:16:59,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2023-08-27 10:16:59,400 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-08-27 10:16:59,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-08-27 10:16:59,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:16:59,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-08-27 10:16:59,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:59,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:59,404 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:59,404 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 96 flow. Second operand 4 states and 480 transitions. [2023-08-27 10:16:59,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 202 flow [2023-08-27 10:16:59,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:16:59,407 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 88 flow [2023-08-27 10:16:59,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2023-08-27 10:16:59,408 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2023-08-27 10:16:59,408 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 88 flow [2023-08-27 10:16:59,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:59,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:16:59,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:16:59,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:16:59,409 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:16:59,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:16:59,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1097258879, now seen corresponding path program 1 times [2023-08-27 10:16:59,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:16:59,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023763108] [2023-08-27 10:16:59,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:16:59,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:16:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:16:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:16:59,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:16:59,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023763108] [2023-08-27 10:16:59,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023763108] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:16:59,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:16:59,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:16:59,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176719756] [2023-08-27 10:16:59,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:16:59,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:16:59,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:16:59,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:16:59,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:16:59,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 255 [2023-08-27 10:16:59,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:59,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:16:59,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 255 [2023-08-27 10:16:59,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:16:59,873 INFO L124 PetriNetUnfolderBase]: 870/1322 cut-off events. [2023-08-27 10:16:59,873 INFO L125 PetriNetUnfolderBase]: For 494/494 co-relation queries the response was YES. [2023-08-27 10:16:59,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3183 conditions, 1322 events. 870/1322 cut-off events. For 494/494 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5746 event pairs, 326 based on Foata normal form. 0/1227 useless extension candidates. Maximal degree in co-relation 3171. Up to 549 conditions per place. [2023-08-27 10:16:59,881 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 50 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2023-08-27 10:16:59,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 58 transitions, 276 flow [2023-08-27 10:16:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:16:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:16:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 496 transitions. [2023-08-27 10:16:59,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48627450980392156 [2023-08-27 10:16:59,884 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 496 transitions. [2023-08-27 10:16:59,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 496 transitions. [2023-08-27 10:16:59,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:16:59,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 496 transitions. [2023-08-27 10:16:59,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:59,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:59,888 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:59,888 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 88 flow. Second operand 4 states and 496 transitions. [2023-08-27 10:16:59,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 58 transitions, 276 flow [2023-08-27 10:16:59,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:16:59,890 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 127 flow [2023-08-27 10:16:59,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-08-27 10:16:59,892 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2023-08-27 10:16:59,892 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 127 flow [2023-08-27 10:16:59,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:16:59,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:16:59,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:16:59,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:16:59,893 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:16:59,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:16:59,894 INFO L85 PathProgramCache]: Analyzing trace with hash -444600989, now seen corresponding path program 1 times [2023-08-27 10:16:59,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:16:59,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104854996] [2023-08-27 10:16:59,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:16:59,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:16:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:00,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:00,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104854996] [2023-08-27 10:17:00,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104854996] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:00,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:00,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:17:00,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766756433] [2023-08-27 10:17:00,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:00,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:17:00,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:00,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:17:00,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:17:00,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 255 [2023-08-27 10:17:00,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:00,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:00,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 255 [2023-08-27 10:17:00,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:00,464 INFO L124 PetriNetUnfolderBase]: 937/1419 cut-off events. [2023-08-27 10:17:00,464 INFO L125 PetriNetUnfolderBase]: For 1195/1195 co-relation queries the response was YES. [2023-08-27 10:17:00,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3918 conditions, 1419 events. 937/1419 cut-off events. For 1195/1195 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6121 event pairs, 206 based on Foata normal form. 0/1343 useless extension candidates. Maximal degree in co-relation 3905. Up to 866 conditions per place. [2023-08-27 10:17:00,472 INFO L140 encePairwiseOnDemand]: 250/255 looper letters, 64 selfloop transitions, 5 changer transitions 3/73 dead transitions. [2023-08-27 10:17:00,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 73 transitions, 462 flow [2023-08-27 10:17:00,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:17:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:17:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-27 10:17:00,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4768627450980392 [2023-08-27 10:17:00,475 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-27 10:17:00,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-27 10:17:00,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:00,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-27 10:17:00,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:00,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:00,480 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:00,480 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 127 flow. Second operand 5 states and 608 transitions. [2023-08-27 10:17:00,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 73 transitions, 462 flow [2023-08-27 10:17:00,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 73 transitions, 420 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-27 10:17:00,483 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 147 flow [2023-08-27 10:17:00,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-27 10:17:00,484 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2023-08-27 10:17:00,484 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 147 flow [2023-08-27 10:17:00,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:00,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:00,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:00,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:17:00,485 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:00,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:00,485 INFO L85 PathProgramCache]: Analyzing trace with hash -897707401, now seen corresponding path program 1 times [2023-08-27 10:17:00,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:00,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392310007] [2023-08-27 10:17:00,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:00,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:00,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:00,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392310007] [2023-08-27 10:17:00,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392310007] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:00,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:00,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:17:00,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727274892] [2023-08-27 10:17:00,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:00,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:17:00,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:00,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:17:00,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:17:00,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 255 [2023-08-27 10:17:00,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:00,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:00,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 255 [2023-08-27 10:17:00,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:01,063 INFO L124 PetriNetUnfolderBase]: 1093/1725 cut-off events. [2023-08-27 10:17:01,063 INFO L125 PetriNetUnfolderBase]: For 1504/1504 co-relation queries the response was YES. [2023-08-27 10:17:01,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5021 conditions, 1725 events. 1093/1725 cut-off events. For 1504/1504 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8024 event pairs, 188 based on Foata normal form. 51/1749 useless extension candidates. Maximal degree in co-relation 5004. Up to 825 conditions per place. [2023-08-27 10:17:01,075 INFO L140 encePairwiseOnDemand]: 250/255 looper letters, 64 selfloop transitions, 7 changer transitions 3/75 dead transitions. [2023-08-27 10:17:01,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 75 transitions, 482 flow [2023-08-27 10:17:01,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:17:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:17:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-08-27 10:17:01,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47372549019607846 [2023-08-27 10:17:01,078 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-08-27 10:17:01,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-08-27 10:17:01,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:01,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-08-27 10:17:01,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:01,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:01,082 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:01,082 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 147 flow. Second operand 5 states and 604 transitions. [2023-08-27 10:17:01,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 75 transitions, 482 flow [2023-08-27 10:17:01,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 482 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:17:01,091 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 209 flow [2023-08-27 10:17:01,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-08-27 10:17:01,093 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2023-08-27 10:17:01,096 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 209 flow [2023-08-27 10:17:01,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:01,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:01,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:01,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:17:01,097 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:01,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash 713623922, now seen corresponding path program 1 times [2023-08-27 10:17:01,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:01,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362447215] [2023-08-27 10:17:01,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:01,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:01,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:01,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362447215] [2023-08-27 10:17:01,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362447215] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:01,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:01,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:17:01,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542018462] [2023-08-27 10:17:01,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:01,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:17:01,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:01,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:17:01,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:17:01,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 255 [2023-08-27 10:17:01,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:01,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:01,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 255 [2023-08-27 10:17:01,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:01,937 INFO L124 PetriNetUnfolderBase]: 1882/2831 cut-off events. [2023-08-27 10:17:01,937 INFO L125 PetriNetUnfolderBase]: For 4529/4529 co-relation queries the response was YES. [2023-08-27 10:17:01,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9307 conditions, 2831 events. 1882/2831 cut-off events. For 4529/4529 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 13056 event pairs, 273 based on Foata normal form. 51/2834 useless extension candidates. Maximal degree in co-relation 9284. Up to 744 conditions per place. [2023-08-27 10:17:01,958 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 96 selfloop transitions, 12 changer transitions 9/117 dead transitions. [2023-08-27 10:17:01,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 117 transitions, 828 flow [2023-08-27 10:17:01,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:17:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:17:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2023-08-27 10:17:01,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46834733893557423 [2023-08-27 10:17:01,961 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2023-08-27 10:17:01,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2023-08-27 10:17:01,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:01,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2023-08-27 10:17:01,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:01,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:01,966 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:01,966 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 209 flow. Second operand 7 states and 836 transitions. [2023-08-27 10:17:01,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 117 transitions, 828 flow [2023-08-27 10:17:01,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 117 transitions, 828 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:17:01,982 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 305 flow [2023-08-27 10:17:01,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=305, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2023-08-27 10:17:01,983 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 24 predicate places. [2023-08-27 10:17:01,983 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 305 flow [2023-08-27 10:17:01,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:01,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:01,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:01,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:17:01,984 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:01,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:01,984 INFO L85 PathProgramCache]: Analyzing trace with hash -904312492, now seen corresponding path program 1 times [2023-08-27 10:17:01,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:01,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703401491] [2023-08-27 10:17:01,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:01,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:03,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:03,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:03,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703401491] [2023-08-27 10:17:03,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703401491] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:03,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:03,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:17:03,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866600113] [2023-08-27 10:17:03,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:03,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:17:03,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:03,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:17:03,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:17:03,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 255 [2023-08-27 10:17:03,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:03,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:03,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 255 [2023-08-27 10:17:03,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:03,879 INFO L124 PetriNetUnfolderBase]: 2116/3266 cut-off events. [2023-08-27 10:17:03,880 INFO L125 PetriNetUnfolderBase]: For 8881/8881 co-relation queries the response was YES. [2023-08-27 10:17:03,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11809 conditions, 3266 events. 2116/3266 cut-off events. For 8881/8881 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 16775 event pairs, 480 based on Foata normal form. 41/3244 useless extension candidates. Maximal degree in co-relation 11780. Up to 1791 conditions per place. [2023-08-27 10:17:03,904 INFO L140 encePairwiseOnDemand]: 245/255 looper letters, 97 selfloop transitions, 43 changer transitions 3/145 dead transitions. [2023-08-27 10:17:03,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 145 transitions, 1224 flow [2023-08-27 10:17:03,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 10:17:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 10:17:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 990 transitions. [2023-08-27 10:17:03,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38823529411764707 [2023-08-27 10:17:03,908 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 990 transitions. [2023-08-27 10:17:03,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 990 transitions. [2023-08-27 10:17:03,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:03,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 990 transitions. [2023-08-27 10:17:03,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:03,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 255.0) internal successors, (2805), 11 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:03,915 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 255.0) internal successors, (2805), 11 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:03,915 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 305 flow. Second operand 10 states and 990 transitions. [2023-08-27 10:17:03,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 145 transitions, 1224 flow [2023-08-27 10:17:03,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 145 transitions, 1190 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-08-27 10:17:03,934 INFO L231 Difference]: Finished difference. Result has 77 places, 87 transitions, 739 flow [2023-08-27 10:17:03,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=739, PETRI_PLACES=77, PETRI_TRANSITIONS=87} [2023-08-27 10:17:03,935 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 39 predicate places. [2023-08-27 10:17:03,935 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 87 transitions, 739 flow [2023-08-27 10:17:03,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:03,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:03,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:03,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:17:03,936 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:03,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:03,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1581691078, now seen corresponding path program 1 times [2023-08-27 10:17:03,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:03,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009372466] [2023-08-27 10:17:03,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:03,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:04,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:04,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009372466] [2023-08-27 10:17:04,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009372466] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:04,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:04,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:17:04,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567518163] [2023-08-27 10:17:04,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:04,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:17:04,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:04,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:17:04,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:17:04,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 255 [2023-08-27 10:17:04,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 87 transitions, 739 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:04,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:04,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 255 [2023-08-27 10:17:04,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:04,464 INFO L124 PetriNetUnfolderBase]: 1029/1740 cut-off events. [2023-08-27 10:17:04,464 INFO L125 PetriNetUnfolderBase]: For 6774/6776 co-relation queries the response was YES. [2023-08-27 10:17:04,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7459 conditions, 1740 events. 1029/1740 cut-off events. For 6774/6776 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8971 event pairs, 188 based on Foata normal form. 113/1795 useless extension candidates. Maximal degree in co-relation 7422. Up to 1277 conditions per place. [2023-08-27 10:17:04,477 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 121 selfloop transitions, 8 changer transitions 3/134 dead transitions. [2023-08-27 10:17:04,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 134 transitions, 1228 flow [2023-08-27 10:17:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:17:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:17:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2023-08-27 10:17:04,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-08-27 10:17:04,479 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 595 transitions. [2023-08-27 10:17:04,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 595 transitions. [2023-08-27 10:17:04,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:04,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 595 transitions. [2023-08-27 10:17:04,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:04,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:04,484 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:04,484 INFO L175 Difference]: Start difference. First operand has 77 places, 87 transitions, 739 flow. Second operand 5 states and 595 transitions. [2023-08-27 10:17:04,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 134 transitions, 1228 flow [2023-08-27 10:17:04,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 134 transitions, 1222 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-27 10:17:04,501 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 681 flow [2023-08-27 10:17:04,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=681, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2023-08-27 10:17:04,502 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 46 predicate places. [2023-08-27 10:17:04,502 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 681 flow [2023-08-27 10:17:04,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:04,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:04,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:04,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:17:04,503 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:04,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:04,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1040064216, now seen corresponding path program 1 times [2023-08-27 10:17:04,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:04,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261859216] [2023-08-27 10:17:04,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:04,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:05,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:05,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261859216] [2023-08-27 10:17:05,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261859216] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:05,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:05,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:17:05,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723383762] [2023-08-27 10:17:05,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:05,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 10:17:05,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:05,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 10:17:05,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-27 10:17:05,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 255 [2023-08-27 10:17:05,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 681 flow. Second operand has 9 states, 9 states have (on average 89.55555555555556) internal successors, (806), 9 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:05,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:05,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 255 [2023-08-27 10:17:05,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:06,367 INFO L124 PetriNetUnfolderBase]: 1210/2068 cut-off events. [2023-08-27 10:17:06,367 INFO L125 PetriNetUnfolderBase]: For 10136/10138 co-relation queries the response was YES. [2023-08-27 10:17:06,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9548 conditions, 2068 events. 1210/2068 cut-off events. For 10136/10138 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11214 event pairs, 331 based on Foata normal form. 27/2030 useless extension candidates. Maximal degree in co-relation 9506. Up to 1138 conditions per place. [2023-08-27 10:17:06,379 INFO L140 encePairwiseOnDemand]: 246/255 looper letters, 111 selfloop transitions, 55 changer transitions 3/171 dead transitions. [2023-08-27 10:17:06,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 171 transitions, 1755 flow [2023-08-27 10:17:06,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 10:17:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 10:17:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 970 transitions. [2023-08-27 10:17:06,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3803921568627451 [2023-08-27 10:17:06,383 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 970 transitions. [2023-08-27 10:17:06,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 970 transitions. [2023-08-27 10:17:06,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:06,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 970 transitions. [2023-08-27 10:17:06,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:06,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 255.0) internal successors, (2805), 11 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:06,390 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 255.0) internal successors, (2805), 11 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:06,390 INFO L175 Difference]: Start difference. First operand has 84 places, 81 transitions, 681 flow. Second operand 10 states and 970 transitions. [2023-08-27 10:17:06,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 171 transitions, 1755 flow [2023-08-27 10:17:06,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 171 transitions, 1729 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:17:06,412 INFO L231 Difference]: Finished difference. Result has 96 places, 107 transitions, 1160 flow [2023-08-27 10:17:06,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1160, PETRI_PLACES=96, PETRI_TRANSITIONS=107} [2023-08-27 10:17:06,413 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 58 predicate places. [2023-08-27 10:17:06,413 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 107 transitions, 1160 flow [2023-08-27 10:17:06,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.55555555555556) internal successors, (806), 9 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:06,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:06,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:06,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:17:06,414 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:06,414 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash 959388976, now seen corresponding path program 1 times [2023-08-27 10:17:06,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:06,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712801657] [2023-08-27 10:17:06,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:06,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:06,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:06,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712801657] [2023-08-27 10:17:06,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712801657] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:06,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:06,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:17:06,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907524908] [2023-08-27 10:17:06,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:06,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:17:06,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:06,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:17:06,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:17:06,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 255 [2023-08-27 10:17:06,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 107 transitions, 1160 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:06,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:06,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 255 [2023-08-27 10:17:06,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:06,943 INFO L124 PetriNetUnfolderBase]: 1158/1937 cut-off events. [2023-08-27 10:17:06,943 INFO L125 PetriNetUnfolderBase]: For 15083/15093 co-relation queries the response was YES. [2023-08-27 10:17:06,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10649 conditions, 1937 events. 1158/1937 cut-off events. For 15083/15093 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10269 event pairs, 147 based on Foata normal form. 0/1934 useless extension candidates. Maximal degree in co-relation 10602. Up to 962 conditions per place. [2023-08-27 10:17:06,957 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 54 selfloop transitions, 10 changer transitions 118/183 dead transitions. [2023-08-27 10:17:06,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 183 transitions, 2456 flow [2023-08-27 10:17:06,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:17:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:17:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2023-08-27 10:17:06,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47294117647058825 [2023-08-27 10:17:06,959 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 603 transitions. [2023-08-27 10:17:06,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 603 transitions. [2023-08-27 10:17:06,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:06,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 603 transitions. [2023-08-27 10:17:06,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:06,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:06,964 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:06,964 INFO L175 Difference]: Start difference. First operand has 96 places, 107 transitions, 1160 flow. Second operand 5 states and 603 transitions. [2023-08-27 10:17:06,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 183 transitions, 2456 flow [2023-08-27 10:17:07,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 183 transitions, 2410 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-27 10:17:07,007 INFO L231 Difference]: Finished difference. Result has 95 places, 37 transitions, 307 flow [2023-08-27 10:17:07,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=95, PETRI_TRANSITIONS=37} [2023-08-27 10:17:07,007 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 57 predicate places. [2023-08-27 10:17:07,008 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 37 transitions, 307 flow [2023-08-27 10:17:07,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:07,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:07,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:07,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:17:07,009 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 10:17:07,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash 187564154, now seen corresponding path program 1 times [2023-08-27 10:17:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:07,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039080566] [2023-08-27 10:17:07,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:07,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:07,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:07,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039080566] [2023-08-27 10:17:07,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039080566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:07,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:07,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:17:07,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461956203] [2023-08-27 10:17:07,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:07,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:17:07,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:07,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:17:07,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:17:07,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 255 [2023-08-27 10:17:07,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 37 transitions, 307 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:07,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:07,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 255 [2023-08-27 10:17:07,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:07,389 INFO L124 PetriNetUnfolderBase]: 165/314 cut-off events. [2023-08-27 10:17:07,389 INFO L125 PetriNetUnfolderBase]: For 1845/1845 co-relation queries the response was YES. [2023-08-27 10:17:07,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 314 events. 165/314 cut-off events. For 1845/1845 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1130 event pairs, 22 based on Foata normal form. 37/351 useless extension candidates. Maximal degree in co-relation 1599. Up to 99 conditions per place. [2023-08-27 10:17:07,392 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 47 selfloop transitions, 7 changer transitions 25/80 dead transitions. [2023-08-27 10:17:07,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 809 flow [2023-08-27 10:17:07,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:17:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:17:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 700 transitions. [2023-08-27 10:17:07,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45751633986928103 [2023-08-27 10:17:07,394 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 700 transitions. [2023-08-27 10:17:07,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 700 transitions. [2023-08-27 10:17:07,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:07,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 700 transitions. [2023-08-27 10:17:07,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:07,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:07,399 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:07,399 INFO L175 Difference]: Start difference. First operand has 95 places, 37 transitions, 307 flow. Second operand 6 states and 700 transitions. [2023-08-27 10:17:07,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 809 flow [2023-08-27 10:17:07,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 80 transitions, 617 flow, removed 33 selfloop flow, removed 30 redundant places. [2023-08-27 10:17:07,403 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 212 flow [2023-08-27 10:17:07,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2023-08-27 10:17:07,404 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2023-08-27 10:17:07,404 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 212 flow [2023-08-27 10:17:07,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:07,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:07,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:07,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:17:07,405 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 10:17:07,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:07,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1782672308, now seen corresponding path program 1 times [2023-08-27 10:17:07,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:07,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519623688] [2023-08-27 10:17:07,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:07,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:07,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:07,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:07,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519623688] [2023-08-27 10:17:07,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519623688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:07,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:07,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:17:07,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124551454] [2023-08-27 10:17:07,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:07,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:17:07,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:07,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:17:07,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:17:07,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 255 [2023-08-27 10:17:07,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:07,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:07,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 255 [2023-08-27 10:17:07,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:07,766 INFO L124 PetriNetUnfolderBase]: 91/183 cut-off events. [2023-08-27 10:17:07,766 INFO L125 PetriNetUnfolderBase]: For 490/490 co-relation queries the response was YES. [2023-08-27 10:17:07,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 183 events. 91/183 cut-off events. For 490/490 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 548 event pairs, 18 based on Foata normal form. 10/193 useless extension candidates. Maximal degree in co-relation 833. Up to 66 conditions per place. [2023-08-27 10:17:07,767 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 44 selfloop transitions, 10 changer transitions 10/65 dead transitions. [2023-08-27 10:17:07,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 523 flow [2023-08-27 10:17:07,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:17:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:17:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 798 transitions. [2023-08-27 10:17:07,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4470588235294118 [2023-08-27 10:17:07,770 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 798 transitions. [2023-08-27 10:17:07,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 798 transitions. [2023-08-27 10:17:07,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:07,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 798 transitions. [2023-08-27 10:17:07,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:07,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:07,775 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:07,775 INFO L175 Difference]: Start difference. First operand has 54 places, 35 transitions, 212 flow. Second operand 7 states and 798 transitions. [2023-08-27 10:17:07,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 523 flow [2023-08-27 10:17:07,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 479 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-08-27 10:17:07,778 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 209 flow [2023-08-27 10:17:07,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2023-08-27 10:17:07,778 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2023-08-27 10:17:07,778 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 209 flow [2023-08-27 10:17:07,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:07,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:07,779 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] [2023-08-27 10:17:07,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:17:07,779 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 10:17:07,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:07,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1109307410, now seen corresponding path program 1 times [2023-08-27 10:17:07,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:07,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522207176] [2023-08-27 10:17:07,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:07,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:09,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:09,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522207176] [2023-08-27 10:17:09,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522207176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:09,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:09,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-27 10:17:09,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170887173] [2023-08-27 10:17:09,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:09,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-27 10:17:09,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:09,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-27 10:17:09,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-08-27 10:17:09,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 255 [2023-08-27 10:17:09,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 209 flow. Second operand has 10 states, 10 states have (on average 91.9) internal successors, (919), 10 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:09,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:09,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 255 [2023-08-27 10:17:09,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:10,267 INFO L124 PetriNetUnfolderBase]: 137/294 cut-off events. [2023-08-27 10:17:10,267 INFO L125 PetriNetUnfolderBase]: For 778/778 co-relation queries the response was YES. [2023-08-27 10:17:10,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 294 events. 137/294 cut-off events. For 778/778 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1199 event pairs, 29 based on Foata normal form. 2/296 useless extension candidates. Maximal degree in co-relation 1338. Up to 100 conditions per place. [2023-08-27 10:17:10,269 INFO L140 encePairwiseOnDemand]: 246/255 looper letters, 60 selfloop transitions, 15 changer transitions 30/106 dead transitions. [2023-08-27 10:17:10,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 899 flow [2023-08-27 10:17:10,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 10:17:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 10:17:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1062 transitions. [2023-08-27 10:17:10,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3786096256684492 [2023-08-27 10:17:10,277 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1062 transitions. [2023-08-27 10:17:10,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1062 transitions. [2023-08-27 10:17:10,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:10,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1062 transitions. [2023-08-27 10:17:10,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.54545454545455) internal successors, (1062), 11 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:10,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 255.0) internal successors, (3060), 12 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:10,285 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 255.0) internal successors, (3060), 12 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:10,285 INFO L175 Difference]: Start difference. First operand has 54 places, 35 transitions, 209 flow. Second operand 11 states and 1062 transitions. [2023-08-27 10:17:10,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 899 flow [2023-08-27 10:17:10,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 106 transitions, 751 flow, removed 24 selfloop flow, removed 7 redundant places. [2023-08-27 10:17:10,289 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 278 flow [2023-08-27 10:17:10,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=278, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2023-08-27 10:17:10,290 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2023-08-27 10:17:10,290 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 278 flow [2023-08-27 10:17:10,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.9) internal successors, (919), 10 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:10,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:10,290 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] [2023-08-27 10:17:10,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:17:10,291 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:10,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:10,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1928336968, now seen corresponding path program 2 times [2023-08-27 10:17:10,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:10,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916460827] [2023-08-27 10:17:10,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:10,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:11,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:11,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916460827] [2023-08-27 10:17:11,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916460827] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:11,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:11,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:17:11,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377810849] [2023-08-27 10:17:11,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:11,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:17:11,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:11,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:17:11,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:17:11,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 255 [2023-08-27 10:17:11,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 41 transitions, 278 flow. Second operand has 8 states, 8 states have (on average 101.375) internal successors, (811), 8 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:11,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:11,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 255 [2023-08-27 10:17:11,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:11,358 INFO L124 PetriNetUnfolderBase]: 136/306 cut-off events. [2023-08-27 10:17:11,358 INFO L125 PetriNetUnfolderBase]: For 864/864 co-relation queries the response was YES. [2023-08-27 10:17:11,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 306 events. 136/306 cut-off events. For 864/864 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1332 event pairs, 43 based on Foata normal form. 1/307 useless extension candidates. Maximal degree in co-relation 1388. Up to 160 conditions per place. [2023-08-27 10:17:11,360 INFO L140 encePairwiseOnDemand]: 245/255 looper letters, 44 selfloop transitions, 14 changer transitions 21/80 dead transitions. [2023-08-27 10:17:11,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 80 transitions, 660 flow [2023-08-27 10:17:11,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:17:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:17:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 841 transitions. [2023-08-27 10:17:11,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4122549019607843 [2023-08-27 10:17:11,363 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 841 transitions. [2023-08-27 10:17:11,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 841 transitions. [2023-08-27 10:17:11,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:11,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 841 transitions. [2023-08-27 10:17:11,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.125) internal successors, (841), 8 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:11,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 255.0) internal successors, (2295), 9 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:11,368 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 255.0) internal successors, (2295), 9 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:11,369 INFO L175 Difference]: Start difference. First operand has 63 places, 41 transitions, 278 flow. Second operand 8 states and 841 transitions. [2023-08-27 10:17:11,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 80 transitions, 660 flow [2023-08-27 10:17:11,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 617 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-08-27 10:17:11,373 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 307 flow [2023-08-27 10:17:11,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=307, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2023-08-27 10:17:11,373 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 26 predicate places. [2023-08-27 10:17:11,373 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 307 flow [2023-08-27 10:17:11,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.375) internal successors, (811), 8 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:11,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:11,374 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] [2023-08-27 10:17:11,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:17:11,374 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:11,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:11,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1932266000, now seen corresponding path program 3 times [2023-08-27 10:17:11,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:11,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466506939] [2023-08-27 10:17:11,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:11,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466506939] [2023-08-27 10:17:13,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466506939] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:13,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:13,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-27 10:17:13,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463512874] [2023-08-27 10:17:13,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:13,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-27 10:17:13,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:13,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-27 10:17:13,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-08-27 10:17:13,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 255 [2023-08-27 10:17:13,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 307 flow. Second operand has 11 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:13,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:13,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 255 [2023-08-27 10:17:13,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:14,229 INFO L124 PetriNetUnfolderBase]: 164/360 cut-off events. [2023-08-27 10:17:14,230 INFO L125 PetriNetUnfolderBase]: For 1346/1346 co-relation queries the response was YES. [2023-08-27 10:17:14,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 360 events. 164/360 cut-off events. For 1346/1346 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1629 event pairs, 66 based on Foata normal form. 1/361 useless extension candidates. Maximal degree in co-relation 1729. Up to 270 conditions per place. [2023-08-27 10:17:14,232 INFO L140 encePairwiseOnDemand]: 245/255 looper letters, 58 selfloop transitions, 11 changer transitions 9/79 dead transitions. [2023-08-27 10:17:14,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 79 transitions, 696 flow [2023-08-27 10:17:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:17:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:17:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 768 transitions. [2023-08-27 10:17:14,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33464052287581697 [2023-08-27 10:17:14,235 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 768 transitions. [2023-08-27 10:17:14,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 768 transitions. [2023-08-27 10:17:14,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:14,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 768 transitions. [2023-08-27 10:17:14,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 85.33333333333333) internal successors, (768), 9 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:14,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 255.0) internal successors, (2550), 10 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:14,240 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 255.0) internal successors, (2550), 10 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:14,240 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 307 flow. Second operand 9 states and 768 transitions. [2023-08-27 10:17:14,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 79 transitions, 696 flow [2023-08-27 10:17:14,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 651 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-27 10:17:14,245 INFO L231 Difference]: Finished difference. Result has 68 places, 49 transitions, 381 flow [2023-08-27 10:17:14,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=381, PETRI_PLACES=68, PETRI_TRANSITIONS=49} [2023-08-27 10:17:14,246 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2023-08-27 10:17:14,246 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 49 transitions, 381 flow [2023-08-27 10:17:14,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:14,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:14,247 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] [2023-08-27 10:17:14,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:17:14,247 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:14,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:14,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1713169642, now seen corresponding path program 4 times [2023-08-27 10:17:14,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:14,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378287590] [2023-08-27 10:17:14,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:14,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:16,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:16,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378287590] [2023-08-27 10:17:16,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378287590] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:16,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:16,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-27 10:17:16,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796456371] [2023-08-27 10:17:16,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:16,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-27 10:17:16,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:16,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-27 10:17:16,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-08-27 10:17:16,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 255 [2023-08-27 10:17:16,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 49 transitions, 381 flow. Second operand has 10 states, 10 states have (on average 91.9) internal successors, (919), 10 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:16,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:16,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 255 [2023-08-27 10:17:16,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:16,846 INFO L124 PetriNetUnfolderBase]: 214/481 cut-off events. [2023-08-27 10:17:16,846 INFO L125 PetriNetUnfolderBase]: For 1492/1492 co-relation queries the response was YES. [2023-08-27 10:17:16,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2259 conditions, 481 events. 214/481 cut-off events. For 1492/1492 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2497 event pairs, 22 based on Foata normal form. 1/482 useless extension candidates. Maximal degree in co-relation 2237. Up to 216 conditions per place. [2023-08-27 10:17:16,849 INFO L140 encePairwiseOnDemand]: 247/255 looper letters, 83 selfloop transitions, 16 changer transitions 8/108 dead transitions. [2023-08-27 10:17:16,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 108 transitions, 952 flow [2023-08-27 10:17:16,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:17:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:17:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 871 transitions. [2023-08-27 10:17:16,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.379520697167756 [2023-08-27 10:17:16,852 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 871 transitions. [2023-08-27 10:17:16,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 871 transitions. [2023-08-27 10:17:16,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:16,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 871 transitions. [2023-08-27 10:17:16,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.77777777777777) internal successors, (871), 9 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:16,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 255.0) internal successors, (2550), 10 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:16,858 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 255.0) internal successors, (2550), 10 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:16,858 INFO L175 Difference]: Start difference. First operand has 68 places, 49 transitions, 381 flow. Second operand 9 states and 871 transitions. [2023-08-27 10:17:16,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 108 transitions, 952 flow [2023-08-27 10:17:16,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 108 transitions, 909 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-08-27 10:17:16,865 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 449 flow [2023-08-27 10:17:16,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=449, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2023-08-27 10:17:16,866 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 35 predicate places. [2023-08-27 10:17:16,866 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 54 transitions, 449 flow [2023-08-27 10:17:16,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.9) internal successors, (919), 10 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:16,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:16,867 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] [2023-08-27 10:17:16,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:17:16,867 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:16,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1273486142, now seen corresponding path program 5 times [2023-08-27 10:17:16,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:16,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767359384] [2023-08-27 10:17:16,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:16,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:17:16,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:17:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:17:17,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:17:17,034 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:17:17,035 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 10:17:17,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-27 10:17:17,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 10:17:17,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (14 of 18 remaining) [2023-08-27 10:17:17,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 10:17:17,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-27 10:17:17,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 10:17:17,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 10:17:17,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 10:17:17,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 10:17:17,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 10:17:17,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-27 10:17:17,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 10:17:17,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (4 of 18 remaining) [2023-08-27 10:17:17,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 10:17:17,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-27 10:17:17,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 10:17:17,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 10:17:17,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 10:17:17,039 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:17,044 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:17:17,044 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:17:17,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:17:17 BasicIcfg [2023-08-27 10:17:17,153 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:17:17,153 INFO L158 Benchmark]: Toolchain (without parser) took 29323.30ms. Allocated memory was 360.7MB in the beginning and 1.0GB in the end (delta: 660.6MB). Free memory was 316.8MB in the beginning and 493.4MB in the end (delta: -176.6MB). Peak memory consumption was 484.9MB. Max. memory is 16.0GB. [2023-08-27 10:17:17,153 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 360.7MB. Free memory is still 337.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:17:17,154 INFO L158 Benchmark]: CACSL2BoogieTranslator took 590.96ms. Allocated memory is still 360.7MB. Free memory was 316.8MB in the beginning and 291.4MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-27 10:17:17,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.17ms. Allocated memory is still 360.7MB. Free memory was 291.4MB in the beginning and 337.3MB in the end (delta: -45.8MB). Peak memory consumption was 7.7MB. Max. memory is 16.0GB. [2023-08-27 10:17:17,154 INFO L158 Benchmark]: Boogie Preprocessor took 61.01ms. Allocated memory is still 360.7MB. Free memory was 337.3MB in the beginning and 334.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 10:17:17,154 INFO L158 Benchmark]: RCFGBuilder took 809.19ms. Allocated memory is still 360.7MB. Free memory was 334.3MB in the beginning and 307.0MB in the end (delta: 27.4MB). Peak memory consumption was 66.9MB. Max. memory is 16.0GB. [2023-08-27 10:17:17,154 INFO L158 Benchmark]: TraceAbstraction took 27758.97ms. Allocated memory was 360.7MB in the beginning and 1.0GB in the end (delta: 660.6MB). Free memory was 307.0MB in the beginning and 493.4MB in the end (delta: -186.4MB). Peak memory consumption was 473.2MB. Max. memory is 16.0GB. [2023-08-27 10:17:17,155 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.14ms. Allocated memory is still 360.7MB. Free memory is still 337.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 590.96ms. Allocated memory is still 360.7MB. Free memory was 316.8MB in the beginning and 291.4MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 96.17ms. Allocated memory is still 360.7MB. Free memory was 291.4MB in the beginning and 337.3MB in the end (delta: -45.8MB). Peak memory consumption was 7.7MB. Max. memory is 16.0GB. * Boogie Preprocessor took 61.01ms. Allocated memory is still 360.7MB. Free memory was 337.3MB in the beginning and 334.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 809.19ms. Allocated memory is still 360.7MB. Free memory was 334.3MB in the beginning and 307.0MB in the end (delta: 27.4MB). Peak memory consumption was 66.9MB. Max. memory is 16.0GB. * TraceAbstraction took 27758.97ms. Allocated memory was 360.7MB in the beginning and 1.0GB in the end (delta: 660.6MB). Free memory was 307.0MB in the beginning and 493.4MB in the end (delta: -186.4MB). Peak memory consumption was 473.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6s, 139 PlacesBefore, 38 PlacesAfterwards, 132 TransitionsBefore, 29 TransitionsAfterwards, 2516 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 120 TotalNumberOfCompositions, 8300 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3014, independent: 2757, independent conditional: 0, independent unconditional: 2757, dependent: 257, dependent conditional: 0, dependent unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1327, independent: 1282, independent conditional: 0, independent unconditional: 1282, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3014, independent: 1475, independent conditional: 0, independent unconditional: 1475, dependent: 212, dependent conditional: 0, dependent unconditional: 212, unknown: 1327, unknown conditional: 0, unknown unconditional: 1327] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2204; [L860] FCALL, FORK 0 pthread_create(&t2204, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2204, ((void *)0), P0, ((void *)0))=9, t2204={7:0}, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L861] 0 pthread_t t2205; [L862] FCALL, FORK 0 pthread_create(&t2205, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2205, ((void *)0), P1, ((void *)0))=10, t2204={7:0}, t2205={8:0}, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L863] 0 pthread_t t2206; [L864] FCALL, FORK 0 pthread_create(&t2206, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2206, ((void *)0), P2, ((void *)0))=11, t2204={7:0}, t2205={8:0}, t2206={5:0}, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L834] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L761] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L801] 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) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 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 [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] 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) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 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 [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L808] EXPR 2 __unbuffered_cnt + 1 [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L844] EXPR 3 __unbuffered_cnt + 1 [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 3 return 0; [L782] EXPR 1 __unbuffered_cnt + 1 [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 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) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 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 [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2204={7:0}, t2205={8:0}, t2206={5:0}, weak$$choice1=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe018_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={258:259}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 782]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 165 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: 27.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 510 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 510 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2649 IncrementalHoareTripleChecker+Invalid, 2777 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 5 mSDtfsCounter, 2649 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1160occurred in iteration=10, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 3099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 10:17:17,181 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...