/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix042.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:47:03,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:47:03,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 03:47:03,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:47:03,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:47:03,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:47:03,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:47:03,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:47:03,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:47:03,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:47:03,534 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:47:03,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:47:03,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:47:03,536 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:47:03,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:47:03,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:47:03,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:47:03,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:47:03,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:47:03,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:47:03,537 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:47:03,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:47:03,539 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:47:03,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:47:03,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:47:03,539 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:47:03,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:47:03,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:47:03,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:47:03,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:47:03,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:47:03,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:47:03,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:47:03,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:47:03,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:47:03,542 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:47:03,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:47:03,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:47:03,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:47:03,877 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:47:03,878 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:47:03,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042.oepc.i [2023-08-27 03:47:04,942 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:47:05,197 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:47:05,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042.oepc.i [2023-08-27 03:47:05,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3a3c04e6/9360484dce034605996969f9faebd5b3/FLAG2ed793484 [2023-08-27 03:47:05,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3a3c04e6/9360484dce034605996969f9faebd5b3 [2023-08-27 03:47:05,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:47:05,241 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:47:05,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:47:05,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:47:05,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:47:05,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:47:05" (1/1) ... [2023-08-27 03:47:05,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398fb50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:05, skipping insertion in model container [2023-08-27 03:47:05,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:47:05" (1/1) ... [2023-08-27 03:47:05,299 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:47:05,628 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:47:05,641 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:47:05,675 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:47:05,677 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:47:05,725 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:47:05,757 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:47:05,757 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:47:05,763 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:47:05,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:05 WrapperNode [2023-08-27 03:47:05,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:47:05,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:47:05,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:47:05,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:47:05,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:05" (1/1) ... [2023-08-27 03:47:05,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:05" (1/1) ... [2023-08-27 03:47:05,842 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2023-08-27 03:47:05,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:47:05,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:47:05,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:47:05,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:47:05,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:05" (1/1) ... [2023-08-27 03:47:05,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:05" (1/1) ... [2023-08-27 03:47:05,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:05" (1/1) ... [2023-08-27 03:47:05,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:05" (1/1) ... [2023-08-27 03:47:05,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:05" (1/1) ... [2023-08-27 03:47:05,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:05" (1/1) ... [2023-08-27 03:47:05,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:05" (1/1) ... [2023-08-27 03:47:05,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:05" (1/1) ... [2023-08-27 03:47:05,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:47:05,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:47:05,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:47:05,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:47:05,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:05" (1/1) ... [2023-08-27 03:47:05,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:47:05,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:47:05,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 03:47:05,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 03:47:06,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:47:06,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:47:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:47:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:47:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:47:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:47:06,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:47:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:47:06,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:47:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:47:06,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:47:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:47:06,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:47:06,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:47:06,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:47:06,006 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:47:06,167 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:47:06,169 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:47:06,613 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:47:06,704 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:47:06,704 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:47:06,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:47:06 BoogieIcfgContainer [2023-08-27 03:47:06,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:47:06,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:47:06,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:47:06,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:47:06,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:47:05" (1/3) ... [2023-08-27 03:47:06,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f007dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:47:06, skipping insertion in model container [2023-08-27 03:47:06,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:05" (2/3) ... [2023-08-27 03:47:06,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f007dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:47:06, skipping insertion in model container [2023-08-27 03:47:06,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:47:06" (3/3) ... [2023-08-27 03:47:06,713 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.oepc.i [2023-08-27 03:47:06,729 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:47:06,729 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 03:47:06,729 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:47:06,773 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:47:06,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 122 transitions, 259 flow [2023-08-27 03:47:06,846 INFO L124 PetriNetUnfolderBase]: 3/119 cut-off events. [2023-08-27 03:47:06,846 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:47:06,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-27 03:47:06,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 122 transitions, 259 flow [2023-08-27 03:47:06,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 119 transitions, 247 flow [2023-08-27 03:47:06,859 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:47:06,867 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 119 transitions, 247 flow [2023-08-27 03:47:06,870 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 119 transitions, 247 flow [2023-08-27 03:47:06,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 119 transitions, 247 flow [2023-08-27 03:47:06,893 INFO L124 PetriNetUnfolderBase]: 3/119 cut-off events. [2023-08-27 03:47:06,893 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:47:06,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-27 03:47:06,896 INFO L119 LiptonReduction]: Number of co-enabled transitions 2984 [2023-08-27 03:47:10,544 INFO L134 LiptonReduction]: Checked pairs total: 10888 [2023-08-27 03:47:10,545 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-27 03:47:10,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:47:10,561 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;@f74cc7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:47:10,561 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 03:47:10,564 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:47:10,564 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-27 03:47:10,564 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:47:10,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:10,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 03:47:10,565 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:47:10,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:10,569 INFO L85 PathProgramCache]: Analyzing trace with hash 547757, now seen corresponding path program 1 times [2023-08-27 03:47:10,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:10,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851737475] [2023-08-27 03:47:10,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:10,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:10,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:10,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851737475] [2023-08-27 03:47:10,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851737475] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:10,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:10,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:47:10,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443394327] [2023-08-27 03:47:10,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:10,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:47:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:10,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:47:10,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:47:10,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 229 [2023-08-27 03:47:10,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:10,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:10,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 229 [2023-08-27 03:47:10,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:11,398 INFO L124 PetriNetUnfolderBase]: 2064/3327 cut-off events. [2023-08-27 03:47:11,399 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-27 03:47:11,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6394 conditions, 3327 events. 2064/3327 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19067 event pairs, 597 based on Foata normal form. 0/2654 useless extension candidates. Maximal degree in co-relation 6383. Up to 2549 conditions per place. [2023-08-27 03:47:11,428 INFO L140 encePairwiseOnDemand]: 225/229 looper letters, 40 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-27 03:47:11,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 193 flow [2023-08-27 03:47:11,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:47:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:47:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-27 03:47:11,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5065502183406113 [2023-08-27 03:47:11,448 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-27 03:47:11,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-27 03:47:11,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:11,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-27 03:47:11,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:11,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:11,465 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:11,466 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 348 transitions. [2023-08-27 03:47:11,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 193 flow [2023-08-27 03:47:11,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:47:11,471 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 68 flow [2023-08-27 03:47:11,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-27 03:47:11,475 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-27 03:47:11,476 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 68 flow [2023-08-27 03:47:11,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:11,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:11,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:47:11,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:47:11,477 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:47:11,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:11,477 INFO L85 PathProgramCache]: Analyzing trace with hash -861224296, now seen corresponding path program 1 times [2023-08-27 03:47:11,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:11,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016265883] [2023-08-27 03:47:11,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:11,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:11,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:11,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016265883] [2023-08-27 03:47:11,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016265883] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:11,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:11,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:47:11,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347764325] [2023-08-27 03:47:11,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:11,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:47:11,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:11,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:47:11,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:47:11,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 229 [2023-08-27 03:47:11,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:11,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:11,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 229 [2023-08-27 03:47:11,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:11,913 INFO L124 PetriNetUnfolderBase]: 1615/2458 cut-off events. [2023-08-27 03:47:11,914 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2023-08-27 03:47:11,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5116 conditions, 2458 events. 1615/2458 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12089 event pairs, 559 based on Foata normal form. 0/1918 useless extension candidates. Maximal degree in co-relation 5106. Up to 1741 conditions per place. [2023-08-27 03:47:11,928 INFO L140 encePairwiseOnDemand]: 219/229 looper letters, 42 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2023-08-27 03:47:11,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 204 flow [2023-08-27 03:47:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:47:11,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:47:11,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-27 03:47:11,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4992721979621543 [2023-08-27 03:47:11,931 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-27 03:47:11,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-27 03:47:11,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:11,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-27 03:47:11,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:11,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:11,934 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:11,935 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 68 flow. Second operand 3 states and 343 transitions. [2023-08-27 03:47:11,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 204 flow [2023-08-27 03:47:11,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:47:11,936 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 100 flow [2023-08-27 03:47:11,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-08-27 03:47:11,937 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-08-27 03:47:11,937 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 100 flow [2023-08-27 03:47:11,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:11,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:11,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:11,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:47:11,938 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:47:11,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:11,939 INFO L85 PathProgramCache]: Analyzing trace with hash 441429799, now seen corresponding path program 1 times [2023-08-27 03:47:11,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:11,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77512244] [2023-08-27 03:47:11,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:11,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:12,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:12,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77512244] [2023-08-27 03:47:12,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77512244] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:12,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:12,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:47:12,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835363186] [2023-08-27 03:47:12,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:12,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:47:12,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:12,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:47:12,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:47:12,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 229 [2023-08-27 03:47:12,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:12,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:12,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 229 [2023-08-27 03:47:12,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:12,334 INFO L124 PetriNetUnfolderBase]: 1310/2065 cut-off events. [2023-08-27 03:47:12,335 INFO L125 PetriNetUnfolderBase]: For 228/263 co-relation queries the response was YES. [2023-08-27 03:47:12,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4940 conditions, 2065 events. 1310/2065 cut-off events. For 228/263 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10341 event pairs, 413 based on Foata normal form. 0/1766 useless extension candidates. Maximal degree in co-relation 4929. Up to 1438 conditions per place. [2023-08-27 03:47:12,347 INFO L140 encePairwiseOnDemand]: 226/229 looper letters, 38 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-27 03:47:12,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 220 flow [2023-08-27 03:47:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:47:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:47:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-08-27 03:47:12,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847161572052402 [2023-08-27 03:47:12,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-08-27 03:47:12,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-08-27 03:47:12,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:12,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-08-27 03:47:12,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:12,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:12,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:12,353 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 100 flow. Second operand 3 states and 333 transitions. [2023-08-27 03:47:12,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 220 flow [2023-08-27 03:47:12,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:47:12,356 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 104 flow [2023-08-27 03:47:12,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-08-27 03:47:12,357 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-27 03:47:12,357 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 104 flow [2023-08-27 03:47:12,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:12,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:12,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:12,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:47:12,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:47:12,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:12,362 INFO L85 PathProgramCache]: Analyzing trace with hash -989295568, now seen corresponding path program 1 times [2023-08-27 03:47:12,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:12,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085201416] [2023-08-27 03:47:12,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:12,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:12,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:12,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085201416] [2023-08-27 03:47:12,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085201416] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:12,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:12,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:47:12,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62131586] [2023-08-27 03:47:12,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:12,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:47:12,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:12,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:47:12,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:47:12,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 229 [2023-08-27 03:47:12,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:12,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:12,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 229 [2023-08-27 03:47:12,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:13,044 INFO L124 PetriNetUnfolderBase]: 1250/2086 cut-off events. [2023-08-27 03:47:13,044 INFO L125 PetriNetUnfolderBase]: For 292/292 co-relation queries the response was YES. [2023-08-27 03:47:13,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5225 conditions, 2086 events. 1250/2086 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11734 event pairs, 316 based on Foata normal form. 164/1802 useless extension candidates. Maximal degree in co-relation 5212. Up to 858 conditions per place. [2023-08-27 03:47:13,060 INFO L140 encePairwiseOnDemand]: 217/229 looper letters, 66 selfloop transitions, 26 changer transitions 0/94 dead transitions. [2023-08-27 03:47:13,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 94 transitions, 487 flow [2023-08-27 03:47:13,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:47:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:47:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 553 transitions. [2023-08-27 03:47:13,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4829694323144105 [2023-08-27 03:47:13,062 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 553 transitions. [2023-08-27 03:47:13,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 553 transitions. [2023-08-27 03:47:13,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:13,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 553 transitions. [2023-08-27 03:47:13,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:13,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:13,067 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:13,067 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 104 flow. Second operand 5 states and 553 transitions. [2023-08-27 03:47:13,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 94 transitions, 487 flow [2023-08-27 03:47:13,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 94 transitions, 477 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:47:13,072 INFO L231 Difference]: Finished difference. Result has 47 places, 54 transitions, 332 flow [2023-08-27 03:47:13,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=47, PETRI_TRANSITIONS=54} [2023-08-27 03:47:13,074 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-08-27 03:47:13,074 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 54 transitions, 332 flow [2023-08-27 03:47:13,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:13,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:13,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:13,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:47:13,075 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:47:13,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:13,075 INFO L85 PathProgramCache]: Analyzing trace with hash 241707369, now seen corresponding path program 1 times [2023-08-27 03:47:13,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:13,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934299746] [2023-08-27 03:47:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:13,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:13,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:13,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934299746] [2023-08-27 03:47:13,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934299746] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:13,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:13,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:47:13,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141493370] [2023-08-27 03:47:13,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:13,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:47:13,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:13,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:47:13,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:47:13,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 229 [2023-08-27 03:47:13,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 54 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:13,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:13,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 229 [2023-08-27 03:47:13,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:13,416 INFO L124 PetriNetUnfolderBase]: 938/1552 cut-off events. [2023-08-27 03:47:13,416 INFO L125 PetriNetUnfolderBase]: For 1854/1854 co-relation queries the response was YES. [2023-08-27 03:47:13,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5039 conditions, 1552 events. 938/1552 cut-off events. For 1854/1854 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7739 event pairs, 321 based on Foata normal form. 0/1548 useless extension candidates. Maximal degree in co-relation 5022. Up to 1256 conditions per place. [2023-08-27 03:47:13,427 INFO L140 encePairwiseOnDemand]: 222/229 looper letters, 49 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2023-08-27 03:47:13,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 407 flow [2023-08-27 03:47:13,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:47:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:47:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 431 transitions. [2023-08-27 03:47:13,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4705240174672489 [2023-08-27 03:47:13,463 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 431 transitions. [2023-08-27 03:47:13,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 431 transitions. [2023-08-27 03:47:13,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:13,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 431 transitions. [2023-08-27 03:47:13,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:13,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:13,467 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:13,467 INFO L175 Difference]: Start difference. First operand has 47 places, 54 transitions, 332 flow. Second operand 4 states and 431 transitions. [2023-08-27 03:47:13,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 407 flow [2023-08-27 03:47:13,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 58 transitions, 407 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:47:13,475 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 274 flow [2023-08-27 03:47:13,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-08-27 03:47:13,478 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-08-27 03:47:13,478 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 274 flow [2023-08-27 03:47:13,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:13,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:13,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:13,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:47:13,479 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:47:13,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:13,480 INFO L85 PathProgramCache]: Analyzing trace with hash 241707370, now seen corresponding path program 1 times [2023-08-27 03:47:13,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:13,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442630480] [2023-08-27 03:47:13,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:13,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:13,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:13,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442630480] [2023-08-27 03:47:13,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442630480] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:13,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:13,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:47:13,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126190465] [2023-08-27 03:47:13,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:13,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:47:13,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:13,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:47:13,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:47:13,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 229 [2023-08-27 03:47:13,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 274 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:13,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:13,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 229 [2023-08-27 03:47:13,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:13,762 INFO L124 PetriNetUnfolderBase]: 698/1144 cut-off events. [2023-08-27 03:47:13,762 INFO L125 PetriNetUnfolderBase]: For 1873/1873 co-relation queries the response was YES. [2023-08-27 03:47:13,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3558 conditions, 1144 events. 698/1144 cut-off events. For 1873/1873 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5362 event pairs, 176 based on Foata normal form. 132/1272 useless extension candidates. Maximal degree in co-relation 3539. Up to 574 conditions per place. [2023-08-27 03:47:13,770 INFO L140 encePairwiseOnDemand]: 222/229 looper letters, 54 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2023-08-27 03:47:13,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 428 flow [2023-08-27 03:47:13,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:47:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:47:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2023-08-27 03:47:13,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4890829694323144 [2023-08-27 03:47:13,772 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 448 transitions. [2023-08-27 03:47:13,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 448 transitions. [2023-08-27 03:47:13,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:13,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 448 transitions. [2023-08-27 03:47:13,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:13,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:13,776 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:13,776 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 274 flow. Second operand 4 states and 448 transitions. [2023-08-27 03:47:13,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 428 flow [2023-08-27 03:47:13,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 413 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:47:13,780 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 258 flow [2023-08-27 03:47:13,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-08-27 03:47:13,781 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-08-27 03:47:13,781 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 258 flow [2023-08-27 03:47:13,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:13,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:13,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:13,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:47:13,782 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:47:13,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:13,782 INFO L85 PathProgramCache]: Analyzing trace with hash -487939301, now seen corresponding path program 1 times [2023-08-27 03:47:13,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:13,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685040915] [2023-08-27 03:47:13,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:13,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:14,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:14,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685040915] [2023-08-27 03:47:14,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685040915] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:14,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:14,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:47:14,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98686410] [2023-08-27 03:47:14,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:14,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:47:14,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:14,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:47:14,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:47:14,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 229 [2023-08-27 03:47:14,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 258 flow. Second operand has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:14,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:14,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 229 [2023-08-27 03:47:14,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:14,361 INFO L124 PetriNetUnfolderBase]: 487/843 cut-off events. [2023-08-27 03:47:14,361 INFO L125 PetriNetUnfolderBase]: For 1462/1462 co-relation queries the response was YES. [2023-08-27 03:47:14,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2928 conditions, 843 events. 487/843 cut-off events. For 1462/1462 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3977 event pairs, 84 based on Foata normal form. 54/893 useless extension candidates. Maximal degree in co-relation 2909. Up to 244 conditions per place. [2023-08-27 03:47:14,367 INFO L140 encePairwiseOnDemand]: 220/229 looper letters, 69 selfloop transitions, 25 changer transitions 3/99 dead transitions. [2023-08-27 03:47:14,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 99 transitions, 667 flow [2023-08-27 03:47:14,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:47:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:47:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 746 transitions. [2023-08-27 03:47:14,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46537741734248284 [2023-08-27 03:47:14,370 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 746 transitions. [2023-08-27 03:47:14,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 746 transitions. [2023-08-27 03:47:14,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:14,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 746 transitions. [2023-08-27 03:47:14,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:14,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:14,375 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:14,375 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 258 flow. Second operand 7 states and 746 transitions. [2023-08-27 03:47:14,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 99 transitions, 667 flow [2023-08-27 03:47:14,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 99 transitions, 629 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-27 03:47:14,383 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 380 flow [2023-08-27 03:47:14,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=380, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-08-27 03:47:14,384 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2023-08-27 03:47:14,384 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 380 flow [2023-08-27 03:47:14,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:14,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:14,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:14,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:47:14,385 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:47:14,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:14,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1378535721, now seen corresponding path program 1 times [2023-08-27 03:47:14,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:14,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849225719] [2023-08-27 03:47:14,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:14,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:14,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849225719] [2023-08-27 03:47:14,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849225719] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:14,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:14,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:47:14,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930760250] [2023-08-27 03:47:14,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:14,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:47:14,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:14,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:47:14,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:47:14,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 229 [2023-08-27 03:47:14,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:14,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:14,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 229 [2023-08-27 03:47:14,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:15,504 INFO L124 PetriNetUnfolderBase]: 1508/2601 cut-off events. [2023-08-27 03:47:15,505 INFO L125 PetriNetUnfolderBase]: For 8055/8055 co-relation queries the response was YES. [2023-08-27 03:47:15,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9995 conditions, 2601 events. 1508/2601 cut-off events. For 8055/8055 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14814 event pairs, 102 based on Foata normal form. 16/2617 useless extension candidates. Maximal degree in co-relation 9973. Up to 813 conditions per place. [2023-08-27 03:47:15,530 INFO L140 encePairwiseOnDemand]: 217/229 looper letters, 187 selfloop transitions, 30 changer transitions 5/222 dead transitions. [2023-08-27 03:47:15,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 222 transitions, 2206 flow [2023-08-27 03:47:15,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:47:15,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:47:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 820 transitions. [2023-08-27 03:47:15,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44759825327510916 [2023-08-27 03:47:15,536 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 820 transitions. [2023-08-27 03:47:15,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 820 transitions. [2023-08-27 03:47:15,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:15,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 820 transitions. [2023-08-27 03:47:15,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.5) internal successors, (820), 8 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:15,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 229.0) internal successors, (2061), 9 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:15,542 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 229.0) internal successors, (2061), 9 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:15,542 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 380 flow. Second operand 8 states and 820 transitions. [2023-08-27 03:47:15,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 222 transitions, 2206 flow [2023-08-27 03:47:15,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 222 transitions, 2135 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:47:15,571 INFO L231 Difference]: Finished difference. Result has 66 places, 78 transitions, 637 flow [2023-08-27 03:47:15,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=637, PETRI_PLACES=66, PETRI_TRANSITIONS=78} [2023-08-27 03:47:15,573 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2023-08-27 03:47:15,573 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 78 transitions, 637 flow [2023-08-27 03:47:15,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:15,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:15,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:15,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:47:15,574 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:47:15,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1776075763, now seen corresponding path program 2 times [2023-08-27 03:47:15,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:15,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190108624] [2023-08-27 03:47:15,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:15,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:15,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:15,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190108624] [2023-08-27 03:47:15,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190108624] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:15,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:15,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:47:15,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741110337] [2023-08-27 03:47:15,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:15,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:47:15,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:15,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:47:15,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:47:15,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 229 [2023-08-27 03:47:15,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 78 transitions, 637 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:15,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:15,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 229 [2023-08-27 03:47:15,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:16,249 INFO L124 PetriNetUnfolderBase]: 1167/2071 cut-off events. [2023-08-27 03:47:16,249 INFO L125 PetriNetUnfolderBase]: For 7121/7246 co-relation queries the response was YES. [2023-08-27 03:47:16,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9896 conditions, 2071 events. 1167/2071 cut-off events. For 7121/7246 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 12411 event pairs, 83 based on Foata normal form. 173/2224 useless extension candidates. Maximal degree in co-relation 9867. Up to 749 conditions per place. [2023-08-27 03:47:16,264 INFO L140 encePairwiseOnDemand]: 220/229 looper letters, 108 selfloop transitions, 17 changer transitions 46/178 dead transitions. [2023-08-27 03:47:16,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 178 transitions, 1490 flow [2023-08-27 03:47:16,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:47:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:47:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 930 transitions. [2023-08-27 03:47:16,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4512372634643377 [2023-08-27 03:47:16,268 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 930 transitions. [2023-08-27 03:47:16,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 930 transitions. [2023-08-27 03:47:16,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:16,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 930 transitions. [2023-08-27 03:47:16,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.33333333333333) internal successors, (930), 9 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:16,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:16,275 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:16,276 INFO L175 Difference]: Start difference. First operand has 66 places, 78 transitions, 637 flow. Second operand 9 states and 930 transitions. [2023-08-27 03:47:16,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 178 transitions, 1490 flow [2023-08-27 03:47:16,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 178 transitions, 1425 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-08-27 03:47:16,329 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 421 flow [2023-08-27 03:47:16,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=421, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-08-27 03:47:16,330 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2023-08-27 03:47:16,330 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 421 flow [2023-08-27 03:47:16,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:16,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:16,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:16,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:47:16,331 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:47:16,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:16,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2102888744, now seen corresponding path program 1 times [2023-08-27 03:47:16,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:16,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896213512] [2023-08-27 03:47:16,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:16,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:16,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:16,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896213512] [2023-08-27 03:47:16,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896213512] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:16,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:16,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:47:16,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112797905] [2023-08-27 03:47:16,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:16,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:47:16,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:16,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:47:16,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:47:16,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 229 [2023-08-27 03:47:16,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 421 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:16,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:16,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 229 [2023-08-27 03:47:16,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:17,047 INFO L124 PetriNetUnfolderBase]: 1584/2751 cut-off events. [2023-08-27 03:47:17,047 INFO L125 PetriNetUnfolderBase]: For 9095/9095 co-relation queries the response was YES. [2023-08-27 03:47:17,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12675 conditions, 2751 events. 1584/2751 cut-off events. For 9095/9095 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16226 event pairs, 283 based on Foata normal form. 1/2752 useless extension candidates. Maximal degree in co-relation 12646. Up to 1165 conditions per place. [2023-08-27 03:47:17,062 INFO L140 encePairwiseOnDemand]: 221/229 looper letters, 48 selfloop transitions, 15 changer transitions 86/149 dead transitions. [2023-08-27 03:47:17,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 149 transitions, 1432 flow [2023-08-27 03:47:17,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:47:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:47:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2023-08-27 03:47:17,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.450509461426492 [2023-08-27 03:47:17,064 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 619 transitions. [2023-08-27 03:47:17,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 619 transitions. [2023-08-27 03:47:17,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:17,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 619 transitions. [2023-08-27 03:47:17,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:17,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:17,069 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:17,069 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 421 flow. Second operand 6 states and 619 transitions. [2023-08-27 03:47:17,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 149 transitions, 1432 flow [2023-08-27 03:47:17,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 149 transitions, 1185 flow, removed 51 selfloop flow, removed 9 redundant places. [2023-08-27 03:47:17,104 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 318 flow [2023-08-27 03:47:17,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=318, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2023-08-27 03:47:17,105 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2023-08-27 03:47:17,105 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 318 flow [2023-08-27 03:47:17,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:17,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:17,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:17,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:47:17,106 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:47:17,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:17,107 INFO L85 PathProgramCache]: Analyzing trace with hash -986148690, now seen corresponding path program 2 times [2023-08-27 03:47:17,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:17,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938519857] [2023-08-27 03:47:17,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:17,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:17,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:17,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:17,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938519857] [2023-08-27 03:47:17,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938519857] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:17,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:17,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:47:17,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032659649] [2023-08-27 03:47:17,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:17,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:47:17,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:17,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:47:17,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:47:17,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 229 [2023-08-27 03:47:17,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 318 flow. Second operand has 7 states, 7 states have (on average 95.85714285714286) internal successors, (671), 7 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:17,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:17,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 229 [2023-08-27 03:47:17,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:18,158 INFO L124 PetriNetUnfolderBase]: 308/620 cut-off events. [2023-08-27 03:47:18,158 INFO L125 PetriNetUnfolderBase]: For 1432/1439 co-relation queries the response was YES. [2023-08-27 03:47:18,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2610 conditions, 620 events. 308/620 cut-off events. For 1432/1439 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3004 event pairs, 77 based on Foata normal form. 8/619 useless extension candidates. Maximal degree in co-relation 2588. Up to 300 conditions per place. [2023-08-27 03:47:18,162 INFO L140 encePairwiseOnDemand]: 222/229 looper letters, 41 selfloop transitions, 7 changer transitions 51/102 dead transitions. [2023-08-27 03:47:18,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 102 transitions, 839 flow [2023-08-27 03:47:18,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:47:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:47:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2023-08-27 03:47:18,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.450509461426492 [2023-08-27 03:47:18,165 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 619 transitions. [2023-08-27 03:47:18,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 619 transitions. [2023-08-27 03:47:18,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:18,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 619 transitions. [2023-08-27 03:47:18,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:18,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:18,169 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:18,169 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 318 flow. Second operand 6 states and 619 transitions. [2023-08-27 03:47:18,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 102 transitions, 839 flow [2023-08-27 03:47:18,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 792 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-27 03:47:18,176 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 300 flow [2023-08-27 03:47:18,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2023-08-27 03:47:18,177 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-08-27 03:47:18,177 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 300 flow [2023-08-27 03:47:18,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.85714285714286) internal successors, (671), 7 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:18,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:18,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:18,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:47:18,178 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:47:18,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:18,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1134434138, now seen corresponding path program 3 times [2023-08-27 03:47:18,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:18,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732010886] [2023-08-27 03:47:18,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:18,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:18,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:18,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732010886] [2023-08-27 03:47:18,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732010886] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:18,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:18,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:47:18,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430179086] [2023-08-27 03:47:18,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:18,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:47:18,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:18,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:47:18,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:47:18,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2023-08-27 03:47:18,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:18,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:18,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2023-08-27 03:47:18,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:18,417 INFO L124 PetriNetUnfolderBase]: 208/447 cut-off events. [2023-08-27 03:47:18,417 INFO L125 PetriNetUnfolderBase]: For 1038/1041 co-relation queries the response was YES. [2023-08-27 03:47:18,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2004 conditions, 447 events. 208/447 cut-off events. For 1038/1041 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2068 event pairs, 74 based on Foata normal form. 3/449 useless extension candidates. Maximal degree in co-relation 1984. Up to 238 conditions per place. [2023-08-27 03:47:18,419 INFO L140 encePairwiseOnDemand]: 226/229 looper letters, 37 selfloop transitions, 3 changer transitions 23/64 dead transitions. [2023-08-27 03:47:18,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 558 flow [2023-08-27 03:47:18,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:47:18,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:47:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-08-27 03:47:18,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47889374090247455 [2023-08-27 03:47:18,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-08-27 03:47:18,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-08-27 03:47:18,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:18,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-08-27 03:47:18,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:18,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:18,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:18,423 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 300 flow. Second operand 3 states and 329 transitions. [2023-08-27 03:47:18,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 558 flow [2023-08-27 03:47:18,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 528 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-27 03:47:18,428 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 217 flow [2023-08-27 03:47:18,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=217, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2023-08-27 03:47:18,429 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2023-08-27 03:47:18,429 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 217 flow [2023-08-27 03:47:18,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:18,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:18,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:18,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:47:18,430 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:47:18,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:18,430 INFO L85 PathProgramCache]: Analyzing trace with hash -37036578, now seen corresponding path program 4 times [2023-08-27 03:47:18,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:18,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936960449] [2023-08-27 03:47:18,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:18,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:18,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936960449] [2023-08-27 03:47:18,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936960449] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:18,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:18,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:47:18,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165327400] [2023-08-27 03:47:18,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:18,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:47:18,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:18,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:47:18,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:47:18,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 229 [2023-08-27 03:47:18,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 34 transitions, 217 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:18,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:18,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 229 [2023-08-27 03:47:18,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:19,053 INFO L124 PetriNetUnfolderBase]: 82/180 cut-off events. [2023-08-27 03:47:19,054 INFO L125 PetriNetUnfolderBase]: For 356/356 co-relation queries the response was YES. [2023-08-27 03:47:19,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 180 events. 82/180 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 506 event pairs, 11 based on Foata normal form. 1/181 useless extension candidates. Maximal degree in co-relation 753. Up to 66 conditions per place. [2023-08-27 03:47:19,055 INFO L140 encePairwiseOnDemand]: 223/229 looper letters, 33 selfloop transitions, 4 changer transitions 26/65 dead transitions. [2023-08-27 03:47:19,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 65 transitions, 520 flow [2023-08-27 03:47:19,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:47:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:47:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 708 transitions. [2023-08-27 03:47:19,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4416718652526513 [2023-08-27 03:47:19,057 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 708 transitions. [2023-08-27 03:47:19,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 708 transitions. [2023-08-27 03:47:19,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:19,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 708 transitions. [2023-08-27 03:47:19,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.14285714285714) internal successors, (708), 7 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:19,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:19,062 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:19,062 INFO L175 Difference]: Start difference. First operand has 55 places, 34 transitions, 217 flow. Second operand 7 states and 708 transitions. [2023-08-27 03:47:19,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 65 transitions, 520 flow [2023-08-27 03:47:19,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 463 flow, removed 11 selfloop flow, removed 9 redundant places. [2023-08-27 03:47:19,065 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 192 flow [2023-08-27 03:47:19,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2023-08-27 03:47:19,065 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2023-08-27 03:47:19,065 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 192 flow [2023-08-27 03:47:19,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:19,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:19,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:19,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:47:19,066 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:47:19,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:19,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1375736608, now seen corresponding path program 5 times [2023-08-27 03:47:19,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:19,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043975382] [2023-08-27 03:47:19,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:19,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:47:19,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:47:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:47:19,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:47:19,169 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:47:19,170 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 03:47:19,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (16 of 18 remaining) [2023-08-27 03:47:19,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 03:47:19,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-27 03:47:19,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 03:47:19,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-27 03:47:19,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 03:47:19,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 03:47:19,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 03:47:19,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 03:47:19,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 03:47:19,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (6 of 18 remaining) [2023-08-27 03:47:19,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 03:47:19,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-27 03:47:19,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 03:47:19,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-27 03:47:19,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 03:47:19,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 03:47:19,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:47:19,178 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:19,185 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:47:19,185 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:47:19,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:47:19 BasicIcfg [2023-08-27 03:47:19,267 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:47:19,267 INFO L158 Benchmark]: Toolchain (without parser) took 14026.58ms. Allocated memory was 354.4MB in the beginning and 700.4MB in the end (delta: 346.0MB). Free memory was 329.6MB in the beginning and 605.9MB in the end (delta: -276.3MB). Peak memory consumption was 71.2MB. Max. memory is 16.0GB. [2023-08-27 03:47:19,267 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 354.4MB. Free memory is still 330.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:47:19,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.94ms. Allocated memory is still 354.4MB. Free memory was 329.1MB in the beginning and 306.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:47:19,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.38ms. Allocated memory is still 354.4MB. Free memory was 306.0MB in the beginning and 303.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:47:19,268 INFO L158 Benchmark]: Boogie Preprocessor took 57.33ms. Allocated memory is still 354.4MB. Free memory was 303.4MB in the beginning and 301.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:47:19,268 INFO L158 Benchmark]: RCFGBuilder took 804.54ms. Allocated memory is still 354.4MB. Free memory was 301.3MB in the beginning and 312.6MB in the end (delta: -11.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-27 03:47:19,269 INFO L158 Benchmark]: TraceAbstraction took 12558.85ms. Allocated memory was 354.4MB in the beginning and 700.4MB in the end (delta: 346.0MB). Free memory was 311.7MB in the beginning and 605.9MB in the end (delta: -294.2MB). Peak memory consumption was 54.7MB. Max. memory is 16.0GB. [2023-08-27 03:47:19,270 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.12ms. Allocated memory is still 354.4MB. Free memory is still 330.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 521.94ms. Allocated memory is still 354.4MB. Free memory was 329.1MB in the beginning and 306.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 78.38ms. Allocated memory is still 354.4MB. Free memory was 306.0MB in the beginning and 303.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 57.33ms. Allocated memory is still 354.4MB. Free memory was 303.4MB in the beginning and 301.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 804.54ms. Allocated memory is still 354.4MB. Free memory was 301.3MB in the beginning and 312.6MB in the end (delta: -11.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 12558.85ms. Allocated memory was 354.4MB in the beginning and 700.4MB in the end (delta: 346.0MB). Free memory was 311.7MB in the beginning and 605.9MB in the end (delta: -294.2MB). Peak memory consumption was 54.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 126 PlacesBefore, 40 PlacesAfterwards, 119 TransitionsBefore, 31 TransitionsAfterwards, 2984 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 107 TotalNumberOfCompositions, 10888 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3744, independent: 3441, independent conditional: 0, independent unconditional: 3441, dependent: 303, dependent conditional: 0, dependent unconditional: 303, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1735, independent: 1682, independent conditional: 0, independent unconditional: 1682, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3744, independent: 1759, independent conditional: 0, independent unconditional: 1759, dependent: 250, dependent conditional: 0, dependent unconditional: 250, unknown: 1735, unknown conditional: 0, unknown unconditional: 1735] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 160, Positive conditional cache size: 0, Positive unconditional cache size: 160, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1105; [L844] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1105, ((void *)0), P0, ((void *)0))=-3, t1105={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1106; [L846] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1106, ((void *)0), P1, ((void *)0))=-2, t1105={5:0}, t1106={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1107; [L848] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1107, ((void *)0), P2, ((void *)0))=-1, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L776] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] EXPR 2 __unbuffered_cnt + 1 [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L796] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L828] EXPR 3 __unbuffered_cnt + 1 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L769] EXPR 1 __unbuffered_cnt + 1 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L861] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix042.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: 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: 844]: 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, 156 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: 12.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 444 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 444 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1407 IncrementalHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 18 mSDtfsCounter, 1407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=637occurred in iteration=8, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 1371 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:47:19,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...