/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 -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/weaver/popl20-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 01:12:17,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 01:12:17,508 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 01:12:17,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 01:12:17,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 01:12:17,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 01:12:17,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 01:12:17,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 01:12:17,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 01:12:17,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 01:12:17,534 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 01:12:17,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 01:12:17,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 01:12:17,535 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 01:12:17,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 01:12:17,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 01:12:17,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 01:12:17,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 01:12:17,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 01:12:17,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 01:12:17,537 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 01:12:17,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 01:12:17,538 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 01:12:17,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 01:12:17,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 01:12:17,539 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 01:12:17,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 01:12:17,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 01:12:17,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 01:12:17,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 01:12:17,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 01:12:17,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 01:12:17,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 01:12:17,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 01:12:17,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 01:12:17,541 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.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 01:12:17,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 01:12:17,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 01:12:17,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 01:12:17,870 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 01:12:17,871 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 01:12:17,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2023-08-27 01:12:19,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 01:12:19,265 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 01:12:19,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2023-08-27 01:12:19,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40eac9057/67282ecfb3e4444abfbbd93b69a4a182/FLAGcc7614247 [2023-08-27 01:12:19,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40eac9057/67282ecfb3e4444abfbbd93b69a4a182 [2023-08-27 01:12:19,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 01:12:19,293 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 01:12:19,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 01:12:19,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 01:12:19,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 01:12:19,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 01:12:19" (1/1) ... [2023-08-27 01:12:19,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28eca726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:12:19, skipping insertion in model container [2023-08-27 01:12:19,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 01:12:19" (1/1) ... [2023-08-27 01:12:19,324 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 01:12:19,521 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 01:12:19,532 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 01:12:19,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 01:12:19,579 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 01:12:19,579 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 01:12:19,585 INFO L206 MainTranslator]: Completed translation [2023-08-27 01:12:19,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:12:19 WrapperNode [2023-08-27 01:12:19,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 01:12:19,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 01:12:19,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 01:12:19,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 01:12:19,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:12:19" (1/1) ... [2023-08-27 01:12:19,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:12:19" (1/1) ... [2023-08-27 01:12:19,646 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 12, calls inlined = 14, statements flattened = 210 [2023-08-27 01:12:19,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 01:12:19,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 01:12:19,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 01:12:19,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 01:12:19,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:12:19" (1/1) ... [2023-08-27 01:12:19,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:12:19" (1/1) ... [2023-08-27 01:12:19,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:12:19" (1/1) ... [2023-08-27 01:12:19,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:12:19" (1/1) ... [2023-08-27 01:12:19,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:12:19" (1/1) ... [2023-08-27 01:12:19,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:12:19" (1/1) ... [2023-08-27 01:12:19,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:12:19" (1/1) ... [2023-08-27 01:12:19,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:12:19" (1/1) ... [2023-08-27 01:12:19,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 01:12:19,693 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 01:12:19,693 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 01:12:19,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 01:12:19,693 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:12:19" (1/1) ... [2023-08-27 01:12:19,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 01:12:19,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:12:19,729 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 01:12:19,756 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 01:12:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 01:12:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-27 01:12:19,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-27 01:12:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-27 01:12:19,770 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-27 01:12:19,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 01:12:19,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 01:12:19,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 01:12:19,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 01:12:19,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 01:12:19,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-27 01:12:19,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 01:12:19,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 01:12:19,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 01:12:19,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 01:12:19,773 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 01:12:19,887 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 01:12:19,888 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 01:12:20,154 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 01:12:20,288 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 01:12:20,288 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-27 01:12:20,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:12:20 BoogieIcfgContainer [2023-08-27 01:12:20,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 01:12:20,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 01:12:20,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 01:12:20,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 01:12:20,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 01:12:19" (1/3) ... [2023-08-27 01:12:20,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b605c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 01:12:20, skipping insertion in model container [2023-08-27 01:12:20,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:12:19" (2/3) ... [2023-08-27 01:12:20,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b605c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 01:12:20, skipping insertion in model container [2023-08-27 01:12:20,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:12:20" (3/3) ... [2023-08-27 01:12:20,297 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2023-08-27 01:12:20,312 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 01:12:20,313 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-27 01:12:20,313 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 01:12:20,405 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-27 01:12:20,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 195 transitions, 406 flow [2023-08-27 01:12:20,542 INFO L124 PetriNetUnfolderBase]: 15/193 cut-off events. [2023-08-27 01:12:20,543 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 01:12:20,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 193 events. 15/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 160 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 157. Up to 2 conditions per place. [2023-08-27 01:12:20,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 195 transitions, 406 flow [2023-08-27 01:12:20,557 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 184 transitions, 380 flow [2023-08-27 01:12:20,560 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 01:12:20,572 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 184 transitions, 380 flow [2023-08-27 01:12:20,575 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 184 transitions, 380 flow [2023-08-27 01:12:20,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 184 transitions, 380 flow [2023-08-27 01:12:20,632 INFO L124 PetriNetUnfolderBase]: 15/184 cut-off events. [2023-08-27 01:12:20,633 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 01:12:20,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 184 events. 15/184 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 159 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 157. Up to 2 conditions per place. [2023-08-27 01:12:20,636 INFO L119 LiptonReduction]: Number of co-enabled transitions 942 [2023-08-27 01:12:26,659 INFO L134 LiptonReduction]: Checked pairs total: 1791 [2023-08-27 01:12:26,660 INFO L136 LiptonReduction]: Total number of compositions: 195 [2023-08-27 01:12:26,673 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 01:12:26,678 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;@771f443, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 01:12:26,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-08-27 01:12:26,680 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 01:12:26,680 INFO L124 PetriNetUnfolderBase]: 1/2 cut-off events. [2023-08-27 01:12:26,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 01:12:26,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:26,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-27 01:12:26,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:26,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash 25974, now seen corresponding path program 1 times [2023-08-27 01:12:26,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:26,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741053842] [2023-08-27 01:12:26,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:26,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:26,920 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 01:12:26,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:26,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741053842] [2023-08-27 01:12:26,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741053842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 01:12:26,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 01:12:26,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 01:12:26,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271876246] [2023-08-27 01:12:26,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 01:12:26,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 01:12:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:26,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 01:12:26,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 01:12:26,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 390 [2023-08-27 01:12:26,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:26,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:26,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 390 [2023-08-27 01:12:26,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:27,058 INFO L124 PetriNetUnfolderBase]: 121/224 cut-off events. [2023-08-27 01:12:27,059 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-27 01:12:27,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 224 events. 121/224 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 929 event pairs, 93 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 396. Up to 214 conditions per place. [2023-08-27 01:12:27,064 INFO L140 encePairwiseOnDemand]: 379/390 looper letters, 28 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2023-08-27 01:12:27,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 148 flow [2023-08-27 01:12:27,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 01:12:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 01:12:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2023-08-27 01:12:27,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2023-08-27 01:12:27,085 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2023-08-27 01:12:27,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2023-08-27 01:12:27,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:27,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2023-08-27 01:12:27,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:27,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:27,102 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:27,103 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 78 flow. Second operand 3 states and 504 transitions. [2023-08-27 01:12:27,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 148 flow [2023-08-27 01:12:27,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 01:12:27,107 INFO L231 Difference]: Finished difference. Result has 33 places, 35 transitions, 110 flow [2023-08-27 01:12:27,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=33, PETRI_TRANSITIONS=35} [2023-08-27 01:12:27,114 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-08-27 01:12:27,114 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 35 transitions, 110 flow [2023-08-27 01:12:27,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:27,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:27,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 01:12:27,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 01:12:27,115 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:27,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:27,116 INFO L85 PathProgramCache]: Analyzing trace with hash 806740, now seen corresponding path program 1 times [2023-08-27 01:12:27,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:27,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86315344] [2023-08-27 01:12:27,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:27,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:27,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:27,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86315344] [2023-08-27 01:12:27,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86315344] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:12:27,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093854130] [2023-08-27 01:12:27,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:27,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:12:27,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:12:27,253 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:12:27,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-27 01:12:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:27,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-27 01:12:27,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:12:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:27,410 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 01:12:27,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093854130] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 01:12:27,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 01:12:27,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2023-08-27 01:12:27,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376987878] [2023-08-27 01:12:27,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 01:12:27,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 01:12:27,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:27,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 01:12:27,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-27 01:12:27,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 390 [2023-08-27 01:12:27,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 35 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:27,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:27,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 390 [2023-08-27 01:12:27,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:27,509 INFO L124 PetriNetUnfolderBase]: 121/222 cut-off events. [2023-08-27 01:12:27,510 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 01:12:27,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 222 events. 121/222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 934 event pairs, 93 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 423. Up to 206 conditions per place. [2023-08-27 01:12:27,513 INFO L140 encePairwiseOnDemand]: 383/390 looper letters, 25 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2023-08-27 01:12:27,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 164 flow [2023-08-27 01:12:27,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 01:12:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 01:12:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 653 transitions. [2023-08-27 01:12:27,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4185897435897436 [2023-08-27 01:12:27,516 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 653 transitions. [2023-08-27 01:12:27,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 653 transitions. [2023-08-27 01:12:27,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:27,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 653 transitions. [2023-08-27 01:12:27,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 163.25) internal successors, (653), 4 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:27,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 390.0) internal successors, (1950), 5 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:27,526 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 390.0) internal successors, (1950), 5 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:27,526 INFO L175 Difference]: Start difference. First operand has 33 places, 35 transitions, 110 flow. Second operand 4 states and 653 transitions. [2023-08-27 01:12:27,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 164 flow [2023-08-27 01:12:27,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 01:12:27,532 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 104 flow [2023-08-27 01:12:27,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2023-08-27 01:12:27,533 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2023-08-27 01:12:27,533 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 104 flow [2023-08-27 01:12:27,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:27,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:27,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 01:12:27,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-27 01:12:27,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:12:27,740 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:27,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash 806767, now seen corresponding path program 1 times [2023-08-27 01:12:27,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:27,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539351077] [2023-08-27 01:12:27,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:27,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:27,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:27,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539351077] [2023-08-27 01:12:27,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539351077] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:12:27,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824297760] [2023-08-27 01:12:27,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:27,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:12:27,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:12:27,826 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:12:27,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-27 01:12:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:27,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-27 01:12:27,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:12:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:27,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 01:12:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:27,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824297760] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 01:12:27,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 01:12:27,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2023-08-27 01:12:27,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343081215] [2023-08-27 01:12:27,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 01:12:27,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 01:12:27,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:27,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 01:12:27,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 01:12:27,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 390 [2023-08-27 01:12:27,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 104 flow. Second operand has 7 states, 7 states have (on average 156.14285714285714) internal successors, (1093), 7 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:27,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:27,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 390 [2023-08-27 01:12:27,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:28,037 INFO L124 PetriNetUnfolderBase]: 127/234 cut-off events. [2023-08-27 01:12:28,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 01:12:28,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 234 events. 127/234 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 967 event pairs, 93 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 423. Up to 215 conditions per place. [2023-08-27 01:12:28,039 INFO L140 encePairwiseOnDemand]: 383/390 looper letters, 26 selfloop transitions, 17 changer transitions 0/45 dead transitions. [2023-08-27 01:12:28,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 250 flow [2023-08-27 01:12:28,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 01:12:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 01:12:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 979 transitions. [2023-08-27 01:12:28,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4183760683760684 [2023-08-27 01:12:28,042 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 979 transitions. [2023-08-27 01:12:28,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 979 transitions. [2023-08-27 01:12:28,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:28,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 979 transitions. [2023-08-27 01:12:28,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 163.16666666666666) internal successors, (979), 6 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:28,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 390.0) internal successors, (2730), 7 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:28,050 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 390.0) internal successors, (2730), 7 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:28,050 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 104 flow. Second operand 6 states and 979 transitions. [2023-08-27 01:12:28,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 250 flow [2023-08-27 01:12:28,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 01:12:28,052 INFO L231 Difference]: Finished difference. Result has 38 places, 45 transitions, 220 flow [2023-08-27 01:12:28,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=38, PETRI_TRANSITIONS=45} [2023-08-27 01:12:28,053 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2023-08-27 01:12:28,053 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 45 transitions, 220 flow [2023-08-27 01:12:28,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 156.14285714285714) internal successors, (1093), 7 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:28,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:28,054 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2023-08-27 01:12:28,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-27 01:12:28,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-27 01:12:28,260 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:28,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:28,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1734677231, now seen corresponding path program 2 times [2023-08-27 01:12:28,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:28,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163168787] [2023-08-27 01:12:28,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:28,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:28,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:28,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163168787] [2023-08-27 01:12:28,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163168787] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:12:28,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731568005] [2023-08-27 01:12:28,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 01:12:28,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:12:28,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:12:28,380 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:12:28,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-27 01:12:28,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-27 01:12:28,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 01:12:28,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-27 01:12:28,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:12:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-27 01:12:28,473 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 01:12:28,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731568005] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 01:12:28,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 01:12:28,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2023-08-27 01:12:28,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567895181] [2023-08-27 01:12:28,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 01:12:28,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 01:12:28,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:28,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 01:12:28,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-27 01:12:28,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 390 [2023-08-27 01:12:28,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 45 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:28,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:28,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 390 [2023-08-27 01:12:28,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:28,533 INFO L124 PetriNetUnfolderBase]: 127/233 cut-off events. [2023-08-27 01:12:28,533 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-27 01:12:28,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 233 events. 127/233 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 958 event pairs, 93 based on Foata normal form. 1/144 useless extension candidates. Maximal degree in co-relation 474. Up to 220 conditions per place. [2023-08-27 01:12:28,535 INFO L140 encePairwiseOnDemand]: 387/390 looper letters, 36 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2023-08-27 01:12:28,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 44 transitions, 294 flow [2023-08-27 01:12:28,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 01:12:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 01:12:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2023-08-27 01:12:28,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4256410256410256 [2023-08-27 01:12:28,537 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 498 transitions. [2023-08-27 01:12:28,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions. [2023-08-27 01:12:28,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:28,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions. [2023-08-27 01:12:28,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:28,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:28,541 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:28,541 INFO L175 Difference]: Start difference. First operand has 38 places, 45 transitions, 220 flow. Second operand 3 states and 498 transitions. [2023-08-27 01:12:28,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 44 transitions, 294 flow [2023-08-27 01:12:28,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 268 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-27 01:12:28,544 INFO L231 Difference]: Finished difference. Result has 38 places, 44 transitions, 196 flow [2023-08-27 01:12:28,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=38, PETRI_TRANSITIONS=44} [2023-08-27 01:12:28,544 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2023-08-27 01:12:28,545 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 44 transitions, 196 flow [2023-08-27 01:12:28,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:28,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:28,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 01:12:28,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-27 01:12:28,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:12:28,760 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:28,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:28,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1721477912, now seen corresponding path program 1 times [2023-08-27 01:12:28,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:28,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434118292] [2023-08-27 01:12:28,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:28,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:28,803 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 01:12:28,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:28,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434118292] [2023-08-27 01:12:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434118292] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 01:12:28,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 01:12:28,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 01:12:28,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533423546] [2023-08-27 01:12:28,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 01:12:28,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 01:12:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:28,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 01:12:28,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 01:12:28,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 390 [2023-08-27 01:12:28,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 44 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:28,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:28,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 390 [2023-08-27 01:12:28,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:28,896 INFO L124 PetriNetUnfolderBase]: 293/497 cut-off events. [2023-08-27 01:12:28,896 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-27 01:12:28,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 497 events. 293/497 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1956 event pairs, 87 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 1013. Up to 279 conditions per place. [2023-08-27 01:12:28,899 INFO L140 encePairwiseOnDemand]: 386/390 looper letters, 61 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-08-27 01:12:28,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 63 transitions, 363 flow [2023-08-27 01:12:28,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 01:12:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 01:12:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2023-08-27 01:12:28,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4623931623931624 [2023-08-27 01:12:28,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2023-08-27 01:12:28,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2023-08-27 01:12:28,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:28,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2023-08-27 01:12:28,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:28,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:28,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:28,905 INFO L175 Difference]: Start difference. First operand has 38 places, 44 transitions, 196 flow. Second operand 3 states and 541 transitions. [2023-08-27 01:12:28,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 63 transitions, 363 flow [2023-08-27 01:12:28,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 63 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 01:12:28,907 INFO L231 Difference]: Finished difference. Result has 39 places, 45 transitions, 198 flow [2023-08-27 01:12:28,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=39, PETRI_TRANSITIONS=45} [2023-08-27 01:12:28,908 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2023-08-27 01:12:28,908 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 45 transitions, 198 flow [2023-08-27 01:12:28,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:28,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:28,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 01:12:28,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 01:12:28,909 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:28,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:28,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1721481294, now seen corresponding path program 1 times [2023-08-27 01:12:28,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:28,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098444914] [2023-08-27 01:12:28,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:28,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:28,970 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 01:12:28,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:28,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098444914] [2023-08-27 01:12:28,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098444914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 01:12:28,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 01:12:28,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 01:12:28,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030919629] [2023-08-27 01:12:28,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 01:12:28,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 01:12:28,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:28,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 01:12:28,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 01:12:28,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 390 [2023-08-27 01:12:28,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 45 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:28,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:28,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 390 [2023-08-27 01:12:28,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:29,087 INFO L124 PetriNetUnfolderBase]: 284/543 cut-off events. [2023-08-27 01:12:29,087 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-08-27 01:12:29,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 543 events. 284/543 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2926 event pairs, 230 based on Foata normal form. 12/371 useless extension candidates. Maximal degree in co-relation 1180. Up to 382 conditions per place. [2023-08-27 01:12:29,090 INFO L140 encePairwiseOnDemand]: 381/390 looper letters, 64 selfloop transitions, 5 changer transitions 1/72 dead transitions. [2023-08-27 01:12:29,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 453 flow [2023-08-27 01:12:29,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 01:12:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 01:12:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 772 transitions. [2023-08-27 01:12:29,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958974358974359 [2023-08-27 01:12:29,093 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 772 transitions. [2023-08-27 01:12:29,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 772 transitions. [2023-08-27 01:12:29,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:29,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 772 transitions. [2023-08-27 01:12:29,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.4) internal successors, (772), 5 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:29,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 390.0) internal successors, (2340), 6 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:29,098 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 390.0) internal successors, (2340), 6 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:29,098 INFO L175 Difference]: Start difference. First operand has 39 places, 45 transitions, 198 flow. Second operand 5 states and 772 transitions. [2023-08-27 01:12:29,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 453 flow [2023-08-27 01:12:29,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 72 transitions, 450 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 01:12:29,100 INFO L231 Difference]: Finished difference. Result has 44 places, 47 transitions, 235 flow [2023-08-27 01:12:29,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=44, PETRI_TRANSITIONS=47} [2023-08-27 01:12:29,101 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2023-08-27 01:12:29,101 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 47 transitions, 235 flow [2023-08-27 01:12:29,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:29,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:29,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:12:29,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 01:12:29,102 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:29,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:29,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2072777360, now seen corresponding path program 1 times [2023-08-27 01:12:29,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:29,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315403970] [2023-08-27 01:12:29,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:29,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 01:12:29,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:29,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315403970] [2023-08-27 01:12:29,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315403970] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 01:12:29,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 01:12:29,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 01:12:29,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945962809] [2023-08-27 01:12:29,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 01:12:29,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 01:12:29,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:29,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 01:12:29,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-27 01:12:29,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 390 [2023-08-27 01:12:29,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 47 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:29,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:29,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 390 [2023-08-27 01:12:29,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:29,302 INFO L124 PetriNetUnfolderBase]: 394/701 cut-off events. [2023-08-27 01:12:29,302 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-08-27 01:12:29,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1704 conditions, 701 events. 394/701 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3161 event pairs, 84 based on Foata normal form. 2/527 useless extension candidates. Maximal degree in co-relation 1622. Up to 401 conditions per place. [2023-08-27 01:12:29,306 INFO L140 encePairwiseOnDemand]: 384/390 looper letters, 61 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2023-08-27 01:12:29,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 429 flow [2023-08-27 01:12:29,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 01:12:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 01:12:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 737 transitions. [2023-08-27 01:12:29,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3779487179487179 [2023-08-27 01:12:29,308 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 737 transitions. [2023-08-27 01:12:29,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 737 transitions. [2023-08-27 01:12:29,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:29,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 737 transitions. [2023-08-27 01:12:29,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.4) internal successors, (737), 5 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:29,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 390.0) internal successors, (2340), 6 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:29,313 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 390.0) internal successors, (2340), 6 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:29,313 INFO L175 Difference]: Start difference. First operand has 44 places, 47 transitions, 235 flow. Second operand 5 states and 737 transitions. [2023-08-27 01:12:29,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 429 flow [2023-08-27 01:12:29,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 421 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-27 01:12:29,316 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 245 flow [2023-08-27 01:12:29,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2023-08-27 01:12:29,317 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2023-08-27 01:12:29,317 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 245 flow [2023-08-27 01:12:29,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:29,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:29,317 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-27 01:12:29,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 01:12:29,317 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:29,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:29,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1838394981, now seen corresponding path program 1 times [2023-08-27 01:12:29,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:29,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749739179] [2023-08-27 01:12:29,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:29,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:29,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:29,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749739179] [2023-08-27 01:12:29,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749739179] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:12:29,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276221703] [2023-08-27 01:12:29,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:29,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:12:29,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:12:29,409 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:12:29,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-27 01:12:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:29,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-27 01:12:29,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:12:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:29,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 01:12:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:29,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276221703] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 01:12:29,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 01:12:29,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-27 01:12:29,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223015108] [2023-08-27 01:12:29,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 01:12:29,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-27 01:12:29,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:29,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-27 01:12:29,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-27 01:12:29,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 390 [2023-08-27 01:12:29,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 245 flow. Second operand has 13 states, 13 states have (on average 156.15384615384616) internal successors, (2030), 13 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:29,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:29,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 390 [2023-08-27 01:12:29,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:29,718 INFO L124 PetriNetUnfolderBase]: 300/577 cut-off events. [2023-08-27 01:12:29,718 INFO L125 PetriNetUnfolderBase]: For 171/177 co-relation queries the response was YES. [2023-08-27 01:12:29,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1588 conditions, 577 events. 300/577 cut-off events. For 171/177 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3077 event pairs, 230 based on Foata normal form. 12/466 useless extension candidates. Maximal degree in co-relation 1351. Up to 527 conditions per place. [2023-08-27 01:12:29,722 INFO L140 encePairwiseOnDemand]: 384/390 looper letters, 27 selfloop transitions, 41 changer transitions 0/70 dead transitions. [2023-08-27 01:12:29,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 549 flow [2023-08-27 01:12:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 01:12:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 01:12:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1931 transitions. [2023-08-27 01:12:29,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4126068376068376 [2023-08-27 01:12:29,727 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1931 transitions. [2023-08-27 01:12:29,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1931 transitions. [2023-08-27 01:12:29,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:29,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1931 transitions. [2023-08-27 01:12:29,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 160.91666666666666) internal successors, (1931), 12 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:29,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 390.0) internal successors, (5070), 13 states have internal predecessors, (5070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:29,739 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 390.0) internal successors, (5070), 13 states have internal predecessors, (5070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:29,739 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 245 flow. Second operand 12 states and 1931 transitions. [2023-08-27 01:12:29,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 549 flow [2023-08-27 01:12:29,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 529 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-27 01:12:29,742 INFO L231 Difference]: Finished difference. Result has 62 places, 70 transitions, 529 flow [2023-08-27 01:12:29,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=529, PETRI_PLACES=62, PETRI_TRANSITIONS=70} [2023-08-27 01:12:29,744 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 27 predicate places. [2023-08-27 01:12:29,744 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 70 transitions, 529 flow [2023-08-27 01:12:29,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 156.15384615384616) internal successors, (2030), 13 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:29,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:29,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:12:29,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-27 01:12:29,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:12:29,959 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:29,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:29,960 INFO L85 PathProgramCache]: Analyzing trace with hash -180103918, now seen corresponding path program 1 times [2023-08-27 01:12:29,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:29,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695606211] [2023-08-27 01:12:29,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:29,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 01:12:30,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:30,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695606211] [2023-08-27 01:12:30,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695606211] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:12:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493531411] [2023-08-27 01:12:30,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:30,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:12:30,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:12:30,069 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:12:30,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-27 01:12:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:30,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-27 01:12:30,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:12:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 01:12:30,192 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 01:12:30,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493531411] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 01:12:30,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 01:12:30,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2023-08-27 01:12:30,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334284936] [2023-08-27 01:12:30,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 01:12:30,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 01:12:30,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:30,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 01:12:30,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 01:12:30,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 390 [2023-08-27 01:12:30,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 70 transitions, 529 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:30,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:30,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 390 [2023-08-27 01:12:30,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:30,266 INFO L124 PetriNetUnfolderBase]: 232/461 cut-off events. [2023-08-27 01:12:30,267 INFO L125 PetriNetUnfolderBase]: For 150/152 co-relation queries the response was YES. [2023-08-27 01:12:30,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 461 events. 232/461 cut-off events. For 150/152 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2298 event pairs, 168 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 1241. Up to 449 conditions per place. [2023-08-27 01:12:30,270 INFO L140 encePairwiseOnDemand]: 387/390 looper letters, 65 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2023-08-27 01:12:30,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 653 flow [2023-08-27 01:12:30,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 01:12:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 01:12:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2023-08-27 01:12:30,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.452991452991453 [2023-08-27 01:12:30,273 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 530 transitions. [2023-08-27 01:12:30,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 530 transitions. [2023-08-27 01:12:30,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:30,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 530 transitions. [2023-08-27 01:12:30,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:30,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:30,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:30,277 INFO L175 Difference]: Start difference. First operand has 62 places, 70 transitions, 529 flow. Second operand 3 states and 530 transitions. [2023-08-27 01:12:30,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 653 flow [2023-08-27 01:12:30,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 529 flow, removed 39 selfloop flow, removed 5 redundant places. [2023-08-27 01:12:30,281 INFO L231 Difference]: Finished difference. Result has 57 places, 68 transitions, 399 flow [2023-08-27 01:12:30,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=399, PETRI_PLACES=57, PETRI_TRANSITIONS=68} [2023-08-27 01:12:30,283 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2023-08-27 01:12:30,283 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 68 transitions, 399 flow [2023-08-27 01:12:30,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:30,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:30,283 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:12:30,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-27 01:12:30,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:12:30,496 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:30,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:30,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1088163945, now seen corresponding path program 1 times [2023-08-27 01:12:30,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:30,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957537340] [2023-08-27 01:12:30,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:30,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 01:12:30,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:30,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957537340] [2023-08-27 01:12:30,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957537340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 01:12:30,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 01:12:30,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 01:12:30,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043843453] [2023-08-27 01:12:30,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 01:12:30,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 01:12:30,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:30,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 01:12:30,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 01:12:30,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 390 [2023-08-27 01:12:30,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 68 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:30,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:30,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 390 [2023-08-27 01:12:30,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:30,616 INFO L124 PetriNetUnfolderBase]: 311/566 cut-off events. [2023-08-27 01:12:30,616 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2023-08-27 01:12:30,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1510 conditions, 566 events. 311/566 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2370 event pairs, 217 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 1487. Up to 566 conditions per place. [2023-08-27 01:12:30,619 INFO L140 encePairwiseOnDemand]: 388/390 looper letters, 66 selfloop transitions, 1 changer transitions 0/67 dead transitions. [2023-08-27 01:12:30,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 67 transitions, 529 flow [2023-08-27 01:12:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 01:12:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 01:12:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2023-08-27 01:12:30,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4427350427350427 [2023-08-27 01:12:30,621 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2023-08-27 01:12:30,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2023-08-27 01:12:30,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:30,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2023-08-27 01:12:30,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:30,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:30,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:30,625 INFO L175 Difference]: Start difference. First operand has 57 places, 68 transitions, 399 flow. Second operand 3 states and 518 transitions. [2023-08-27 01:12:30,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 67 transitions, 529 flow [2023-08-27 01:12:30,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 67 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 01:12:30,631 INFO L231 Difference]: Finished difference. Result has 57 places, 67 transitions, 396 flow [2023-08-27 01:12:30,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=57, PETRI_TRANSITIONS=67} [2023-08-27 01:12:30,632 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2023-08-27 01:12:30,632 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 67 transitions, 396 flow [2023-08-27 01:12:30,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:30,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:30,633 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:12:30,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 01:12:30,633 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:30,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:30,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1088163944, now seen corresponding path program 1 times [2023-08-27 01:12:30,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:30,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720560816] [2023-08-27 01:12:30,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:30,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 01:12:30,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:30,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720560816] [2023-08-27 01:12:30,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720560816] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:12:30,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18875146] [2023-08-27 01:12:30,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:30,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:12:30,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:12:30,675 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:12:30,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-27 01:12:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:30,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-27 01:12:30,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:12:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:30,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 01:12:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:30,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18875146] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 01:12:30,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 01:12:30,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 6, 6] total 12 [2023-08-27 01:12:30,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666157576] [2023-08-27 01:12:30,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 01:12:30,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-27 01:12:30,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:30,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-27 01:12:30,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-08-27 01:12:30,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 390 [2023-08-27 01:12:30,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 67 transitions, 396 flow. Second operand has 13 states, 13 states have (on average 137.92307692307693) internal successors, (1793), 13 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:30,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:30,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 390 [2023-08-27 01:12:30,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:31,211 INFO L124 PetriNetUnfolderBase]: 590/1065 cut-off events. [2023-08-27 01:12:31,211 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2023-08-27 01:12:31,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2703 conditions, 1065 events. 590/1065 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5150 event pairs, 118 based on Foata normal form. 18/993 useless extension candidates. Maximal degree in co-relation 2679. Up to 216 conditions per place. [2023-08-27 01:12:31,217 INFO L140 encePairwiseOnDemand]: 380/390 looper letters, 122 selfloop transitions, 24 changer transitions 0/146 dead transitions. [2023-08-27 01:12:31,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 146 transitions, 892 flow [2023-08-27 01:12:31,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-27 01:12:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-27 01:12:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1880 transitions. [2023-08-27 01:12:31,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3708086785009862 [2023-08-27 01:12:31,223 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1880 transitions. [2023-08-27 01:12:31,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1880 transitions. [2023-08-27 01:12:31,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:31,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1880 transitions. [2023-08-27 01:12:31,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 144.6153846153846) internal successors, (1880), 13 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:31,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 390.0) internal successors, (5460), 14 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:31,234 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 390.0) internal successors, (5460), 14 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:31,234 INFO L175 Difference]: Start difference. First operand has 57 places, 67 transitions, 396 flow. Second operand 13 states and 1880 transitions. [2023-08-27 01:12:31,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 146 transitions, 892 flow [2023-08-27 01:12:31,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 146 transitions, 891 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 01:12:31,238 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 479 flow [2023-08-27 01:12:31,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=479, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2023-08-27 01:12:31,239 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2023-08-27 01:12:31,239 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 479 flow [2023-08-27 01:12:31,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 137.92307692307693) internal successors, (1793), 13 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:31,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:31,240 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-27 01:12:31,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-27 01:12:31,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:12:31,446 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:31,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:31,446 INFO L85 PathProgramCache]: Analyzing trace with hash 154724299, now seen corresponding path program 2 times [2023-08-27 01:12:31,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:31,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303500005] [2023-08-27 01:12:31,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:31,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 01:12:31,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303500005] [2023-08-27 01:12:31,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303500005] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:12:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756984508] [2023-08-27 01:12:31,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 01:12:31,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:12:31,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:12:31,512 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:12:31,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-27 01:12:31,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-27 01:12:31,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 01:12:31,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-27 01:12:31,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:12:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-27 01:12:31,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 01:12:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-27 01:12:31,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756984508] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 01:12:31,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 01:12:31,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 5 [2023-08-27 01:12:31,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518303567] [2023-08-27 01:12:31,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 01:12:31,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 01:12:31,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:31,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 01:12:31,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 01:12:31,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 390 [2023-08-27 01:12:31,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 479 flow. Second operand has 7 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:31,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:31,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 390 [2023-08-27 01:12:31,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:31,907 INFO L124 PetriNetUnfolderBase]: 771/1382 cut-off events. [2023-08-27 01:12:31,907 INFO L125 PetriNetUnfolderBase]: For 627/627 co-relation queries the response was YES. [2023-08-27 01:12:31,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3900 conditions, 1382 events. 771/1382 cut-off events. For 627/627 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6708 event pairs, 149 based on Foata normal form. 0/1274 useless extension candidates. Maximal degree in co-relation 3873. Up to 438 conditions per place. [2023-08-27 01:12:31,914 INFO L140 encePairwiseOnDemand]: 385/390 looper letters, 124 selfloop transitions, 8 changer transitions 0/132 dead transitions. [2023-08-27 01:12:31,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 132 transitions, 913 flow [2023-08-27 01:12:31,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 01:12:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 01:12:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1211 transitions. [2023-08-27 01:12:31,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44358974358974357 [2023-08-27 01:12:31,918 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1211 transitions. [2023-08-27 01:12:31,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1211 transitions. [2023-08-27 01:12:31,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:31,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1211 transitions. [2023-08-27 01:12:31,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:31,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 390.0) internal successors, (3120), 8 states have internal predecessors, (3120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:31,936 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 390.0) internal successors, (3120), 8 states have internal predecessors, (3120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:31,936 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 479 flow. Second operand 7 states and 1211 transitions. [2023-08-27 01:12:31,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 132 transitions, 913 flow [2023-08-27 01:12:31,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 132 transitions, 849 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-27 01:12:31,941 INFO L231 Difference]: Finished difference. Result has 72 places, 74 transitions, 450 flow [2023-08-27 01:12:31,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=450, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2023-08-27 01:12:31,941 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2023-08-27 01:12:31,942 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 450 flow [2023-08-27 01:12:31,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:31,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:31,942 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2023-08-27 01:12:31,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-27 01:12:32,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:12:32,143 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:32,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:32,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1713134171, now seen corresponding path program 2 times [2023-08-27 01:12:32,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:32,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076199016] [2023-08-27 01:12:32,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:32,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:32,311 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:32,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:32,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076199016] [2023-08-27 01:12:32,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076199016] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:12:32,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407990429] [2023-08-27 01:12:32,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 01:12:32,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:12:32,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:12:32,312 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:12:32,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-27 01:12:32,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-27 01:12:32,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 01:12:32,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-27 01:12:32,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:12:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 01:12:32,425 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 01:12:32,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407990429] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 01:12:32,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 01:12:32,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [12] total 14 [2023-08-27 01:12:32,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817674437] [2023-08-27 01:12:32,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 01:12:32,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 01:12:32,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:32,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 01:12:32,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2023-08-27 01:12:32,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 390 [2023-08-27 01:12:32,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 450 flow. Second operand has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:32,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:32,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 390 [2023-08-27 01:12:32,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:32,565 INFO L124 PetriNetUnfolderBase]: 771/1380 cut-off events. [2023-08-27 01:12:32,566 INFO L125 PetriNetUnfolderBase]: For 747/747 co-relation queries the response was YES. [2023-08-27 01:12:32,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4010 conditions, 1380 events. 771/1380 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6702 event pairs, 571 based on Foata normal form. 2/1274 useless extension candidates. Maximal degree in co-relation 3983. Up to 1380 conditions per place. [2023-08-27 01:12:32,574 INFO L140 encePairwiseOnDemand]: 388/390 looper letters, 72 selfloop transitions, 1 changer transitions 0/73 dead transitions. [2023-08-27 01:12:32,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 73 transitions, 572 flow [2023-08-27 01:12:32,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 01:12:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 01:12:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2023-08-27 01:12:32,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4025641025641026 [2023-08-27 01:12:32,576 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions. [2023-08-27 01:12:32,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions. [2023-08-27 01:12:32,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:32,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions. [2023-08-27 01:12:32,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:32,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:32,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:32,579 INFO L175 Difference]: Start difference. First operand has 72 places, 74 transitions, 450 flow. Second operand 3 states and 471 transitions. [2023-08-27 01:12:32,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 73 transitions, 572 flow [2023-08-27 01:12:32,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 472 flow, removed 9 selfloop flow, removed 15 redundant places. [2023-08-27 01:12:32,583 INFO L231 Difference]: Finished difference. Result has 57 places, 73 transitions, 328 flow [2023-08-27 01:12:32,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=57, PETRI_TRANSITIONS=73} [2023-08-27 01:12:32,584 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2023-08-27 01:12:32,584 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 73 transitions, 328 flow [2023-08-27 01:12:32,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:32,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:32,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:12:32,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-27 01:12:32,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-27 01:12:32,790 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:32,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:32,791 INFO L85 PathProgramCache]: Analyzing trace with hash -981503638, now seen corresponding path program 1 times [2023-08-27 01:12:32,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:32,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462690312] [2023-08-27 01:12:32,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:32,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:32,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:32,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462690312] [2023-08-27 01:12:32,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462690312] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:12:32,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973989510] [2023-08-27 01:12:32,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:32,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:12:32,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:12:32,880 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:12:32,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-27 01:12:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:32,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-27 01:12:32,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:12:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:33,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 01:12:33,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:33,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973989510] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-27 01:12:33,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-27 01:12:33,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 9 [2023-08-27 01:12:33,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570851706] [2023-08-27 01:12:33,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 01:12:33,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 01:12:33,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:33,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 01:12:33,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-08-27 01:12:33,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 390 [2023-08-27 01:12:33,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 73 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:33,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:33,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 390 [2023-08-27 01:12:33,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:33,186 INFO L124 PetriNetUnfolderBase]: 718/1291 cut-off events. [2023-08-27 01:12:33,186 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2023-08-27 01:12:33,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3464 conditions, 1291 events. 718/1291 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6090 event pairs, 118 based on Foata normal form. 36/1219 useless extension candidates. Maximal degree in co-relation 3449. Up to 561 conditions per place. [2023-08-27 01:12:33,194 INFO L140 encePairwiseOnDemand]: 383/390 looper letters, 66 selfloop transitions, 23 changer transitions 0/89 dead transitions. [2023-08-27 01:12:33,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 89 transitions, 548 flow [2023-08-27 01:12:33,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 01:12:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 01:12:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 860 transitions. [2023-08-27 01:12:33,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36752136752136755 [2023-08-27 01:12:33,197 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 860 transitions. [2023-08-27 01:12:33,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 860 transitions. [2023-08-27 01:12:33,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:33,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 860 transitions. [2023-08-27 01:12:33,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.33333333333334) internal successors, (860), 6 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:33,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 390.0) internal successors, (2730), 7 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:33,202 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 390.0) internal successors, (2730), 7 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:33,202 INFO L175 Difference]: Start difference. First operand has 57 places, 73 transitions, 328 flow. Second operand 6 states and 860 transitions. [2023-08-27 01:12:33,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 89 transitions, 548 flow [2023-08-27 01:12:33,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 547 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 01:12:33,205 INFO L231 Difference]: Finished difference. Result has 60 places, 73 transitions, 389 flow [2023-08-27 01:12:33,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=389, PETRI_PLACES=60, PETRI_TRANSITIONS=73} [2023-08-27 01:12:33,206 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2023-08-27 01:12:33,206 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 73 transitions, 389 flow [2023-08-27 01:12:33,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:33,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:33,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:12:33,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-27 01:12:33,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-27 01:12:33,412 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:33,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:33,413 INFO L85 PathProgramCache]: Analyzing trace with hash 844273561, now seen corresponding path program 1 times [2023-08-27 01:12:33,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:33,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909625615] [2023-08-27 01:12:33,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:33,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 01:12:33,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:33,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909625615] [2023-08-27 01:12:33,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909625615] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 01:12:33,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 01:12:33,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 01:12:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207554186] [2023-08-27 01:12:33,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 01:12:33,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 01:12:33,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:33,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 01:12:33,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 01:12:33,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 390 [2023-08-27 01:12:33,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 73 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 158.25) internal successors, (633), 4 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:33,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:33,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 390 [2023-08-27 01:12:33,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:33,790 INFO L124 PetriNetUnfolderBase]: 1078/1929 cut-off events. [2023-08-27 01:12:33,790 INFO L125 PetriNetUnfolderBase]: For 1049/1049 co-relation queries the response was YES. [2023-08-27 01:12:33,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5719 conditions, 1929 events. 1078/1929 cut-off events. For 1049/1049 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 10235 event pairs, 319 based on Foata normal form. 110/1907 useless extension candidates. Maximal degree in co-relation 5702. Up to 991 conditions per place. [2023-08-27 01:12:33,801 INFO L140 encePairwiseOnDemand]: 383/390 looper letters, 91 selfloop transitions, 25 changer transitions 0/116 dead transitions. [2023-08-27 01:12:33,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 837 flow [2023-08-27 01:12:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 01:12:33,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 01:12:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 822 transitions. [2023-08-27 01:12:33,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42153846153846153 [2023-08-27 01:12:33,804 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 822 transitions. [2023-08-27 01:12:33,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 822 transitions. [2023-08-27 01:12:33,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:33,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 822 transitions. [2023-08-27 01:12:33,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:33,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 390.0) internal successors, (2340), 6 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:33,809 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 390.0) internal successors, (2340), 6 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:33,809 INFO L175 Difference]: Start difference. First operand has 60 places, 73 transitions, 389 flow. Second operand 5 states and 822 transitions. [2023-08-27 01:12:33,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 837 flow [2023-08-27 01:12:33,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 116 transitions, 804 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-27 01:12:33,815 INFO L231 Difference]: Finished difference. Result has 65 places, 92 transitions, 601 flow [2023-08-27 01:12:33,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=601, PETRI_PLACES=65, PETRI_TRANSITIONS=92} [2023-08-27 01:12:33,816 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2023-08-27 01:12:33,816 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 92 transitions, 601 flow [2023-08-27 01:12:33,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.25) internal successors, (633), 4 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:33,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:33,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:12:33,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 01:12:33,817 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:33,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:33,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1264735683, now seen corresponding path program 2 times [2023-08-27 01:12:33,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:33,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248793267] [2023-08-27 01:12:33,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:33,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 01:12:33,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:33,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248793267] [2023-08-27 01:12:33,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248793267] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 01:12:33,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 01:12:33,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 01:12:33,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286483571] [2023-08-27 01:12:33,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 01:12:33,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 01:12:33,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:33,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 01:12:33,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 01:12:33,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 390 [2023-08-27 01:12:33,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 92 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:33,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:33,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 390 [2023-08-27 01:12:33,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:34,131 INFO L124 PetriNetUnfolderBase]: 1176/2173 cut-off events. [2023-08-27 01:12:34,131 INFO L125 PetriNetUnfolderBase]: For 3908/3962 co-relation queries the response was YES. [2023-08-27 01:12:34,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8427 conditions, 2173 events. 1176/2173 cut-off events. For 3908/3962 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12351 event pairs, 411 based on Foata normal form. 16/1992 useless extension candidates. Maximal degree in co-relation 8407. Up to 1032 conditions per place. [2023-08-27 01:12:34,145 INFO L140 encePairwiseOnDemand]: 387/390 looper letters, 112 selfloop transitions, 4 changer transitions 4/125 dead transitions. [2023-08-27 01:12:34,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 125 transitions, 1119 flow [2023-08-27 01:12:34,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 01:12:34,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 01:12:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2023-08-27 01:12:34,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45726495726495725 [2023-08-27 01:12:34,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2023-08-27 01:12:34,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2023-08-27 01:12:34,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:34,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2023-08-27 01:12:34,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:34,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:34,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:34,151 INFO L175 Difference]: Start difference. First operand has 65 places, 92 transitions, 601 flow. Second operand 3 states and 535 transitions. [2023-08-27 01:12:34,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 125 transitions, 1119 flow [2023-08-27 01:12:34,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 125 transitions, 1119 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 01:12:34,169 INFO L231 Difference]: Finished difference. Result has 68 places, 93 transitions, 628 flow [2023-08-27 01:12:34,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=68, PETRI_TRANSITIONS=93} [2023-08-27 01:12:34,169 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 33 predicate places. [2023-08-27 01:12:34,169 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 93 transitions, 628 flow [2023-08-27 01:12:34,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:34,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:34,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:12:34,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 01:12:34,170 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:34,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:34,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2142741434, now seen corresponding path program 1 times [2023-08-27 01:12:34,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:34,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610882702] [2023-08-27 01:12:34,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:34,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 01:12:34,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:34,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610882702] [2023-08-27 01:12:34,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610882702] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 01:12:34,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 01:12:34,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 01:12:34,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533172423] [2023-08-27 01:12:34,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 01:12:34,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 01:12:34,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:34,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 01:12:34,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 01:12:34,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 390 [2023-08-27 01:12:34,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 93 transitions, 628 flow. Second operand has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:34,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:34,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 390 [2023-08-27 01:12:34,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:34,636 INFO L124 PetriNetUnfolderBase]: 1212/2159 cut-off events. [2023-08-27 01:12:34,636 INFO L125 PetriNetUnfolderBase]: For 4153/4153 co-relation queries the response was YES. [2023-08-27 01:12:34,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8599 conditions, 2159 events. 1212/2159 cut-off events. For 4153/4153 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 11531 event pairs, 234 based on Foata normal form. 124/2149 useless extension candidates. Maximal degree in co-relation 8576. Up to 1565 conditions per place. [2023-08-27 01:12:34,649 INFO L140 encePairwiseOnDemand]: 385/390 looper letters, 113 selfloop transitions, 2 changer transitions 19/134 dead transitions. [2023-08-27 01:12:34,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 134 transitions, 1183 flow [2023-08-27 01:12:34,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 01:12:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 01:12:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 819 transitions. [2023-08-27 01:12:34,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42 [2023-08-27 01:12:34,652 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 819 transitions. [2023-08-27 01:12:34,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 819 transitions. [2023-08-27 01:12:34,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:12:34,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 819 transitions. [2023-08-27 01:12:34,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:34,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 390.0) internal successors, (2340), 6 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:34,656 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 390.0) internal successors, (2340), 6 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:34,656 INFO L175 Difference]: Start difference. First operand has 68 places, 93 transitions, 628 flow. Second operand 5 states and 819 transitions. [2023-08-27 01:12:34,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 134 transitions, 1183 flow [2023-08-27 01:12:34,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 134 transitions, 1177 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-27 01:12:34,666 INFO L231 Difference]: Finished difference. Result has 71 places, 94 transitions, 652 flow [2023-08-27 01:12:34,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=652, PETRI_PLACES=71, PETRI_TRANSITIONS=94} [2023-08-27 01:12:34,667 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 36 predicate places. [2023-08-27 01:12:34,667 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 94 transitions, 652 flow [2023-08-27 01:12:34,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:34,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:12:34,667 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 01:12:34,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 01:12:34,668 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:12:34,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:12:34,668 INFO L85 PathProgramCache]: Analyzing trace with hash -510008486, now seen corresponding path program 1 times [2023-08-27 01:12:34,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:12:34,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989689281] [2023-08-27 01:12:34,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:34,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:12:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 01:12:35,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:12:35,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989689281] [2023-08-27 01:12:35,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989689281] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:12:35,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029549147] [2023-08-27 01:12:35,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:12:35,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:12:35,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:12:35,433 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:12:35,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-27 01:12:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:12:35,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 60 conjunts are in the unsatisfiable core [2023-08-27 01:12:35,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:12:35,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 01:12:35,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 01:12:35,608 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 01:12:35,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-27 01:12:35,662 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-27 01:12:35,719 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 01:12:35,719 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 01:12:35,767 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-27 01:12:35,812 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-27 01:12:35,863 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-27 01:12:36,195 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-08-27 01:12:36,196 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 10 [2023-08-27 01:12:36,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:36,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 01:12:39,316 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:12:39,316 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2023-08-27 01:12:39,376 INFO L322 Elim1Store]: treesize reduction 9, result has 80.9 percent of original size [2023-08-27 01:12:39,377 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 13804 treesize of output 12817 [2023-08-27 01:12:39,687 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 01:12:39,704 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:12:39,705 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 3180 treesize of output 2828 [2023-08-27 01:12:39,777 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 01:12:39,793 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:12:39,793 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 2796 treesize of output 2636 [2023-08-27 01:12:39,861 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 01:12:39,877 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:12:39,878 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 2604 treesize of output 1868 [2023-08-27 01:12:43,464 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:12:43,465 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2023-08-27 01:12:43,486 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:12:43,487 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54262 treesize of output 50186 [2023-08-27 01:12:43,576 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:12:43,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1558 treesize of output 1479 [2023-08-27 01:12:43,609 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:12:43,610 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1462 treesize of output 1095 [2023-08-27 01:12:43,644 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:12:43,644 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1078 treesize of output 903 [2023-08-27 01:12:44,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:12:44,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029549147] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 01:12:44,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 01:12:44,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2023-08-27 01:12:44,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594272480] [2023-08-27 01:12:44,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 01:12:44,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-27 01:12:44,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:12:44,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-27 01:12:44,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=607, Unknown=12, NotChecked=0, Total=812 [2023-08-27 01:12:44,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 390 [2023-08-27 01:12:44,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 94 transitions, 652 flow. Second operand has 29 states, 29 states have (on average 90.27586206896552) internal successors, (2618), 29 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:12:44,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:12:44,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 390 [2023-08-27 01:12:44,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:12:57,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 01:13:01,503 INFO L124 PetriNetUnfolderBase]: 4713/8173 cut-off events. [2023-08-27 01:13:01,503 INFO L125 PetriNetUnfolderBase]: For 24332/24332 co-relation queries the response was YES. [2023-08-27 01:13:01,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35812 conditions, 8173 events. 4713/8173 cut-off events. For 24332/24332 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 55423 event pairs, 341 based on Foata normal form. 109/7792 useless extension candidates. Maximal degree in co-relation 35786. Up to 2278 conditions per place. [2023-08-27 01:13:01,568 INFO L140 encePairwiseOnDemand]: 373/390 looper letters, 383 selfloop transitions, 149 changer transitions 111/643 dead transitions. [2023-08-27 01:13:01,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 643 transitions, 6286 flow [2023-08-27 01:13:01,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-08-27 01:13:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-08-27 01:13:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 4368 transitions. [2023-08-27 01:13:01,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24347826086956523 [2023-08-27 01:13:01,582 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 4368 transitions. [2023-08-27 01:13:01,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 4368 transitions. [2023-08-27 01:13:01,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:13:01,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 4368 transitions. [2023-08-27 01:13:01,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 94.95652173913044) internal successors, (4368), 46 states have internal predecessors, (4368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:13:01,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 390.0) internal successors, (18330), 47 states have internal predecessors, (18330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:13:01,618 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 390.0) internal successors, (18330), 47 states have internal predecessors, (18330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:13:01,618 INFO L175 Difference]: Start difference. First operand has 71 places, 94 transitions, 652 flow. Second operand 46 states and 4368 transitions. [2023-08-27 01:13:01,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 643 transitions, 6286 flow [2023-08-27 01:13:01,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 643 transitions, 6180 flow, removed 46 selfloop flow, removed 3 redundant places. [2023-08-27 01:13:01,743 INFO L231 Difference]: Finished difference. Result has 137 places, 242 transitions, 2438 flow [2023-08-27 01:13:01,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=2438, PETRI_PLACES=137, PETRI_TRANSITIONS=242} [2023-08-27 01:13:01,743 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 102 predicate places. [2023-08-27 01:13:01,743 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 242 transitions, 2438 flow [2023-08-27 01:13:01,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 90.27586206896552) internal successors, (2618), 29 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:13:01,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:13:01,744 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 01:13:01,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-27 01:13:01,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-27 01:13:01,953 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:13:01,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:13:01,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1802589796, now seen corresponding path program 2 times [2023-08-27 01:13:01,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:13:01,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858040865] [2023-08-27 01:13:01,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:13:01,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:13:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:13:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 01:13:02,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:13:02,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858040865] [2023-08-27 01:13:02,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858040865] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:13:02,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166333439] [2023-08-27 01:13:02,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 01:13:02,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:13:02,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:13:02,799 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:13:02,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-27 01:13:02,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 01:13:02,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 01:13:02,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-27 01:13:02,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:13:02,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 01:13:02,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 01:13:02,946 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 01:13:02,946 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-27 01:13:03,016 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-27 01:13:03,074 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 01:13:03,074 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 01:13:03,116 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-27 01:13:03,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 01:13:03,140 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 01:13:03,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 01:13:03,226 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 01:13:03,472 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2023-08-27 01:13:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 01:13:03,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 01:13:04,311 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:13:04,312 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2023-08-27 01:13:04,319 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1670 treesize of output 1606 [2023-08-27 01:13:04,346 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:13:04,347 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 798 treesize of output 623 [2023-08-27 01:13:04,370 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:13:04,370 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 606 treesize of output 551 [2023-08-27 01:13:04,395 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:13:04,396 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 534 treesize of output 455 [2023-08-27 01:13:04,935 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:13:04,936 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 75 [2023-08-27 01:13:04,961 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:13:04,962 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29836 treesize of output 28692 [2023-08-27 01:13:05,025 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:13:05,025 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 885 treesize of output 709 [2023-08-27 01:13:05,076 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:13:05,077 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 750 treesize of output 728 [2023-08-27 01:13:05,127 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:13:05,128 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 602 treesize of output 534 [2023-08-27 01:13:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:13:09,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166333439] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 01:13:09,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 01:13:09,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 24 [2023-08-27 01:13:09,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417780355] [2023-08-27 01:13:09,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 01:13:09,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-27 01:13:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:13:09,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-27 01:13:09,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=529, Unknown=11, NotChecked=0, Total=650 [2023-08-27 01:13:09,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 390 [2023-08-27 01:13:09,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 242 transitions, 2438 flow. Second operand has 26 states, 26 states have (on average 93.38461538461539) internal successors, (2428), 26 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:13:09,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:13:09,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 390 [2023-08-27 01:13:09,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:13:09,684 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (<= c_~n~0 c_~end~0)) (.cse3 (< c_~end~0 0)) (.cse0 (not (= (mod c_~ok~0 256) 0))) (.cse5 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse6 (* c_~i~0 4)) (.cse8 (+ (* c_~start~0 4) c_~queue~0.offset))) (and (or (let ((.cse1 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118|) 0)))))) (and (or .cse0 .cse1) (or .cse1 (= c_~start~0 c_~end~0)) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (= c_~i~0 0) .cse1))) .cse2 .cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (= c_~ok~0 1) (or .cse2 (and (or (forall ((v_~A~0.offset_87 Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (not (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542))) (= (select (select .cse4 c_~queue~0.base) .cse5) (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse6 v_~A~0.offset_87)))))) .cse0) (forall ((v_~A~0.offset_87 Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542))) (let ((.cse7 (select .cse9 c_~queue~0.base))) (or (< (select .cse7 .cse8) (+ (select v_ArrVal_540 v_~A~0.offset_87) 1)) (not (= (select .cse7 .cse5) (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse6 v_~A~0.offset_87))))))))) .cse3) (or .cse2 .cse3 (and (or .cse0 (forall ((v_~A~0.offset_87 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (not (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542))) (= (select (select .cse10 c_~queue~0.base) .cse5) (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse6 v_~A~0.offset_87))))))) (forall ((v_~A~0.offset_87 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542))) (let ((.cse11 (select .cse12 c_~queue~0.base))) (or (not (= (select .cse11 .cse5) (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse6 v_~A~0.offset_87)))) (< (select .cse11 .cse8) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) v_~A~0.offset_87) 1)))))))))) is different from false [2023-08-27 01:14:03,822 WARN L234 SmtUtils]: Spent 53.20s on a formula simplification. DAG size of input: 147 DAG size of output: 131 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:15:05,509 WARN L234 SmtUtils]: Spent 1.02m on a formula simplification. DAG size of input: 138 DAG size of output: 122 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:15:06,919 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse13 (* c_~i~0 4))) (let ((.cse3 (+ c_~A~0.offset .cse13)) (.cse6 (+ c_~v_old~0 1)) (.cse8 (<= c_~n~0 c_~end~0)) (.cse9 (< c_~end~0 0)) (.cse0 (not (= (mod c_~ok~0 256) 0))) (.cse2 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse5 (+ (* c_~start~0 4) c_~queue~0.offset))) (and (or (and (or .cse0 (forall ((v_ArrVal_542 (Array Int Int))) (not (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542))) (= (select (select .cse1 c_~queue~0.base) .cse2) (select (select .cse1 c_~A~0.base) .cse3)))))) (forall ((v_ArrVal_542 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542))) (let ((.cse4 (select .cse7 c_~queue~0.base))) (or (< (select .cse4 .cse5) .cse6) (not (= (select .cse4 .cse2) (select (select .cse7 c_~A~0.base) .cse3)))))))) .cse8 .cse9) (let ((.cse10 (select |c_#memory_int| c_~queue~0.base))) (or .cse8 (not (= (select .cse10 .cse2) (select (select |c_#memory_int| c_~A~0.base) .cse3))) (and (< (select .cse10 .cse5) .cse6) .cse0) .cse9)) (or (let ((.cse11 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118|) 0)))))) (and (or .cse0 .cse11) (or .cse11 (= c_~start~0 c_~end~0)) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (= c_~i~0 0) .cse11))) .cse8 .cse9 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (= c_~ok~0 1) (or .cse8 (and (or (forall ((v_~A~0.offset_87 Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (not (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542))) (= (select (select .cse12 c_~queue~0.base) .cse2) (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 v_~A~0.offset_87)))))) .cse0) (forall ((v_~A~0.offset_87 Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542))) (let ((.cse14 (select .cse15 c_~queue~0.base))) (or (< (select .cse14 .cse5) (+ (select v_ArrVal_540 v_~A~0.offset_87) 1)) (not (= (select .cse14 .cse2) (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 v_~A~0.offset_87))))))))) .cse9) (or .cse8 .cse9 (and (or .cse0 (forall ((v_~A~0.offset_87 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (not (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542))) (= (select (select .cse16 c_~queue~0.base) .cse2) (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 v_~A~0.offset_87))))))) (forall ((v_~A~0.offset_87 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542))) (let ((.cse17 (select .cse18 c_~queue~0.base))) (or (not (= (select .cse17 .cse2) (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 v_~A~0.offset_87)))) (< (select .cse17 .cse5) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) v_~A~0.offset_87) 1))))))))))) is different from false [2023-08-27 01:15:07,065 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse13 (* c_~i~0 4))) (let ((.cse3 (+ c_~A~0.offset .cse13)) (.cse6 (+ c_~v_old~0 1)) (.cse8 (<= c_~n~0 c_~end~0)) (.cse9 (< c_~end~0 0)) (.cse0 (not (= (mod c_~ok~0 256) 0))) (.cse2 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse5 (+ (* c_~start~0 4) c_~queue~0.offset))) (and (or (and (or .cse0 (forall ((v_ArrVal_542 (Array Int Int))) (not (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542))) (= (select (select .cse1 c_~queue~0.base) .cse2) (select (select .cse1 c_~A~0.base) .cse3)))))) (forall ((v_ArrVal_542 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542))) (let ((.cse4 (select .cse7 c_~queue~0.base))) (or (< (select .cse4 .cse5) .cse6) (not (= (select .cse4 .cse2) (select (select .cse7 c_~A~0.base) .cse3)))))))) .cse8 .cse9) (let ((.cse10 (select |c_#memory_int| c_~queue~0.base))) (or .cse8 (not (= (select .cse10 .cse2) (select (select |c_#memory_int| c_~A~0.base) .cse3))) (and (< (select .cse10 .cse5) .cse6) .cse0) .cse9)) (or (let ((.cse11 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118|) 0)))))) (and (or .cse0 .cse11) (or .cse11 (= c_~start~0 c_~end~0)) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (= c_~i~0 0) .cse11))) .cse8 .cse9 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or .cse8 (and (or (forall ((v_~A~0.offset_87 Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (not (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542))) (= (select (select .cse12 c_~queue~0.base) .cse2) (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 v_~A~0.offset_87)))))) .cse0) (forall ((v_~A~0.offset_87 Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542))) (let ((.cse14 (select .cse15 c_~queue~0.base))) (or (< (select .cse14 .cse5) (+ (select v_ArrVal_540 v_~A~0.offset_87) 1)) (not (= (select .cse14 .cse2) (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 v_~A~0.offset_87))))))))) .cse9) (or .cse8 .cse9 (and (or .cse0 (forall ((v_~A~0.offset_87 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (not (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542))) (= (select (select .cse16 c_~queue~0.base) .cse2) (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 v_~A~0.offset_87))))))) (forall ((v_~A~0.offset_87 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542))) (let ((.cse17 (select .cse18 c_~queue~0.base))) (or (not (= (select .cse17 .cse2) (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 v_~A~0.offset_87)))) (< (select .cse17 .cse5) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) v_~A~0.offset_87) 1))))))))))) is different from false [2023-08-27 01:15:11,664 INFO L124 PetriNetUnfolderBase]: 6075/10600 cut-off events. [2023-08-27 01:15:11,664 INFO L125 PetriNetUnfolderBase]: For 87470/87470 co-relation queries the response was YES. [2023-08-27 01:15:11,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64763 conditions, 10600 events. 6075/10600 cut-off events. For 87470/87470 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 75779 event pairs, 768 based on Foata normal form. 87/10687 useless extension candidates. Maximal degree in co-relation 64712. Up to 4137 conditions per place. [2023-08-27 01:15:11,756 INFO L140 encePairwiseOnDemand]: 370/390 looper letters, 426 selfloop transitions, 213 changer transitions 40/679 dead transitions. [2023-08-27 01:15:11,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 679 transitions, 8809 flow [2023-08-27 01:15:11,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-27 01:15:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-27 01:15:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2952 transitions. [2023-08-27 01:15:11,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2523076923076923 [2023-08-27 01:15:11,762 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2952 transitions. [2023-08-27 01:15:11,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2952 transitions. [2023-08-27 01:15:11,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:15:11,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2952 transitions. [2023-08-27 01:15:11,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 98.4) internal successors, (2952), 30 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:15:11,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 390.0) internal successors, (12090), 31 states have internal predecessors, (12090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:15:11,781 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 390.0) internal successors, (12090), 31 states have internal predecessors, (12090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:15:11,781 INFO L175 Difference]: Start difference. First operand has 137 places, 242 transitions, 2438 flow. Second operand 30 states and 2952 transitions. [2023-08-27 01:15:11,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 679 transitions, 8809 flow [2023-08-27 01:15:12,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 679 transitions, 7832 flow, removed 478 selfloop flow, removed 6 redundant places. [2023-08-27 01:15:12,247 INFO L231 Difference]: Finished difference. Result has 163 places, 366 transitions, 4274 flow [2023-08-27 01:15:12,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=1834, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=4274, PETRI_PLACES=163, PETRI_TRANSITIONS=366} [2023-08-27 01:15:12,247 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 128 predicate places. [2023-08-27 01:15:12,247 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 366 transitions, 4274 flow [2023-08-27 01:15:12,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 93.38461538461539) internal successors, (2428), 26 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:15:12,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:15:12,248 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 01:15:12,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-27 01:15:12,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:15:12,449 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:15:12,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:15:12,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1423777316, now seen corresponding path program 3 times [2023-08-27 01:15:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:15:12,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935284203] [2023-08-27 01:15:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:15:12,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:15:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:15:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 01:15:14,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:15:14,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935284203] [2023-08-27 01:15:14,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935284203] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:15:14,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608999080] [2023-08-27 01:15:14,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 01:15:14,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:15:14,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:15:14,654 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:15:14,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-27 01:15:14,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 01:15:14,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 01:15:14,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-27 01:15:14,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:15:14,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 01:15:14,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 01:15:14,931 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 01:15:14,931 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-27 01:15:15,136 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-27 01:15:15,343 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 01:15:15,344 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 01:15:15,519 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-27 01:15:15,686 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-27 01:15:16,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 01:15:16,703 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-27 01:15:16,703 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2023-08-27 01:15:16,728 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-08-27 01:15:17,200 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-08-27 01:15:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:15:17,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 01:15:20,082 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:15:20,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2023-08-27 01:15:20,215 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:15:20,215 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7948 treesize of output 7098 [2023-08-27 01:15:20,370 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:15:20,370 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1140 treesize of output 940 [2023-08-27 01:15:20,516 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:15:20,516 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 900 treesize of output 820 [2023-08-27 01:15:20,546 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 566 treesize of output 470 [2023-08-27 01:15:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:15:31,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608999080] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 01:15:31,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 01:15:31,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-08-27 01:15:31,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176560316] [2023-08-27 01:15:31,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 01:15:31,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-27 01:15:31,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:15:31,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-27 01:15:31,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=707, Unknown=12, NotChecked=0, Total=870 [2023-08-27 01:15:31,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 390 [2023-08-27 01:15:31,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 366 transitions, 4274 flow. Second operand has 30 states, 30 states have (on average 90.2) internal successors, (2706), 30 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:15:31,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:15:31,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 390 [2023-08-27 01:15:31,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:15:31,173 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse0 (= c_~end~0 0)) (.cse10 (= c_~ok~0 1)) (.cse11 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse2 (<= c_~n~0 c_~end~0)) (.cse3 (< c_~end~0 0)) (.cse8 (not (= (mod c_~ok~0 256) 0))) (.cse7 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse5 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (or .cse0 (and (= 0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (or .cse1 (<= c_~end~0 0)))) .cse1 (or .cse2 .cse3 (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_587 (Array Int Int)) (~A~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_587))) (let ((.cse6 (select (select .cse4 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= (select (select .cse4 c_~queue~0.base) .cse5) .cse6)) (forall ((v_ArrVal_588 (Array Int Int))) (< (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_588) c_~queue~0.base) .cse7) (+ .cse6 1))))))) (or .cse8 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_587 (Array Int Int)) (~A~0.base Int)) (not (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_587))) (= (select (select .cse9 c_~queue~0.base) .cse5) (select (select .cse9 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))))) (or (not .cse0) (and (= c_~start~0 0) .cse10 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= .cse11 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) .cse10 (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or .cse2 .cse3 (and .cse8 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int)) (~A~0.base Int)) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_587))) (let ((.cse13 (select (select .cse12 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_588 (Array Int Int))) (< (select (select (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_588) c_~queue~0.base) .cse7) (+ .cse13 1))) (not (= (select (select .cse12 c_~queue~0.base) .cse5) .cse13)))))))) (= c_~start~0 c_~end~0) (<= .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse2 .cse3 (and .cse8 (forall ((v_ArrVal_588 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_588) c_~queue~0.base) .cse7) (+ c_~v_old~0 1)))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse14 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) .cse5) .cse14)) (< c_~last~0 .cse14))))))) is different from false [2023-08-27 01:15:49,517 INFO L124 PetriNetUnfolderBase]: 8716/15176 cut-off events. [2023-08-27 01:15:49,517 INFO L125 PetriNetUnfolderBase]: For 135847/135847 co-relation queries the response was YES. [2023-08-27 01:15:49,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105411 conditions, 15176 events. 8716/15176 cut-off events. For 135847/135847 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 115569 event pairs, 609 based on Foata normal form. 69/14994 useless extension candidates. Maximal degree in co-relation 105351. Up to 7581 conditions per place. [2023-08-27 01:15:49,642 INFO L140 encePairwiseOnDemand]: 375/390 looper letters, 565 selfloop transitions, 307 changer transitions 104/976 dead transitions. [2023-08-27 01:15:49,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 976 transitions, 14251 flow [2023-08-27 01:15:49,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-27 01:15:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-27 01:15:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3258 transitions. [2023-08-27 01:15:49,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24570135746606334 [2023-08-27 01:15:49,648 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 3258 transitions. [2023-08-27 01:15:49,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 3258 transitions. [2023-08-27 01:15:49,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:15:49,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 3258 transitions. [2023-08-27 01:15:49,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 95.82352941176471) internal successors, (3258), 34 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:15:49,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 390.0) internal successors, (13650), 35 states have internal predecessors, (13650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:15:49,663 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 390.0) internal successors, (13650), 35 states have internal predecessors, (13650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:15:49,663 INFO L175 Difference]: Start difference. First operand has 163 places, 366 transitions, 4274 flow. Second operand 34 states and 3258 transitions. [2023-08-27 01:15:49,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 976 transitions, 14251 flow [2023-08-27 01:15:50,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 976 transitions, 13884 flow, removed 168 selfloop flow, removed 8 redundant places. [2023-08-27 01:15:50,415 INFO L231 Difference]: Finished difference. Result has 200 places, 519 transitions, 7293 flow [2023-08-27 01:15:50,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=3941, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=7293, PETRI_PLACES=200, PETRI_TRANSITIONS=519} [2023-08-27 01:15:50,416 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 165 predicate places. [2023-08-27 01:15:50,416 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 519 transitions, 7293 flow [2023-08-27 01:15:50,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 90.2) internal successors, (2706), 30 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:15:50,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:15:50,417 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 01:15:50,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-27 01:15:50,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:15:50,617 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:15:50,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:15:50,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1387294290, now seen corresponding path program 4 times [2023-08-27 01:15:50,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:15:50,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567160043] [2023-08-27 01:15:50,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:15:50,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:15:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:15:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:15:53,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:15:53,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567160043] [2023-08-27 01:15:53,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567160043] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:15:53,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149920210] [2023-08-27 01:15:53,634 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 01:15:53,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:15:53,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:15:53,635 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:15:53,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-27 01:15:53,748 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 01:15:53,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 01:15:53,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-27 01:15:53,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:15:53,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 01:15:53,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 01:15:53,879 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 01:15:53,880 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-27 01:15:54,133 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-27 01:15:54,383 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 01:15:54,383 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 01:15:54,650 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-27 01:15:54,716 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-27 01:15:55,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 01:15:55,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-27 01:15:56,372 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-08-27 01:15:56,372 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 10 [2023-08-27 01:15:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 01:15:56,532 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 01:16:00,949 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:16:00,950 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2023-08-27 01:16:01,023 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:16:01,024 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27126 treesize of output 25098 [2023-08-27 01:16:01,197 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:16:01,198 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1558 treesize of output 1383 [2023-08-27 01:16:01,293 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:16:01,294 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1366 treesize of output 1287 [2023-08-27 01:16:01,387 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:16:01,387 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1270 treesize of output 903 [2023-08-27 01:16:04,927 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:16:04,927 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 87 [2023-08-27 01:16:05,122 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:16:05,123 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20652 treesize of output 18906 [2023-08-27 01:16:05,340 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:16:05,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2340 treesize of output 2212 [2023-08-27 01:16:05,496 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:16:05,497 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1841 treesize of output 1401 [2023-08-27 01:16:05,654 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:16:05,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1692 treesize of output 1396 [2023-08-27 01:16:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:16:30,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149920210] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 01:16:30,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 01:16:30,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 28 [2023-08-27 01:16:30,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381828596] [2023-08-27 01:16:30,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 01:16:30,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-27 01:16:30,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:16:30,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-27 01:16:30,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=727, Unknown=10, NotChecked=0, Total=870 [2023-08-27 01:16:30,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 390 [2023-08-27 01:16:30,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 519 transitions, 7293 flow. Second operand has 30 states, 30 states have (on average 89.2) internal successors, (2676), 30 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:16:30,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:16:30,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 390 [2023-08-27 01:16:30,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:16:41,637 WARN L234 SmtUtils]: Spent 9.47s on a formula simplification. DAG size of input: 104 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:16:50,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 01:17:03,504 WARN L234 SmtUtils]: Spent 12.45s on a formula simplification. DAG size of input: 70 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:17:05,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 01:17:07,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 01:17:09,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 01:17:20,239 WARN L234 SmtUtils]: Spent 7.93s on a formula simplification. DAG size of input: 156 DAG size of output: 131 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:17:22,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 01:17:24,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 01:17:26,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 01:17:39,151 WARN L234 SmtUtils]: Spent 11.26s on a formula simplification. DAG size of input: 164 DAG size of output: 142 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:17:42,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 01:17:57,509 WARN L234 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 129 DAG size of output: 112 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:18:06,569 WARN L234 SmtUtils]: Spent 8.46s on a formula simplification. DAG size of input: 160 DAG size of output: 137 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:18:12,720 WARN L234 SmtUtils]: Spent 5.63s on a formula simplification. DAG size of input: 153 DAG size of output: 131 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:18:20,190 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~v_old~0 1)) (.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (< c_~end~0 0)) (.cse9 (not (= (mod c_~ok~0 256) 0))) (.cse6 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse3 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (or .cse0 .cse1 (let ((.cse5 (+ c_~A~0.offset (* c_~i~0 4)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (let ((.cse2 (select .cse4 c_~queue~0.base))) (or (not (= (select .cse2 .cse3) (select (select .cse4 c_~A~0.base) .cse5))) (< (select .cse2 .cse6) .cse7))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (= (select (select .cse8 c_~queue~0.base) .cse3) (select (select .cse8 c_~A~0.base) .cse5))))) .cse9))) (< c_~last~0 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (and (<= (+ c_~end~0 1) c_~start~0) (<= c_~N~0 c_~i~0))) (or .cse0 .cse1 (let ((.cse10 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122|) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122|))))) (and (or .cse10 .cse9) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122| |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122|) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122|))) (or .cse10 (= c_~start~0 c_~end~0)))) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or .cse0 .cse1 (and (or .cse9 (forall ((v_ArrVal_634 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_633 (Array Int Int)) (v_~A~0.base_89 Int) (~i~0 Int) (v_ArrVal_632 (Array Int Int))) (or (not (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_633) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (= (select (select .cse11 c_~queue~0.base) .cse3) (select (select .cse11 v_~A~0.base_89) (+ (* ~i~0 4) ~A~0.offset))))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_89)))) (forall ((v_~A~0.base_89 Int) (v_ArrVal_632 (Array Int Int))) (or (forall ((v_ArrVal_634 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_633 (Array Int Int)) (~i~0 Int)) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_633))) (let ((.cse13 (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (let ((.cse12 (select .cse13 c_~queue~0.base)) (.cse14 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse12 .cse3) (select (select .cse13 v_~A~0.base_89) .cse14))) (< (select .cse12 .cse6) (+ (select (select .cse15 v_~A~0.base_89) .cse14) 1))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_89))))) (= c_~ok~0 1) (or (let ((.cse18 (select |c_#memory_int| c_~A~0.base))) (and (or (forall ((~A~0.offset Int) (v_ArrVal_634 (Array Int Int)) (~i~0 Int)) (let ((.cse17 (+ (* ~i~0 4) ~A~0.offset))) (or (not (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (= (select (select .cse16 c_~queue~0.base) .cse3) (select (select .cse16 c_~A~0.base) .cse17)))) (< c_~last~0 (select .cse18 .cse17)) (<= c_~N~0 ~i~0)))) .cse9) (forall ((~i~0 Int)) (or (forall ((~A~0.offset Int)) (let ((.cse19 (+ (* ~i~0 4) ~A~0.offset))) (or (< c_~last~0 (select .cse18 .cse19)) (forall ((v_ArrVal_634 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (let ((.cse20 (select .cse21 c_~queue~0.base))) (or (not (= (select .cse20 .cse3) (select (select .cse21 c_~A~0.base) .cse19))) (< (select .cse20 .cse6) .cse7)))))))) (<= c_~N~0 ~i~0))))) .cse0 .cse1) (or .cse0 .cse1 (and (or .cse9 (forall ((v_ArrVal_634 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_633 (Array Int Int)) (v_~A~0.base_89 Int) (~i~0 Int)) (or (not (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_633) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (= (select (select .cse22 v_~A~0.base_89) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse22 c_~queue~0.base) .cse3)))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_89)))) (forall ((v_~A~0.base_89 Int)) (or (forall ((v_ArrVal_634 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_633 (Array Int Int)) (~i~0 Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_633))) (let ((.cse26 (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (let ((.cse25 (+ (* ~i~0 4) ~A~0.offset)) (.cse23 (select .cse26 c_~queue~0.base))) (or (< (select .cse23 .cse6) (+ (select (select .cse24 v_~A~0.base_89) .cse25) 1)) (not (= (select (select .cse26 v_~A~0.base_89) .cse25) (select .cse23 .cse3)))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_89))))))) is different from false [2023-08-27 01:18:27,563 WARN L234 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 140 DAG size of output: 123 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:18:33,581 WARN L234 SmtUtils]: Spent 5.20s on a formula simplification. DAG size of input: 153 DAG size of output: 131 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:18:54,469 WARN L234 SmtUtils]: Spent 9.86s on a formula simplification. DAG size of input: 149 DAG size of output: 131 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:19:10,246 WARN L234 SmtUtils]: Spent 7.06s on a formula simplification. DAG size of input: 164 DAG size of output: 139 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:19:18,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 01:19:30,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 01:19:38,483 WARN L234 SmtUtils]: Spent 7.09s on a formula simplification. DAG size of input: 161 DAG size of output: 143 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:19:47,994 WARN L234 SmtUtils]: Spent 8.15s on a formula simplification. DAG size of input: 137 DAG size of output: 120 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:19:50,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 01:20:00,170 WARN L234 SmtUtils]: Spent 9.20s on a formula simplification. DAG size of input: 139 DAG size of output: 122 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:20:00,767 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse13 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse20 (+ c_~v_old~0 1)) (.cse8 (not (= (mod c_~ok~0 256) 0)))) (let ((.cse3 (select |c_#memory_int| c_~A~0.base)) (.cse4 (and (< (select .cse1 .cse13) .cse20) .cse8)) (.cse6 (<= c_~N~0 c_~i~0)) (.cse0 (<= c_~n~0 c_~end~0)) (.cse5 (< c_~end~0 0)) (.cse2 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (or .cse0 (not (= (select .cse1 .cse2) (select .cse3 (+ c_~A~0.offset (* c_~i~0 4))))) .cse4 .cse5 (< c_~last~0 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (and (<= (+ c_~end~0 1) c_~start~0) .cse6)) (or .cse0 .cse5 (let ((.cse7 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122|) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122|))))) (and (or .cse7 .cse8) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122| |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122|) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122|))) (or .cse7 (= c_~start~0 c_~end~0)))) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or .cse0 .cse5 (and (or .cse8 (forall ((v_ArrVal_634 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_633 (Array Int Int)) (v_~A~0.base_89 Int) (~i~0 Int) (v_ArrVal_632 (Array Int Int))) (or (not (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_633) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (= (select (select .cse9 c_~queue~0.base) .cse2) (select (select .cse9 v_~A~0.base_89) (+ (* ~i~0 4) ~A~0.offset))))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_89)))) (forall ((v_~A~0.base_89 Int) (v_ArrVal_632 (Array Int Int))) (or (forall ((v_ArrVal_634 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_633 (Array Int Int)) (~i~0 Int)) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_633))) (let ((.cse11 (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (let ((.cse10 (select .cse11 c_~queue~0.base)) (.cse12 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse10 .cse2) (select (select .cse11 v_~A~0.base_89) .cse12))) (< (select .cse10 .cse13) (+ (select (select .cse14 v_~A~0.base_89) .cse12) 1))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_89))))) (= c_~ok~0 1) (or (and (or (forall ((~A~0.offset Int) (v_ArrVal_634 (Array Int Int)) (~i~0 Int)) (let ((.cse16 (+ (* ~i~0 4) ~A~0.offset))) (or (not (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (= (select (select .cse15 c_~queue~0.base) .cse2) (select (select .cse15 c_~A~0.base) .cse16)))) (< c_~last~0 (select .cse3 .cse16)) (<= c_~N~0 ~i~0)))) .cse8) (forall ((~i~0 Int)) (or (forall ((~A~0.offset Int)) (let ((.cse17 (+ (* ~i~0 4) ~A~0.offset))) (or (< c_~last~0 (select .cse3 .cse17)) (forall ((v_ArrVal_634 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (let ((.cse18 (select .cse19 c_~queue~0.base))) (or (not (= (select .cse18 .cse2) (select (select .cse19 c_~A~0.base) .cse17))) (< (select .cse18 .cse13) .cse20)))))))) (<= c_~N~0 ~i~0)))) .cse0 .cse5) (or .cse4 (and .cse6 (<= c_~end~0 c_~start~0))) (or .cse0 .cse5 (and (or .cse8 (forall ((v_ArrVal_634 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_633 (Array Int Int)) (v_~A~0.base_89 Int) (~i~0 Int)) (or (not (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_633) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (= (select (select .cse21 v_~A~0.base_89) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse21 c_~queue~0.base) .cse2)))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_89)))) (forall ((v_~A~0.base_89 Int)) (or (forall ((v_ArrVal_634 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_633 (Array Int Int)) (~i~0 Int)) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_633))) (let ((.cse25 (store .cse23 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (let ((.cse24 (+ (* ~i~0 4) ~A~0.offset)) (.cse22 (select .cse25 c_~queue~0.base))) (or (< (select .cse22 .cse13) (+ (select (select .cse23 v_~A~0.base_89) .cse24) 1)) (not (= (select (select .cse25 v_~A~0.base_89) .cse24) (select .cse22 .cse2)))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_89)))))))) is different from false [2023-08-27 01:20:00,816 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse11 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse12 (+ c_~v_old~0 1)) (.cse14 (not (= (mod c_~ok~0 256) 0))) (.cse26 (<= c_~N~0 c_~i~0))) (let ((.cse4 (+ c_~A~0.offset (* c_~i~0 4))) (.cse7 (< c_~last~0 |c_thread1Thread1of1ForFork0_#t~mem1#1|)) (.cse8 (and (<= (+ c_~end~0 1) c_~start~0) .cse26)) (.cse3 (select |c_#memory_int| c_~A~0.base)) (.cse5 (and (< (select .cse1 .cse11) .cse12) .cse14)) (.cse0 (<= c_~n~0 c_~end~0)) (.cse6 (< c_~end~0 0)) (.cse2 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (or .cse0 (not (= (select .cse1 .cse2) (select .cse3 .cse4))) .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse6 (and (forall ((v_ArrVal_634 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (let ((.cse9 (select .cse10 c_~queue~0.base))) (or (not (= (select .cse9 .cse2) (select (select .cse10 c_~A~0.base) .cse4))) (< (select .cse9 .cse11) .cse12))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (= (select (select .cse13 c_~queue~0.base) .cse2) (select (select .cse13 c_~A~0.base) .cse4))))) .cse14)) .cse7 .cse8) (or .cse0 .cse6 (let ((.cse15 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122|) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122|))))) (and (or .cse15 .cse14) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122| |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122|) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_122|))) (or .cse15 (= c_~start~0 c_~end~0)))) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or .cse0 .cse6 (and (or .cse14 (forall ((v_ArrVal_634 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_633 (Array Int Int)) (v_~A~0.base_89 Int) (~i~0 Int) (v_ArrVal_632 (Array Int Int))) (or (not (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_633) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (= (select (select .cse16 c_~queue~0.base) .cse2) (select (select .cse16 v_~A~0.base_89) (+ (* ~i~0 4) ~A~0.offset))))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_89)))) (forall ((v_~A~0.base_89 Int) (v_ArrVal_632 (Array Int Int))) (or (forall ((v_ArrVal_634 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_633 (Array Int Int)) (~i~0 Int)) (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_633))) (let ((.cse18 (store .cse20 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (let ((.cse17 (select .cse18 c_~queue~0.base)) (.cse19 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse17 .cse2) (select (select .cse18 v_~A~0.base_89) .cse19))) (< (select .cse17 .cse11) (+ (select (select .cse20 v_~A~0.base_89) .cse19) 1))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_89))))) (= c_~ok~0 1) (or (and (or (forall ((~A~0.offset Int) (v_ArrVal_634 (Array Int Int)) (~i~0 Int)) (let ((.cse22 (+ (* ~i~0 4) ~A~0.offset))) (or (not (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (= (select (select .cse21 c_~queue~0.base) .cse2) (select (select .cse21 c_~A~0.base) .cse22)))) (< c_~last~0 (select .cse3 .cse22)) (<= c_~N~0 ~i~0)))) .cse14) (forall ((~i~0 Int)) (or (forall ((~A~0.offset Int)) (let ((.cse23 (+ (* ~i~0 4) ~A~0.offset))) (or (< c_~last~0 (select .cse3 .cse23)) (forall ((v_ArrVal_634 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (let ((.cse24 (select .cse25 c_~queue~0.base))) (or (not (= (select .cse24 .cse2) (select (select .cse25 c_~A~0.base) .cse23))) (< (select .cse24 .cse11) .cse12)))))))) (<= c_~N~0 ~i~0)))) .cse0 .cse6) (or .cse5 (and .cse26 (<= c_~end~0 c_~start~0))) (or .cse0 .cse6 (and (or .cse14 (forall ((v_ArrVal_634 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_633 (Array Int Int)) (v_~A~0.base_89 Int) (~i~0 Int)) (or (not (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_633) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (= (select (select .cse27 v_~A~0.base_89) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse27 c_~queue~0.base) .cse2)))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_89)))) (forall ((v_~A~0.base_89 Int)) (or (forall ((v_ArrVal_634 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_633 (Array Int Int)) (~i~0 Int)) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_633))) (let ((.cse31 (store .cse29 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_634))) (let ((.cse30 (+ (* ~i~0 4) ~A~0.offset)) (.cse28 (select .cse31 c_~queue~0.base))) (or (< (select .cse28 .cse11) (+ (select (select .cse29 v_~A~0.base_89) .cse30) 1)) (not (= (select (select .cse31 v_~A~0.base_89) .cse30) (select .cse28 .cse2)))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_89)))))))) is different from false [2023-08-27 01:20:10,905 WARN L234 SmtUtils]: Spent 5.45s on a formula simplification. DAG size of input: 161 DAG size of output: 139 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:20:21,365 WARN L234 SmtUtils]: Spent 8.72s on a formula simplification. DAG size of input: 148 DAG size of output: 125 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:20:49,563 WARN L234 SmtUtils]: Spent 16.36s on a formula simplification. DAG size of input: 146 DAG size of output: 126 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 01:21:03,258 INFO L124 PetriNetUnfolderBase]: 14250/24838 cut-off events. [2023-08-27 01:21:03,259 INFO L125 PetriNetUnfolderBase]: For 334977/334977 co-relation queries the response was YES. [2023-08-27 01:21:03,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193050 conditions, 24838 events. 14250/24838 cut-off events. For 334977/334977 co-relation queries the response was YES. Maximal size of possible extension queue 1232. Compared 205070 event pairs, 797 based on Foata normal form. 28/24866 useless extension candidates. Maximal degree in co-relation 192976. Up to 12597 conditions per place. [2023-08-27 01:21:03,475 INFO L140 encePairwiseOnDemand]: 373/390 looper letters, 981 selfloop transitions, 687 changer transitions 99/1767 dead transitions. [2023-08-27 01:21:03,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 1767 transitions, 30281 flow [2023-08-27 01:21:03,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-08-27 01:21:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2023-08-27 01:21:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 5892 transitions. [2023-08-27 01:21:03,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2398046398046398 [2023-08-27 01:21:03,487 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 5892 transitions. [2023-08-27 01:21:03,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 5892 transitions. [2023-08-27 01:21:03,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:21:03,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 5892 transitions. [2023-08-27 01:21:03,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 93.52380952380952) internal successors, (5892), 63 states have internal predecessors, (5892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:21:03,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 390.0) internal successors, (24960), 64 states have internal predecessors, (24960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:21:03,515 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 390.0) internal successors, (24960), 64 states have internal predecessors, (24960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:21:03,515 INFO L175 Difference]: Start difference. First operand has 200 places, 519 transitions, 7293 flow. Second operand 63 states and 5892 transitions. [2023-08-27 01:21:03,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 1767 transitions, 30281 flow [2023-08-27 01:21:06,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 1767 transitions, 28802 flow, removed 630 selfloop flow, removed 16 redundant places. [2023-08-27 01:21:06,295 INFO L231 Difference]: Finished difference. Result has 278 places, 1085 transitions, 18534 flow [2023-08-27 01:21:06,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=6897, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=229, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=18534, PETRI_PLACES=278, PETRI_TRANSITIONS=1085} [2023-08-27 01:21:06,296 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 243 predicate places. [2023-08-27 01:21:06,296 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 1085 transitions, 18534 flow [2023-08-27 01:21:06,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 89.2) internal successors, (2676), 30 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:21:06,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:21:06,297 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:21:06,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-27 01:21:06,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-27 01:21:06,502 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:21:06,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:21:06,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1917883645, now seen corresponding path program 5 times [2023-08-27 01:21:06,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:21:06,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468586045] [2023-08-27 01:21:06,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:21:06,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:21:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:21:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-27 01:21:06,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:21:06,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468586045] [2023-08-27 01:21:06,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468586045] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:21:06,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245825135] [2023-08-27 01:21:06,742 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 01:21:06,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:21:06,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:21:06,783 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:21:06,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-27 01:21:06,951 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-27 01:21:06,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 01:21:06,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-27 01:21:06,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:21:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 01:21:07,219 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 01:21:07,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245825135] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 01:21:07,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 01:21:07,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-08-27 01:21:07,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601864513] [2023-08-27 01:21:07,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 01:21:07,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 01:21:07,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:21:07,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 01:21:07,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 01:21:07,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 390 [2023-08-27 01:21:07,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 1085 transitions, 18534 flow. Second operand has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:21:07,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:21:07,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 390 [2023-08-27 01:21:07,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:21:15,463 INFO L124 PetriNetUnfolderBase]: 14000/25965 cut-off events. [2023-08-27 01:21:15,463 INFO L125 PetriNetUnfolderBase]: For 571126/571126 co-relation queries the response was YES. [2023-08-27 01:21:15,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232389 conditions, 25965 events. 14000/25965 cut-off events. For 571126/571126 co-relation queries the response was YES. Maximal size of possible extension queue 1225. Compared 230148 event pairs, 2335 based on Foata normal form. 2375/28340 useless extension candidates. Maximal degree in co-relation 232283. Up to 14538 conditions per place. [2023-08-27 01:21:15,892 INFO L140 encePairwiseOnDemand]: 387/390 looper letters, 599 selfloop transitions, 271 changer transitions 130/1000 dead transitions. [2023-08-27 01:21:15,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 1000 transitions, 19228 flow [2023-08-27 01:21:15,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 01:21:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 01:21:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 717 transitions. [2023-08-27 01:21:15,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4596153846153846 [2023-08-27 01:21:15,893 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 717 transitions. [2023-08-27 01:21:15,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 717 transitions. [2023-08-27 01:21:15,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:21:15,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 717 transitions. [2023-08-27 01:21:15,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.25) internal successors, (717), 4 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:21:15,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 390.0) internal successors, (1950), 5 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:21:15,896 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 390.0) internal successors, (1950), 5 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:21:15,896 INFO L175 Difference]: Start difference. First operand has 278 places, 1085 transitions, 18534 flow. Second operand 4 states and 717 transitions. [2023-08-27 01:21:15,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 1000 transitions, 19228 flow [2023-08-27 01:21:19,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 1000 transitions, 18323 flow, removed 408 selfloop flow, removed 23 redundant places. [2023-08-27 01:21:19,158 INFO L231 Difference]: Finished difference. Result has 249 places, 767 transitions, 13840 flow [2023-08-27 01:21:19,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=12623, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=782, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=13840, PETRI_PLACES=249, PETRI_TRANSITIONS=767} [2023-08-27 01:21:19,158 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 214 predicate places. [2023-08-27 01:21:19,158 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 767 transitions, 13840 flow [2023-08-27 01:21:19,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:21:19,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:21:19,159 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:21:19,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-27 01:21:19,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:21:19,359 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:21:19,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:21:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1508071866, now seen corresponding path program 6 times [2023-08-27 01:21:19,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:21:19,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465074302] [2023-08-27 01:21:19,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:21:19,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:21:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:21:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-27 01:21:19,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:21:19,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465074302] [2023-08-27 01:21:19,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465074302] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:21:19,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769781942] [2023-08-27 01:21:19,767 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-27 01:21:19,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:21:19,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:21:19,768 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:21:19,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-27 01:21:19,873 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-27 01:21:19,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 01:21:19,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-27 01:21:19,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:21:20,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-27 01:21:20,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 01:21:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-27 01:21:20,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769781942] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 01:21:20,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 01:21:20,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-08-27 01:21:20,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909899273] [2023-08-27 01:21:20,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 01:21:20,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-27 01:21:20,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:21:20,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-27 01:21:20,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-08-27 01:21:20,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 390 [2023-08-27 01:21:20,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 767 transitions, 13840 flow. Second operand has 15 states, 15 states have (on average 139.46666666666667) internal successors, (2092), 15 states have internal predecessors, (2092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:21:20,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:21:20,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 390 [2023-08-27 01:21:20,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:21:27,888 INFO L124 PetriNetUnfolderBase]: 12082/21911 cut-off events. [2023-08-27 01:21:27,888 INFO L125 PetriNetUnfolderBase]: For 472804/472804 co-relation queries the response was YES. [2023-08-27 01:21:28,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205098 conditions, 21911 events. 12082/21911 cut-off events. For 472804/472804 co-relation queries the response was YES. Maximal size of possible extension queue 1093. Compared 186171 event pairs, 1233 based on Foata normal form. 16/21923 useless extension candidates. Maximal degree in co-relation 205011. Up to 12267 conditions per place. [2023-08-27 01:21:28,108 INFO L140 encePairwiseOnDemand]: 382/390 looper letters, 701 selfloop transitions, 246 changer transitions 3/950 dead transitions. [2023-08-27 01:21:28,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 950 transitions, 19044 flow [2023-08-27 01:21:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 01:21:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 01:21:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1431 transitions. [2023-08-27 01:21:28,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3669230769230769 [2023-08-27 01:21:28,112 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1431 transitions. [2023-08-27 01:21:28,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1431 transitions. [2023-08-27 01:21:28,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:21:28,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1431 transitions. [2023-08-27 01:21:28,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 143.1) internal successors, (1431), 10 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:21:28,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 390.0) internal successors, (4290), 11 states have internal predecessors, (4290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:21:28,117 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 390.0) internal successors, (4290), 11 states have internal predecessors, (4290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:21:28,117 INFO L175 Difference]: Start difference. First operand has 249 places, 767 transitions, 13840 flow. Second operand 10 states and 1431 transitions. [2023-08-27 01:21:28,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 950 transitions, 19044 flow [2023-08-27 01:21:30,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 950 transitions, 18550 flow, removed 247 selfloop flow, removed 6 redundant places. [2023-08-27 01:21:30,291 INFO L231 Difference]: Finished difference. Result has 240 places, 792 transitions, 14862 flow [2023-08-27 01:21:30,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=13520, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14862, PETRI_PLACES=240, PETRI_TRANSITIONS=792} [2023-08-27 01:21:30,292 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 205 predicate places. [2023-08-27 01:21:30,292 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 792 transitions, 14862 flow [2023-08-27 01:21:30,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 139.46666666666667) internal successors, (2092), 15 states have internal predecessors, (2092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:21:30,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:21:30,293 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:21:30,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-27 01:21:30,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:21:30,494 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:21:30,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:21:30,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1277753126, now seen corresponding path program 7 times [2023-08-27 01:21:30,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:21:30,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887966501] [2023-08-27 01:21:30,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:21:30,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:21:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:21:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:21:34,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:21:34,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887966501] [2023-08-27 01:21:34,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887966501] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:21:34,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363704573] [2023-08-27 01:21:34,515 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-27 01:21:34,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:21:34,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:21:34,516 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:21:34,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-27 01:21:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:21:34,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-27 01:21:34,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:21:36,660 INFO L322 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-08-27 01:21:36,661 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2023-08-27 01:21:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 01:21:36,795 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 01:21:39,962 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:21:39,962 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 121 [2023-08-27 01:21:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-27 01:21:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363704573] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 01:21:41,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 01:21:41,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 8] total 32 [2023-08-27 01:21:41,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792764581] [2023-08-27 01:21:41,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 01:21:41,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-27 01:21:41,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:21:41,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-27 01:21:41,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2023-08-27 01:21:41,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 390 [2023-08-27 01:21:41,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 792 transitions, 14862 flow. Second operand has 34 states, 34 states have (on average 91.97058823529412) internal successors, (3127), 34 states have internal predecessors, (3127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:21:41,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:21:41,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 390 [2023-08-27 01:21:41,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:21:48,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 01:22:05,866 INFO L124 PetriNetUnfolderBase]: 16364/29517 cut-off events. [2023-08-27 01:22:05,866 INFO L125 PetriNetUnfolderBase]: For 654599/654599 co-relation queries the response was YES. [2023-08-27 01:22:06,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281514 conditions, 29517 events. 16364/29517 cut-off events. For 654599/654599 co-relation queries the response was YES. Maximal size of possible extension queue 1454. Compared 261946 event pairs, 1028 based on Foata normal form. 27/29540 useless extension candidates. Maximal degree in co-relation 281432. Up to 16233 conditions per place. [2023-08-27 01:22:06,201 INFO L140 encePairwiseOnDemand]: 371/390 looper letters, 729 selfloop transitions, 511 changer transitions 110/1350 dead transitions. [2023-08-27 01:22:06,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 1350 transitions, 28703 flow [2023-08-27 01:22:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-08-27 01:22:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-08-27 01:22:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 3915 transitions. [2023-08-27 01:22:06,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2448405253283302 [2023-08-27 01:22:06,207 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 3915 transitions. [2023-08-27 01:22:06,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 3915 transitions. [2023-08-27 01:22:06,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:22:06,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 3915 transitions. [2023-08-27 01:22:06,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 95.48780487804878) internal successors, (3915), 41 states have internal predecessors, (3915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:22:06,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 390.0) internal successors, (16380), 42 states have internal predecessors, (16380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:22:06,225 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 390.0) internal successors, (16380), 42 states have internal predecessors, (16380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:22:06,225 INFO L175 Difference]: Start difference. First operand has 240 places, 792 transitions, 14862 flow. Second operand 41 states and 3915 transitions. [2023-08-27 01:22:06,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 1350 transitions, 28703 flow [2023-08-27 01:22:10,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 1350 transitions, 28391 flow, removed 13 selfloop flow, removed 7 redundant places. [2023-08-27 01:22:10,122 INFO L231 Difference]: Finished difference. Result has 293 places, 981 transitions, 20146 flow [2023-08-27 01:22:10,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=14686, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=313, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=20146, PETRI_PLACES=293, PETRI_TRANSITIONS=981} [2023-08-27 01:22:10,123 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 258 predicate places. [2023-08-27 01:22:10,123 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 981 transitions, 20146 flow [2023-08-27 01:22:10,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 91.97058823529412) internal successors, (3127), 34 states have internal predecessors, (3127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:22:10,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:22:10,124 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:22:10,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-27 01:22:10,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-27 01:22:10,329 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:22:10,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:22:10,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2146954772, now seen corresponding path program 8 times [2023-08-27 01:22:10,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:22:10,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984358354] [2023-08-27 01:22:10,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:22:10,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:22:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:22:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-27 01:22:10,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:22:10,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984358354] [2023-08-27 01:22:10,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984358354] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:22:10,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716678636] [2023-08-27 01:22:10,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 01:22:10,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:22:10,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:22:10,605 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:22:10,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-27 01:22:10,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 01:22:10,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 01:22:10,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-27 01:22:10,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:22:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-27 01:22:10,870 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 01:22:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-27 01:22:11,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716678636] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 01:22:11,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 01:22:11,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-08-27 01:22:11,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942376741] [2023-08-27 01:22:11,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 01:22:11,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 01:22:11,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:22:11,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 01:22:11,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-27 01:22:11,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 390 [2023-08-27 01:22:11,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 981 transitions, 20146 flow. Second operand has 9 states, 9 states have (on average 157.33333333333334) internal successors, (1416), 9 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:22:11,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:22:11,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 390 [2023-08-27 01:22:11,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:22:22,088 INFO L124 PetriNetUnfolderBase]: 17576/30903 cut-off events. [2023-08-27 01:22:22,088 INFO L125 PetriNetUnfolderBase]: For 918280/918280 co-relation queries the response was YES. [2023-08-27 01:22:22,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335643 conditions, 30903 events. 17576/30903 cut-off events. For 918280/918280 co-relation queries the response was YES. Maximal size of possible extension queue 1411. Compared 265248 event pairs, 1297 based on Foata normal form. 156/31055 useless extension candidates. Maximal degree in co-relation 335540. Up to 16741 conditions per place. [2023-08-27 01:22:22,496 INFO L140 encePairwiseOnDemand]: 383/390 looper letters, 756 selfloop transitions, 688 changer transitions 1/1445 dead transitions. [2023-08-27 01:22:22,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 1445 transitions, 32553 flow [2023-08-27 01:22:22,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 01:22:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 01:22:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1296 transitions. [2023-08-27 01:22:22,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4153846153846154 [2023-08-27 01:22:22,498 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1296 transitions. [2023-08-27 01:22:22,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1296 transitions. [2023-08-27 01:22:22,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:22:22,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1296 transitions. [2023-08-27 01:22:22,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:22:22,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 390.0) internal successors, (3510), 9 states have internal predecessors, (3510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:22:22,502 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 390.0) internal successors, (3510), 9 states have internal predecessors, (3510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:22:22,503 INFO L175 Difference]: Start difference. First operand has 293 places, 981 transitions, 20146 flow. Second operand 8 states and 1296 transitions. [2023-08-27 01:22:22,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 1445 transitions, 32553 flow [2023-08-27 01:22:29,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 1445 transitions, 31597 flow, removed 402 selfloop flow, removed 17 redundant places. [2023-08-27 01:22:29,339 INFO L231 Difference]: Finished difference. Result has 281 places, 1285 transitions, 29090 flow [2023-08-27 01:22:29,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=19106, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=971, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=375, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=29090, PETRI_PLACES=281, PETRI_TRANSITIONS=1285} [2023-08-27 01:22:29,340 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 246 predicate places. [2023-08-27 01:22:29,340 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 1285 transitions, 29090 flow [2023-08-27 01:22:29,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 157.33333333333334) internal successors, (1416), 9 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:22:29,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:22:29,341 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:22:29,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-08-27 01:22:29,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:22:29,541 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:22:29,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:22:29,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2015282304, now seen corresponding path program 9 times [2023-08-27 01:22:29,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:22:29,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927757306] [2023-08-27 01:22:29,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:22:29,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:22:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:22:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 01:22:34,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:22:34,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927757306] [2023-08-27 01:22:34,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927757306] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:22:34,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465221800] [2023-08-27 01:22:34,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 01:22:34,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:22:34,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:22:34,153 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:22:34,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-27 01:22:34,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 01:22:34,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 01:22:34,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-27 01:22:34,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:22:35,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 01:22:35,481 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-27 01:22:35,481 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2023-08-27 01:22:35,502 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-08-27 01:22:36,111 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-08-27 01:22:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-27 01:22:36,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 01:22:37,678 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:22:37,679 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 135 [2023-08-27 01:22:37,692 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2023-08-27 01:22:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-27 01:22:38,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465221800] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 01:22:38,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 01:22:38,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 29 [2023-08-27 01:22:38,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829499878] [2023-08-27 01:22:38,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 01:22:38,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-27 01:22:38,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:22:38,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-27 01:22:38,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=757, Unknown=2, NotChecked=0, Total=930 [2023-08-27 01:22:38,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 390 [2023-08-27 01:22:38,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 1285 transitions, 29090 flow. Second operand has 31 states, 31 states have (on average 92.2258064516129) internal successors, (2859), 31 states have internal predecessors, (2859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:22:38,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:22:38,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 390 [2023-08-27 01:22:38,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:23:03,787 INFO L124 PetriNetUnfolderBase]: 21548/37906 cut-off events. [2023-08-27 01:23:03,787 INFO L125 PetriNetUnfolderBase]: For 1152084/1152084 co-relation queries the response was YES. [2023-08-27 01:23:04,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429301 conditions, 37906 events. 21548/37906 cut-off events. For 1152084/1152084 co-relation queries the response was YES. Maximal size of possible extension queue 1752. Compared 336279 event pairs, 2054 based on Foata normal form. 18/37920 useless extension candidates. Maximal degree in co-relation 429200. Up to 20375 conditions per place. [2023-08-27 01:23:04,444 INFO L140 encePairwiseOnDemand]: 376/390 looper letters, 1188 selfloop transitions, 591 changer transitions 60/1839 dead transitions. [2023-08-27 01:23:04,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 1839 transitions, 46326 flow [2023-08-27 01:23:04,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-27 01:23:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-27 01:23:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2773 transitions. [2023-08-27 01:23:04,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2451812555260831 [2023-08-27 01:23:04,449 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2773 transitions. [2023-08-27 01:23:04,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2773 transitions. [2023-08-27 01:23:04,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:23:04,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2773 transitions. [2023-08-27 01:23:04,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 95.62068965517241) internal successors, (2773), 29 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:23:04,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 390.0) internal successors, (11700), 30 states have internal predecessors, (11700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:23:04,461 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 390.0) internal successors, (11700), 30 states have internal predecessors, (11700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:23:04,461 INFO L175 Difference]: Start difference. First operand has 281 places, 1285 transitions, 29090 flow. Second operand 29 states and 2773 transitions. [2023-08-27 01:23:04,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 1839 transitions, 46326 flow [2023-08-27 01:23:15,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 1839 transitions, 45511 flow, removed 400 selfloop flow, removed 1 redundant places. [2023-08-27 01:23:15,184 INFO L231 Difference]: Finished difference. Result has 315 places, 1399 transitions, 33027 flow [2023-08-27 01:23:15,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=28575, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=478, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=755, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=33027, PETRI_PLACES=315, PETRI_TRANSITIONS=1399} [2023-08-27 01:23:15,185 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 280 predicate places. [2023-08-27 01:23:15,185 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 1399 transitions, 33027 flow [2023-08-27 01:23:15,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 92.2258064516129) internal successors, (2859), 31 states have internal predecessors, (2859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:23:15,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:23:15,186 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:23:15,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-27 01:23:15,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:23:15,387 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:23:15,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:23:15,387 INFO L85 PathProgramCache]: Analyzing trace with hash -64279232, now seen corresponding path program 10 times [2023-08-27 01:23:15,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:23:15,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996308564] [2023-08-27 01:23:15,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:23:15,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:23:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:23:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 01:23:19,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:23:19,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996308564] [2023-08-27 01:23:19,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996308564] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:23:19,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947386073] [2023-08-27 01:23:19,199 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 01:23:19,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:23:19,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:23:19,200 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:23:19,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-27 01:23:19,318 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 01:23:19,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 01:23:19,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 44 conjunts are in the unsatisfiable core [2023-08-27 01:23:19,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:23:20,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 01:23:20,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-27 01:23:21,484 INFO L322 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-08-27 01:23:21,484 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2023-08-27 01:23:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-27 01:23:21,663 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 01:23:25,565 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:23:25,565 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 273 [2023-08-27 01:23:25,748 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:23:25,748 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 185 [2023-08-27 01:23:25,801 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:23:25,801 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 137 [2023-08-27 01:23:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-27 01:23:29,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947386073] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 01:23:29,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 01:23:29,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 8] total 32 [2023-08-27 01:23:29,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931910335] [2023-08-27 01:23:29,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 01:23:29,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-27 01:23:29,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:23:29,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-27 01:23:29,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=931, Unknown=1, NotChecked=0, Total=1122 [2023-08-27 01:23:29,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 390 [2023-08-27 01:23:29,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 1399 transitions, 33027 flow. Second operand has 34 states, 34 states have (on average 92.1470588235294) internal successors, (3133), 34 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:23:29,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:23:29,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 390 [2023-08-27 01:23:29,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:23:58,511 INFO L124 PetriNetUnfolderBase]: 23761/41784 cut-off events. [2023-08-27 01:23:58,511 INFO L125 PetriNetUnfolderBase]: For 1241676/1241676 co-relation queries the response was YES. [2023-08-27 01:23:59,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470128 conditions, 41784 events. 23761/41784 cut-off events. For 1241676/1241676 co-relation queries the response was YES. Maximal size of possible extension queue 1913. Compared 374225 event pairs, 1765 based on Foata normal form. 18/41798 useless extension candidates. Maximal degree in co-relation 470020. Up to 22571 conditions per place. [2023-08-27 01:23:59,352 INFO L140 encePairwiseOnDemand]: 377/390 looper letters, 946 selfloop transitions, 768 changer transitions 52/1766 dead transitions. [2023-08-27 01:23:59,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 1766 transitions, 45617 flow [2023-08-27 01:23:59,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-27 01:23:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-27 01:23:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2392 transitions. [2023-08-27 01:23:59,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24533333333333332 [2023-08-27 01:23:59,356 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2392 transitions. [2023-08-27 01:23:59,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2392 transitions. [2023-08-27 01:23:59,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:23:59,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2392 transitions. [2023-08-27 01:23:59,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 95.68) internal successors, (2392), 25 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:23:59,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 390.0) internal successors, (10140), 26 states have internal predecessors, (10140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:23:59,366 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 390.0) internal successors, (10140), 26 states have internal predecessors, (10140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:23:59,367 INFO L175 Difference]: Start difference. First operand has 315 places, 1399 transitions, 33027 flow. Second operand 25 states and 2392 transitions. [2023-08-27 01:23:59,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 1766 transitions, 45617 flow [2023-08-27 01:24:10,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 1766 transitions, 45282 flow, removed 92 selfloop flow, removed 14 redundant places. [2023-08-27 01:24:10,552 INFO L231 Difference]: Finished difference. Result has 330 places, 1481 transitions, 37254 flow [2023-08-27 01:24:10,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=32794, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=676, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=37254, PETRI_PLACES=330, PETRI_TRANSITIONS=1481} [2023-08-27 01:24:10,553 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 295 predicate places. [2023-08-27 01:24:10,553 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 1481 transitions, 37254 flow [2023-08-27 01:24:10,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 92.1470588235294) internal successors, (3133), 34 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:24:10,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:24:10,554 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:24:10,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-08-27 01:24:10,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:24:10,754 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:24:10,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:24:10,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1861597756, now seen corresponding path program 11 times [2023-08-27 01:24:10,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:24:10,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9625943] [2023-08-27 01:24:10,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:24:10,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:24:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:24:11,089 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-27 01:24:11,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:24:11,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9625943] [2023-08-27 01:24:11,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9625943] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:24:11,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813743237] [2023-08-27 01:24:11,090 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 01:24:11,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:24:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:24:11,091 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:24:11,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-27 01:24:11,236 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-27 01:24:11,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 01:24:11,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-27 01:24:11,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:24:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-27 01:24:11,807 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 01:24:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-27 01:24:12,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813743237] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 01:24:12,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 01:24:12,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-27 01:24:12,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522752508] [2023-08-27 01:24:12,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 01:24:12,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-27 01:24:12,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 01:24:12,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-27 01:24:12,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-08-27 01:24:12,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 390 [2023-08-27 01:24:12,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 1481 transitions, 37254 flow. Second operand has 12 states, 12 states have (on average 144.66666666666666) internal successors, (1736), 12 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:24:12,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 01:24:12,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 390 [2023-08-27 01:24:12,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 01:24:22,794 INFO L124 PetriNetUnfolderBase]: 12038/21867 cut-off events. [2023-08-27 01:24:22,794 INFO L125 PetriNetUnfolderBase]: For 796392/796392 co-relation queries the response was YES. [2023-08-27 01:24:23,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259500 conditions, 21867 events. 12038/21867 cut-off events. For 796392/796392 co-relation queries the response was YES. Maximal size of possible extension queue 1132. Compared 186018 event pairs, 4270 based on Foata normal form. 647/22510 useless extension candidates. Maximal degree in co-relation 259390. Up to 16924 conditions per place. [2023-08-27 01:24:23,197 INFO L140 encePairwiseOnDemand]: 385/390 looper letters, 503 selfloop transitions, 3 changer transitions 512/1018 dead transitions. [2023-08-27 01:24:23,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 1018 transitions, 27318 flow [2023-08-27 01:24:23,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 01:24:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 01:24:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1026 transitions. [2023-08-27 01:24:23,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3758241758241758 [2023-08-27 01:24:23,198 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1026 transitions. [2023-08-27 01:24:23,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1026 transitions. [2023-08-27 01:24:23,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 01:24:23,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1026 transitions. [2023-08-27 01:24:23,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.57142857142858) internal successors, (1026), 7 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:24:23,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 390.0) internal successors, (3120), 8 states have internal predecessors, (3120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:24:23,206 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 390.0) internal successors, (3120), 8 states have internal predecessors, (3120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:24:23,206 INFO L175 Difference]: Start difference. First operand has 330 places, 1481 transitions, 37254 flow. Second operand 7 states and 1026 transitions. [2023-08-27 01:24:23,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 1018 transitions, 27318 flow [2023-08-27 01:24:28,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 1018 transitions, 25483 flow, removed 412 selfloop flow, removed 21 redundant places. [2023-08-27 01:24:28,819 INFO L231 Difference]: Finished difference. Result has 307 places, 506 transitions, 10736 flow [2023-08-27 01:24:28,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=22151, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10736, PETRI_PLACES=307, PETRI_TRANSITIONS=506} [2023-08-27 01:24:28,820 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 272 predicate places. [2023-08-27 01:24:28,820 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 506 transitions, 10736 flow [2023-08-27 01:24:28,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 144.66666666666666) internal successors, (1736), 12 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 01:24:28,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 01:24:28,820 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:24:28,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-08-27 01:24:29,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-27 01:24:29,026 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2023-08-27 01:24:29,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 01:24:29,026 INFO L85 PathProgramCache]: Analyzing trace with hash 993032906, now seen corresponding path program 12 times [2023-08-27 01:24:29,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 01:24:29,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063712052] [2023-08-27 01:24:29,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 01:24:29,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 01:24:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 01:24:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 01:24:33,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 01:24:33,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063712052] [2023-08-27 01:24:33,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063712052] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 01:24:33,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110051689] [2023-08-27 01:24:33,347 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-27 01:24:33,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 01:24:33,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 01:24:33,348 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 01:24:33,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-27 01:24:33,512 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-27 01:24:33,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 01:24:33,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-27 01:24:33,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 01:24:34,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 01:24:34,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 01:24:35,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 01:24:35,013 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 01:24:38,087 INFO L322 Elim1Store]: treesize reduction 34, result has 55.3 percent of original size [2023-08-27 01:24:38,088 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 57 [2023-08-27 01:24:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 01:24:38,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 01:24:49,307 WARN L234 SmtUtils]: Spent 6.77s on a formula simplification. DAG size of input: 325 DAG size of output: 289 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-08-27 01:24:49,309 INFO L322 Elim1Store]: treesize reduction 144, result has 87.7 percent of original size [2023-08-27 01:24:49,309 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 9620 treesize of output 9195 [2023-08-27 01:24:50,097 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:24:50,098 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 2581 treesize of output 2470 [2023-08-27 01:24:50,494 INFO L217 Elim1Store]: Index analysis took 220 ms [2023-08-27 01:24:51,540 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:24:51,540 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 26 case distinctions, treesize of input 2345 treesize of output 2339 [2023-08-27 01:24:51,901 INFO L217 Elim1Store]: Index analysis took 141 ms [2023-08-27 01:24:52,366 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:24:52,367 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 1990 treesize of output 1917 [2023-08-27 01:24:52,825 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 01:24:52,825 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 1740 treesize of output 1591 Received shutdown request... [2023-08-27 01:26:01,013 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-27 01:26:01,014 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONASSERT (18 of 19 remaining) [2023-08-27 01:26:01,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-27 01:26:01,044 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 01:26:01,044 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 01:26:01,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-27 01:26:01,215 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 40ms.. [2023-08-27 01:26:01,229 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2023-08-27 01:26:01,229 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2023-08-27 01:26:01,230 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2023-08-27 01:26:01,230 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2023-08-27 01:26:01,230 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2023-08-27 01:26:01,230 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2023-08-27 01:26:01,230 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2023-08-27 01:26:01,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2023-08-27 01:26:01,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2023-08-27 01:26:01,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2023-08-27 01:26:01,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 19 remaining) [2023-08-27 01:26:01,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 19 remaining) [2023-08-27 01:26:01,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2023-08-27 01:26:01,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2023-08-27 01:26:01,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2023-08-27 01:26:01,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2023-08-27 01:26:01,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2023-08-27 01:26:01,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2023-08-27 01:26:01,240 INFO L445 BasicCegarLoop]: Path program histogram: [12, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 01:26:01,244 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 01:26:01,244 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 01:26:01,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 01:26:01 BasicIcfg [2023-08-27 01:26:01,245 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 01:26:01,246 INFO L158 Benchmark]: Toolchain (without parser) took 821952.62ms. Allocated memory was 381.7MB in the beginning and 9.7GB in the end (delta: 9.4GB). Free memory was 337.3MB in the beginning and 3.9GB in the end (delta: -3.5GB). Peak memory consumption was 5.8GB. Max. memory is 16.0GB. [2023-08-27 01:26:01,246 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 381.7MB. Free memory was 359.2MB in the beginning and 359.1MB in the end (delta: 91.7kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 01:26:01,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.81ms. Allocated memory is still 381.7MB. Free memory was 337.3MB in the beginning and 325.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-27 01:26:01,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.88ms. Allocated memory is still 381.7MB. Free memory was 325.7MB in the beginning and 323.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 01:26:01,246 INFO L158 Benchmark]: Boogie Preprocessor took 45.40ms. Allocated memory is still 381.7MB. Free memory was 323.6MB in the beginning and 321.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 01:26:01,247 INFO L158 Benchmark]: RCFGBuilder took 597.61ms. Allocated memory is still 381.7MB. Free memory was 321.5MB in the beginning and 290.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-27 01:26:01,247 INFO L158 Benchmark]: TraceAbstraction took 820953.46ms. Allocated memory was 381.7MB in the beginning and 9.7GB in the end (delta: 9.4GB). Free memory was 290.1MB in the beginning and 3.9GB in the end (delta: -3.6GB). Peak memory consumption was 5.8GB. Max. memory is 16.0GB. [2023-08-27 01:26:01,248 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.17ms. Allocated memory is still 381.7MB. Free memory was 359.2MB in the beginning and 359.1MB in the end (delta: 91.7kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 291.81ms. Allocated memory is still 381.7MB. Free memory was 337.3MB in the beginning and 325.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.88ms. Allocated memory is still 381.7MB. Free memory was 325.7MB in the beginning and 323.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.40ms. Allocated memory is still 381.7MB. Free memory was 323.6MB in the beginning and 321.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 597.61ms. Allocated memory is still 381.7MB. Free memory was 321.5MB in the beginning and 290.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 820953.46ms. Allocated memory was 381.7MB in the beginning and 9.7GB in the end (delta: 9.4GB). Free memory was 290.1MB in the beginning and 3.9GB in the end (delta: -3.6GB). Peak memory consumption was 5.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 176 PlacesBefore, 35 PlacesAfterwards, 184 TransitionsBefore, 33 TransitionsAfterwards, 942 CoEnabledTransitionPairs, 8 FixpointIterations, 127 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 28 TrivialYvCompositions, 4 ConcurrentYvCompositions, 10 ChoiceCompositions, 195 TotalNumberOfCompositions, 1791 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1423, independent: 1356, independent conditional: 0, independent unconditional: 1356, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 511, independent: 498, independent conditional: 0, independent unconditional: 498, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1423, independent: 858, independent conditional: 0, independent unconditional: 858, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 511, unknown conditional: 0, unknown unconditional: 511] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 40ms.. - TimeoutResultAtElement [Line: 53]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 40ms.. - TimeoutResultAtElement [Line: 53]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 40ms.. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 40ms.. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 40ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 40ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 40ms.. - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 40ms.. - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 40ms.. - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 40ms.. - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 40ms.. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 40ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 40ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 211 locations, 19 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: 820.8s, OverallIterations: 29, TraceHistogramMax: 10, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 600.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 353 mSolverCounterUnknown, 3761 SdHoareTripleChecker+Valid, 72.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3761 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 71.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 901 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 533 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10389 IncrementalHoareTripleChecker+Invalid, 12176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 533 mSolverCounterUnsat, 10 mSDtfsCounter, 10389 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 986 GetRequests, 425 SyntacticMatches, 9 SemanticMatches, 552 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 6108 ImplicationChecksByTransitivity, 426.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37254occurred in iteration=27, InterpolantAutomatonStates: 386, 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.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 114.1s InterpolantComputationTime, 768 NumberOfCodeBlocks, 746 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 993 ConstructedInterpolants, 70 QuantifiedInterpolants, 14208 SizeOfPredicates, 214 NumberOfNonLiveVariables, 4411 ConjunctsInSsa, 425 ConjunctsInUnsatCore, 63 InterpolantComputations, 14 PerfectInterpolantSequences, 265/519 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 could not prove your program: Timeout Completed graceful shutdown