/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/chl-node-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 23:43:46,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 23:43:46,417 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-26 23:43:46,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 23:43:46,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 23:43:46,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 23:43:46,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 23:43:46,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 23:43:46,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 23:43:46,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 23:43:46,457 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 23:43:46,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 23:43:46,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 23:43:46,458 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 23:43:46,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 23:43:46,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 23:43:46,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 23:43:46,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 23:43:46,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 23:43:46,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 23:43:46,460 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 23:43:46,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 23:43:46,461 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 23:43:46,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 23:43:46,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 23:43:46,461 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 23:43:46,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 23:43:46,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 23:43:46,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 23:43:46,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 23:43:46,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 23:43:46,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 23:43:46,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 23:43:46,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 23:43:46,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 23:43:46,464 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-26 23:43:46,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 23:43:46,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 23:43:46,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 23:43:46,770 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 23:43:46,770 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 23:43:46,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-trans.wvr.c [2023-08-26 23:43:47,869 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 23:43:48,091 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 23:43:48,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-trans.wvr.c [2023-08-26 23:43:48,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9af1ff798/9ce5b7a22da444dab32d19d3b7777652/FLAG7a934e638 [2023-08-26 23:43:48,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9af1ff798/9ce5b7a22da444dab32d19d3b7777652 [2023-08-26 23:43:48,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 23:43:48,129 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 23:43:48,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 23:43:48,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 23:43:48,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 23:43:48,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:43:48" (1/1) ... [2023-08-26 23:43:48,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784f6da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:43:48, skipping insertion in model container [2023-08-26 23:43:48,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:43:48" (1/1) ... [2023-08-26 23:43:48,171 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 23:43:48,388 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 23:43:48,395 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 23:43:48,432 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 23:43:48,449 INFO L206 MainTranslator]: Completed translation [2023-08-26 23:43:48,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:43:48 WrapperNode [2023-08-26 23:43:48,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 23:43:48,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 23:43:48,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 23:43:48,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 23:43:48,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:43:48" (1/1) ... [2023-08-26 23:43:48,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:43:48" (1/1) ... [2023-08-26 23:43:48,530 INFO L138 Inliner]: procedures = 27, calls = 67, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 505 [2023-08-26 23:43:48,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 23:43:48,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 23:43:48,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 23:43:48,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 23:43:48,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:43:48" (1/1) ... [2023-08-26 23:43:48,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:43:48" (1/1) ... [2023-08-26 23:43:48,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:43:48" (1/1) ... [2023-08-26 23:43:48,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:43:48" (1/1) ... [2023-08-26 23:43:48,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:43:48" (1/1) ... [2023-08-26 23:43:48,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:43:48" (1/1) ... [2023-08-26 23:43:48,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:43:48" (1/1) ... [2023-08-26 23:43:48,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:43:48" (1/1) ... [2023-08-26 23:43:48,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 23:43:48,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 23:43:48,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 23:43:48,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 23:43:48,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:43:48" (1/1) ... [2023-08-26 23:43:48,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 23:43:48,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:43:48,597 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-26 23:43:48,613 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-26 23:43:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 23:43:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 23:43:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 23:43:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 23:43:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 23:43:48,639 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 23:43:48,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 23:43:48,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 23:43:48,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 23:43:48,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 23:43:48,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 23:43:48,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-26 23:43:48,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 23:43:48,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 23:43:48,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 23:43:48,642 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 23:43:48,749 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 23:43:48,750 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 23:43:49,478 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 23:43:49,492 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 23:43:49,493 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-26 23:43:49,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:43:49 BoogieIcfgContainer [2023-08-26 23:43:49,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 23:43:49,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 23:43:49,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 23:43:49,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 23:43:49,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 11:43:48" (1/3) ... [2023-08-26 23:43:49,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78722295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:43:49, skipping insertion in model container [2023-08-26 23:43:49,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:43:48" (2/3) ... [2023-08-26 23:43:49,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78722295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:43:49, skipping insertion in model container [2023-08-26 23:43:49,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:43:49" (3/3) ... [2023-08-26 23:43:49,504 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2023-08-26 23:43:49,518 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 23:43:49,519 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2023-08-26 23:43:49,519 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 23:43:49,616 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-26 23:43:49,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 586 places, 623 transitions, 1270 flow [2023-08-26 23:43:49,851 INFO L124 PetriNetUnfolderBase]: 47/620 cut-off events. [2023-08-26 23:43:49,852 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 23:43:49,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 620 events. 47/620 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1067 event pairs, 0 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 523. Up to 2 conditions per place. [2023-08-26 23:43:49,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 586 places, 623 transitions, 1270 flow [2023-08-26 23:43:49,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 572 places, 609 transitions, 1236 flow [2023-08-26 23:43:49,880 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 23:43:49,891 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 572 places, 609 transitions, 1236 flow [2023-08-26 23:43:49,897 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 572 places, 609 transitions, 1236 flow [2023-08-26 23:43:49,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 572 places, 609 transitions, 1236 flow [2023-08-26 23:43:50,025 INFO L124 PetriNetUnfolderBase]: 47/609 cut-off events. [2023-08-26 23:43:50,025 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 23:43:50,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 609 events. 47/609 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1066 event pairs, 0 based on Foata normal form. 0/520 useless extension candidates. Maximal degree in co-relation 523. Up to 2 conditions per place. [2023-08-26 23:43:50,047 INFO L119 LiptonReduction]: Number of co-enabled transitions 34440 [2023-08-26 23:44:16,973 INFO L134 LiptonReduction]: Checked pairs total: 46663 [2023-08-26 23:44:16,974 INFO L136 LiptonReduction]: Total number of compositions: 793 [2023-08-26 23:44:16,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 23:44:16,988 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;@2cbc41ef, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 23:44:16,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-08-26 23:44:16,990 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 23:44:16,990 INFO L124 PetriNetUnfolderBase]: 1/2 cut-off events. [2023-08-26 23:44:16,991 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 23:44:16,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:16,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 23:44:16,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:16,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:16,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2484, now seen corresponding path program 1 times [2023-08-26 23:44:17,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:17,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916360864] [2023-08-26 23:44:17,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:17,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:17,081 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-26 23:44:17,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:17,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916360864] [2023-08-26 23:44:17,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916360864] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:17,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:44:17,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 23:44:17,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814526691] [2023-08-26 23:44:17,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:17,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 23:44:17,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:17,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 23:44:17,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 23:44:17,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 1416 [2023-08-26 23:44:17,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 184 flow. Second operand has 2 states, 2 states have (on average 587.5) internal successors, (1175), 2 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:17,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:17,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 1416 [2023-08-26 23:44:17,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:18,080 INFO L124 PetriNetUnfolderBase]: 4319/6210 cut-off events. [2023-08-26 23:44:18,080 INFO L125 PetriNetUnfolderBase]: For 325/325 co-relation queries the response was YES. [2023-08-26 23:44:18,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12764 conditions, 6210 events. 4319/6210 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 30001 event pairs, 3825 based on Foata normal form. 0/3342 useless extension candidates. Maximal degree in co-relation 11792. Up to 6211 conditions per place. [2023-08-26 23:44:18,115 INFO L140 encePairwiseOnDemand]: 1408/1416 looper letters, 75 selfloop transitions, 0 changer transitions 0/75 dead transitions. [2023-08-26 23:44:18,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 75 transitions, 318 flow [2023-08-26 23:44:18,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 23:44:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 23:44:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1257 transitions. [2023-08-26 23:44:18,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4438559322033898 [2023-08-26 23:44:18,133 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1257 transitions. [2023-08-26 23:44:18,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1257 transitions. [2023-08-26 23:44:18,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:18,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1257 transitions. [2023-08-26 23:44:18,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 628.5) internal successors, (1257), 2 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:18,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 1416.0) internal successors, (4248), 3 states have internal predecessors, (4248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:18,152 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 1416.0) internal successors, (4248), 3 states have internal predecessors, (4248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:18,153 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 184 flow. Second operand 2 states and 1257 transitions. [2023-08-26 23:44:18,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 75 transitions, 318 flow [2023-08-26 23:44:18,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 75 transitions, 306 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-26 23:44:18,161 INFO L231 Difference]: Finished difference. Result has 71 places, 75 transitions, 156 flow [2023-08-26 23:44:18,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=156, PETRI_PLACES=71, PETRI_TRANSITIONS=75} [2023-08-26 23:44:18,172 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -13 predicate places. [2023-08-26 23:44:18,172 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 75 transitions, 156 flow [2023-08-26 23:44:18,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 587.5) internal successors, (1175), 2 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:18,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:18,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 23:44:18,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 23:44:18,174 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:18,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:18,175 INFO L85 PathProgramCache]: Analyzing trace with hash 79239, now seen corresponding path program 1 times [2023-08-26 23:44:18,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:18,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347063099] [2023-08-26 23:44:18,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:18,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:18,343 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-26 23:44:18,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:18,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347063099] [2023-08-26 23:44:18,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347063099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:18,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:44:18,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 23:44:18,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114087673] [2023-08-26 23:44:18,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:18,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 23:44:18,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:18,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 23:44:18,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 23:44:18,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 1416 [2023-08-26 23:44:18,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 567.6666666666666) internal successors, (1703), 3 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:18,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:18,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 1416 [2023-08-26 23:44:18,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:19,164 INFO L124 PetriNetUnfolderBase]: 4319/6208 cut-off events. [2023-08-26 23:44:19,164 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-08-26 23:44:19,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12552 conditions, 6208 events. 4319/6208 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 30014 event pairs, 3825 based on Foata normal form. 0/3342 useless extension candidates. Maximal degree in co-relation 12549. Up to 6208 conditions per place. [2023-08-26 23:44:19,194 INFO L140 encePairwiseOnDemand]: 1413/1416 looper letters, 72 selfloop transitions, 1 changer transitions 0/73 dead transitions. [2023-08-26 23:44:19,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 73 transitions, 298 flow [2023-08-26 23:44:19,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 23:44:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 23:44:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1776 transitions. [2023-08-26 23:44:19,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4180790960451977 [2023-08-26 23:44:19,200 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1776 transitions. [2023-08-26 23:44:19,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1776 transitions. [2023-08-26 23:44:19,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:19,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1776 transitions. [2023-08-26 23:44:19,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:19,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:19,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:19,215 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 156 flow. Second operand 3 states and 1776 transitions. [2023-08-26 23:44:19,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 73 transitions, 298 flow [2023-08-26 23:44:19,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 73 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 23:44:19,217 INFO L231 Difference]: Finished difference. Result has 71 places, 73 transitions, 154 flow [2023-08-26 23:44:19,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=69, 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=154, PETRI_PLACES=71, PETRI_TRANSITIONS=73} [2023-08-26 23:44:19,218 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -13 predicate places. [2023-08-26 23:44:19,219 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 73 transitions, 154 flow [2023-08-26 23:44:19,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.6666666666666) internal successors, (1703), 3 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:19,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:19,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 23:44:19,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 23:44:19,220 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:19,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:19,221 INFO L85 PathProgramCache]: Analyzing trace with hash 79240, now seen corresponding path program 1 times [2023-08-26 23:44:19,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:19,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660351010] [2023-08-26 23:44:19,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:19,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:19,286 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-26 23:44:19,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:19,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660351010] [2023-08-26 23:44:19,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660351010] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:19,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:44:19,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 23:44:19,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350674370] [2023-08-26 23:44:19,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:19,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 23:44:19,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:19,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 23:44:19,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 23:44:19,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 1416 [2023-08-26 23:44:19,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 73 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 567.6666666666666) internal successors, (1703), 3 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:19,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:19,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 1416 [2023-08-26 23:44:19,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:20,097 INFO L124 PetriNetUnfolderBase]: 4319/6206 cut-off events. [2023-08-26 23:44:20,097 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-08-26 23:44:20,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12550 conditions, 6206 events. 4319/6206 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 30018 event pairs, 3825 based on Foata normal form. 0/3342 useless extension candidates. Maximal degree in co-relation 12546. Up to 6206 conditions per place. [2023-08-26 23:44:20,129 INFO L140 encePairwiseOnDemand]: 1413/1416 looper letters, 70 selfloop transitions, 1 changer transitions 0/71 dead transitions. [2023-08-26 23:44:20,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 71 transitions, 292 flow [2023-08-26 23:44:20,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 23:44:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 23:44:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1774 transitions. [2023-08-26 23:44:20,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.417608286252354 [2023-08-26 23:44:20,135 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1774 transitions. [2023-08-26 23:44:20,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1774 transitions. [2023-08-26 23:44:20,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:20,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1774 transitions. [2023-08-26 23:44:20,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:20,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:20,150 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:20,150 INFO L175 Difference]: Start difference. First operand has 71 places, 73 transitions, 154 flow. Second operand 3 states and 1774 transitions. [2023-08-26 23:44:20,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 71 transitions, 292 flow [2023-08-26 23:44:20,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 71 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 23:44:20,152 INFO L231 Difference]: Finished difference. Result has 70 places, 71 transitions, 151 flow [2023-08-26 23:44:20,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=70, PETRI_TRANSITIONS=71} [2023-08-26 23:44:20,153 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -14 predicate places. [2023-08-26 23:44:20,153 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 71 transitions, 151 flow [2023-08-26 23:44:20,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.6666666666666) internal successors, (1703), 3 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:20,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:20,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 23:44:20,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 23:44:20,158 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:20,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash 79276, now seen corresponding path program 1 times [2023-08-26 23:44:20,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:20,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716583423] [2023-08-26 23:44:20,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:20,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:20,265 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-26 23:44:20,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:20,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716583423] [2023-08-26 23:44:20,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716583423] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:20,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:44:20,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 23:44:20,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16455337] [2023-08-26 23:44:20,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:20,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 23:44:20,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:20,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 23:44:20,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 23:44:20,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 1416 [2023-08-26 23:44:20,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 71 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 563.6666666666666) internal successors, (1691), 3 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:20,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:20,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 1416 [2023-08-26 23:44:20,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:21,042 INFO L124 PetriNetUnfolderBase]: 4319/6203 cut-off events. [2023-08-26 23:44:21,042 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-08-26 23:44:21,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12545 conditions, 6203 events. 4319/6203 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 30001 event pairs, 3825 based on Foata normal form. 0/3342 useless extension candidates. Maximal degree in co-relation 12541. Up to 6195 conditions per place. [2023-08-26 23:44:21,066 INFO L140 encePairwiseOnDemand]: 1407/1416 looper letters, 62 selfloop transitions, 6 changer transitions 0/68 dead transitions. [2023-08-26 23:44:21,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 281 flow [2023-08-26 23:44:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 23:44:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 23:44:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2023-08-26 23:44:21,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4143126177024482 [2023-08-26 23:44:21,072 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1760 transitions. [2023-08-26 23:44:21,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1760 transitions. [2023-08-26 23:44:21,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:21,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1760 transitions. [2023-08-26 23:44:21,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 586.6666666666666) internal successors, (1760), 3 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:21,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:21,086 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:21,086 INFO L175 Difference]: Start difference. First operand has 70 places, 71 transitions, 151 flow. Second operand 3 states and 1760 transitions. [2023-08-26 23:44:21,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 281 flow [2023-08-26 23:44:21,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 23:44:21,088 INFO L231 Difference]: Finished difference. Result has 68 places, 68 transitions, 156 flow [2023-08-26 23:44:21,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=68, PETRI_TRANSITIONS=68} [2023-08-26 23:44:21,089 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -16 predicate places. [2023-08-26 23:44:21,089 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 156 flow [2023-08-26 23:44:21,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.6666666666666) internal successors, (1691), 3 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:21,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:21,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 23:44:21,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 23:44:21,090 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:21,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:21,091 INFO L85 PathProgramCache]: Analyzing trace with hash 79277, now seen corresponding path program 1 times [2023-08-26 23:44:21,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:21,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148279043] [2023-08-26 23:44:21,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:21,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:21,133 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-26 23:44:21,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:21,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148279043] [2023-08-26 23:44:21,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148279043] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:21,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:44:21,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 23:44:21,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201060673] [2023-08-26 23:44:21,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:21,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 23:44:21,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:21,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 23:44:21,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 23:44:21,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 1416 [2023-08-26 23:44:21,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 563.6666666666666) internal successors, (1691), 3 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:21,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:21,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 1416 [2023-08-26 23:44:21,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:21,787 INFO L124 PetriNetUnfolderBase]: 4326/6213 cut-off events. [2023-08-26 23:44:21,787 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-08-26 23:44:21,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12576 conditions, 6213 events. 4326/6213 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 29995 event pairs, 3825 based on Foata normal form. 0/3349 useless extension candidates. Maximal degree in co-relation 12572. Up to 6209 conditions per place. [2023-08-26 23:44:21,813 INFO L140 encePairwiseOnDemand]: 1402/1416 looper letters, 67 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2023-08-26 23:44:21,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 78 transitions, 342 flow [2023-08-26 23:44:21,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 23:44:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 23:44:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1770 transitions. [2023-08-26 23:44:21,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2023-08-26 23:44:21,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1770 transitions. [2023-08-26 23:44:21,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1770 transitions. [2023-08-26 23:44:21,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:21,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1770 transitions. [2023-08-26 23:44:21,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 590.0) internal successors, (1770), 3 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:21,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:21,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:21,829 INFO L175 Difference]: Start difference. First operand has 68 places, 68 transitions, 156 flow. Second operand 3 states and 1770 transitions. [2023-08-26 23:44:21,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 78 transitions, 342 flow [2023-08-26 23:44:21,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 23:44:21,832 INFO L231 Difference]: Finished difference. Result has 70 places, 78 transitions, 234 flow [2023-08-26 23:44:21,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=70, PETRI_TRANSITIONS=78} [2023-08-26 23:44:21,832 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -14 predicate places. [2023-08-26 23:44:21,833 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 78 transitions, 234 flow [2023-08-26 23:44:21,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.6666666666666) internal successors, (1691), 3 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:21,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:21,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 23:44:21,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 23:44:21,834 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:21,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:21,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2461162, now seen corresponding path program 1 times [2023-08-26 23:44:21,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:21,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752452555] [2023-08-26 23:44:21,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:21,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:21,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-26 23:44:21,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:21,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752452555] [2023-08-26 23:44:21,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752452555] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:44:21,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64985789] [2023-08-26 23:44:21,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:21,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:44:21,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:44:21,885 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-26 23:44:21,901 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-26 23:44:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:22,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-26 23:44:22,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:44:22,056 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-26 23:44:22,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:44:22,071 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-26 23:44:22,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64985789] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:44:22,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:44:22,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2023-08-26 23:44:22,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6092970] [2023-08-26 23:44:22,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:44:22,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 23:44:22,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:22,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 23:44:22,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 23:44:22,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 1416 [2023-08-26 23:44:22,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 78 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 564.1428571428571) internal successors, (3949), 7 states have internal predecessors, (3949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:22,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:22,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 1416 [2023-08-26 23:44:22,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:22,953 INFO L124 PetriNetUnfolderBase]: 4347/6243 cut-off events. [2023-08-26 23:44:22,953 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-08-26 23:44:22,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12697 conditions, 6243 events. 4347/6243 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 30065 event pairs, 3825 based on Foata normal form. 0/3364 useless extension candidates. Maximal degree in co-relation 12692. Up to 6224 conditions per place. [2023-08-26 23:44:22,976 INFO L140 encePairwiseOnDemand]: 1402/1416 looper letters, 67 selfloop transitions, 41 changer transitions 0/108 dead transitions. [2023-08-26 23:44:22,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 582 flow [2023-08-26 23:44:22,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 23:44:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 23:44:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3495 transitions. [2023-08-26 23:44:22,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4113700564971751 [2023-08-26 23:44:22,986 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3495 transitions. [2023-08-26 23:44:22,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3495 transitions. [2023-08-26 23:44:22,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:22,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3495 transitions. [2023-08-26 23:44:22,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 582.5) internal successors, (3495), 6 states have internal predecessors, (3495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:23,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1416.0) internal successors, (9912), 7 states have internal predecessors, (9912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:23,005 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1416.0) internal successors, (9912), 7 states have internal predecessors, (9912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:23,006 INFO L175 Difference]: Start difference. First operand has 70 places, 78 transitions, 234 flow. Second operand 6 states and 3495 transitions. [2023-08-26 23:44:23,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 582 flow [2023-08-26 23:44:23,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 108 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 23:44:23,009 INFO L231 Difference]: Finished difference. Result has 76 places, 108 transitions, 487 flow [2023-08-26 23:44:23,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=487, PETRI_PLACES=76, PETRI_TRANSITIONS=108} [2023-08-26 23:44:23,010 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -8 predicate places. [2023-08-26 23:44:23,010 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 108 transitions, 487 flow [2023-08-26 23:44:23,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 564.1428571428571) internal successors, (3949), 7 states have internal predecessors, (3949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:23,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:23,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 23:44:23,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-26 23:44:23,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-26 23:44:23,218 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:23,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:23,218 INFO L85 PathProgramCache]: Analyzing trace with hash 76447894, now seen corresponding path program 1 times [2023-08-26 23:44:23,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:23,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591332723] [2023-08-26 23:44:23,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:23,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:23,255 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-26 23:44:23,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591332723] [2023-08-26 23:44:23,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591332723] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:23,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:44:23,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 23:44:23,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800227516] [2023-08-26 23:44:23,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:23,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 23:44:23,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:23,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 23:44:23,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 23:44:23,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 1416 [2023-08-26 23:44:23,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 108 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:23,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:23,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 1416 [2023-08-26 23:44:23,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:23,987 INFO L124 PetriNetUnfolderBase]: 4343/6237 cut-off events. [2023-08-26 23:44:23,987 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-08-26 23:44:23,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12746 conditions, 6237 events. 4343/6237 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 30042 event pairs, 3825 based on Foata normal form. 0/3367 useless extension candidates. Maximal degree in co-relation 12738. Up to 6237 conditions per place. [2023-08-26 23:44:24,009 INFO L140 encePairwiseOnDemand]: 1413/1416 looper letters, 101 selfloop transitions, 1 changer transitions 0/102 dead transitions. [2023-08-26 23:44:24,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 102 transitions, 656 flow [2023-08-26 23:44:24,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 23:44:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 23:44:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2023-08-26 23:44:24,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4164312617702448 [2023-08-26 23:44:24,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1769 transitions. [2023-08-26 23:44:24,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1769 transitions. [2023-08-26 23:44:24,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:24,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1769 transitions. [2023-08-26 23:44:24,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 589.6666666666666) internal successors, (1769), 3 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:24,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:24,024 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:24,024 INFO L175 Difference]: Start difference. First operand has 76 places, 108 transitions, 487 flow. Second operand 3 states and 1769 transitions. [2023-08-26 23:44:24,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 102 transitions, 656 flow [2023-08-26 23:44:24,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 102 transitions, 598 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-08-26 23:44:24,028 INFO L231 Difference]: Finished difference. Result has 75 places, 102 transitions, 396 flow [2023-08-26 23:44:24,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=75, PETRI_TRANSITIONS=102} [2023-08-26 23:44:24,029 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -9 predicate places. [2023-08-26 23:44:24,029 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 102 transitions, 396 flow [2023-08-26 23:44:24,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:24,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:24,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 23:44:24,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 23:44:24,030 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:24,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:24,030 INFO L85 PathProgramCache]: Analyzing trace with hash 76447895, now seen corresponding path program 1 times [2023-08-26 23:44:24,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:24,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135394208] [2023-08-26 23:44:24,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:24,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:24,078 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-26 23:44:24,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:24,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135394208] [2023-08-26 23:44:24,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135394208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:24,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:44:24,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 23:44:24,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538645359] [2023-08-26 23:44:24,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:24,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 23:44:24,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:24,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 23:44:24,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 23:44:24,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 1416 [2023-08-26 23:44:24,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 102 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:24,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:24,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 1416 [2023-08-26 23:44:24,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:24,801 INFO L124 PetriNetUnfolderBase]: 4339/6231 cut-off events. [2023-08-26 23:44:24,801 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-26 23:44:24,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12696 conditions, 6231 events. 4339/6231 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 30029 event pairs, 3825 based on Foata normal form. 2/3370 useless extension candidates. Maximal degree in co-relation 12687. Up to 6231 conditions per place. [2023-08-26 23:44:24,827 INFO L140 encePairwiseOnDemand]: 1413/1416 looper letters, 95 selfloop transitions, 1 changer transitions 0/96 dead transitions. [2023-08-26 23:44:24,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 96 transitions, 560 flow [2023-08-26 23:44:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 23:44:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 23:44:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1767 transitions. [2023-08-26 23:44:24,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4159604519774011 [2023-08-26 23:44:24,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1767 transitions. [2023-08-26 23:44:24,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1767 transitions. [2023-08-26 23:44:24,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:24,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1767 transitions. [2023-08-26 23:44:24,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:24,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:24,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:24,844 INFO L175 Difference]: Start difference. First operand has 75 places, 102 transitions, 396 flow. Second operand 3 states and 1767 transitions. [2023-08-26 23:44:24,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 96 transitions, 560 flow [2023-08-26 23:44:24,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 559 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 23:44:24,846 INFO L231 Difference]: Finished difference. Result has 74 places, 96 transitions, 369 flow [2023-08-26 23:44:24,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=74, PETRI_TRANSITIONS=96} [2023-08-26 23:44:24,847 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -10 predicate places. [2023-08-26 23:44:24,847 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 96 transitions, 369 flow [2023-08-26 23:44:24,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:24,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:24,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 23:44:24,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 23:44:24,848 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:24,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:24,849 INFO L85 PathProgramCache]: Analyzing trace with hash 76451304, now seen corresponding path program 1 times [2023-08-26 23:44:24,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:24,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607750693] [2023-08-26 23:44:24,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:24,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:24,891 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-26 23:44:24,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:24,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607750693] [2023-08-26 23:44:24,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607750693] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:24,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:44:24,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 23:44:24,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35243596] [2023-08-26 23:44:24,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:24,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 23:44:24,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:24,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 23:44:24,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 23:44:24,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 1416 [2023-08-26 23:44:24,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 96 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:24,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:24,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 1416 [2023-08-26 23:44:24,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:25,567 INFO L124 PetriNetUnfolderBase]: 4335/6226 cut-off events. [2023-08-26 23:44:25,567 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-26 23:44:25,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12677 conditions, 6226 events. 4335/6226 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 30040 event pairs, 3825 based on Foata normal form. 0/3368 useless extension candidates. Maximal degree in co-relation 12668. Up to 6226 conditions per place. [2023-08-26 23:44:25,594 INFO L140 encePairwiseOnDemand]: 1414/1416 looper letters, 90 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2023-08-26 23:44:25,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 91 transitions, 525 flow [2023-08-26 23:44:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 23:44:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 23:44:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1765 transitions. [2023-08-26 23:44:25,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4154896421845574 [2023-08-26 23:44:25,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1765 transitions. [2023-08-26 23:44:25,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1765 transitions. [2023-08-26 23:44:25,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:25,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1765 transitions. [2023-08-26 23:44:25,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 588.3333333333334) internal successors, (1765), 3 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:25,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:25,609 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:25,609 INFO L175 Difference]: Start difference. First operand has 74 places, 96 transitions, 369 flow. Second operand 3 states and 1765 transitions. [2023-08-26 23:44:25,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 91 transitions, 525 flow [2023-08-26 23:44:25,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 91 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 23:44:25,611 INFO L231 Difference]: Finished difference. Result has 74 places, 91 transitions, 344 flow [2023-08-26 23:44:25,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=74, PETRI_TRANSITIONS=91} [2023-08-26 23:44:25,612 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -10 predicate places. [2023-08-26 23:44:25,612 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 91 transitions, 344 flow [2023-08-26 23:44:25,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:25,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:25,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 23:44:25,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 23:44:25,613 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:25,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:25,614 INFO L85 PathProgramCache]: Analyzing trace with hash 76451305, now seen corresponding path program 1 times [2023-08-26 23:44:25,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:25,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92878546] [2023-08-26 23:44:25,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:25,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:25,647 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-26 23:44:25,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:25,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92878546] [2023-08-26 23:44:25,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92878546] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:25,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:44:25,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 23:44:25,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934288934] [2023-08-26 23:44:25,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:25,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 23:44:25,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:25,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 23:44:25,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 23:44:25,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 1416 [2023-08-26 23:44:25,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 91 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:25,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:25,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 1416 [2023-08-26 23:44:25,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:26,225 INFO L124 PetriNetUnfolderBase]: 4331/6221 cut-off events. [2023-08-26 23:44:26,225 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-26 23:44:26,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12658 conditions, 6221 events. 4331/6221 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 30014 event pairs, 3825 based on Foata normal form. 0/3368 useless extension candidates. Maximal degree in co-relation 12649. Up to 6221 conditions per place. [2023-08-26 23:44:26,251 INFO L140 encePairwiseOnDemand]: 1414/1416 looper letters, 85 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2023-08-26 23:44:26,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 86 transitions, 490 flow [2023-08-26 23:44:26,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 23:44:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 23:44:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1764 transitions. [2023-08-26 23:44:26,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4152542372881356 [2023-08-26 23:44:26,256 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1764 transitions. [2023-08-26 23:44:26,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1764 transitions. [2023-08-26 23:44:26,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:26,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1764 transitions. [2023-08-26 23:44:26,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:26,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:26,266 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:26,266 INFO L175 Difference]: Start difference. First operand has 74 places, 91 transitions, 344 flow. Second operand 3 states and 1764 transitions. [2023-08-26 23:44:26,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 86 transitions, 490 flow [2023-08-26 23:44:26,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 86 transitions, 489 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 23:44:26,269 INFO L231 Difference]: Finished difference. Result has 74 places, 86 transitions, 319 flow [2023-08-26 23:44:26,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=74, PETRI_TRANSITIONS=86} [2023-08-26 23:44:26,269 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -10 predicate places. [2023-08-26 23:44:26,270 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 86 transitions, 319 flow [2023-08-26 23:44:26,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:26,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:26,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 23:44:26,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 23:44:26,271 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:26,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:26,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1924969485, now seen corresponding path program 1 times [2023-08-26 23:44:26,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:26,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310564458] [2023-08-26 23:44:26,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:26,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:44:26,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:26,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310564458] [2023-08-26 23:44:26,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310564458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:26,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:44:26,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 23:44:26,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886536931] [2023-08-26 23:44:26,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:26,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 23:44:26,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:26,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 23:44:26,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 23:44:26,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 1416 [2023-08-26 23:44:26,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 86 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 564.6666666666666) internal successors, (1694), 3 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:26,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:26,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 1416 [2023-08-26 23:44:26,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:26,913 INFO L124 PetriNetUnfolderBase]: 4334/6227 cut-off events. [2023-08-26 23:44:26,914 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-26 23:44:26,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12671 conditions, 6227 events. 4334/6227 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 30063 event pairs, 3825 based on Foata normal form. 0/3371 useless extension candidates. Maximal degree in co-relation 12662. Up to 6219 conditions per place. [2023-08-26 23:44:26,940 INFO L140 encePairwiseOnDemand]: 1403/1416 looper letters, 81 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2023-08-26 23:44:26,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 92 transitions, 515 flow [2023-08-26 23:44:26,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 23:44:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 23:44:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2023-08-26 23:44:26,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4150188323917137 [2023-08-26 23:44:26,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2023-08-26 23:44:26,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2023-08-26 23:44:26,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:26,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2023-08-26 23:44:26,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:26,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:26,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:26,956 INFO L175 Difference]: Start difference. First operand has 74 places, 86 transitions, 319 flow. Second operand 3 states and 1763 transitions. [2023-08-26 23:44:26,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 92 transitions, 515 flow [2023-08-26 23:44:26,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 92 transitions, 514 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 23:44:26,959 INFO L231 Difference]: Finished difference. Result has 77 places, 92 transitions, 398 flow [2023-08-26 23:44:26,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=77, PETRI_TRANSITIONS=92} [2023-08-26 23:44:26,960 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -7 predicate places. [2023-08-26 23:44:26,960 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 92 transitions, 398 flow [2023-08-26 23:44:26,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.6666666666666) internal successors, (1694), 3 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:26,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:26,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 23:44:26,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 23:44:26,961 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:26,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:26,962 INFO L85 PathProgramCache]: Analyzing trace with hash 455495527, now seen corresponding path program 1 times [2023-08-26 23:44:26,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:26,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818974183] [2023-08-26 23:44:26,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:26,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:27,047 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-26 23:44:27,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:27,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818974183] [2023-08-26 23:44:27,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818974183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:27,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:44:27,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 23:44:27,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900997844] [2023-08-26 23:44:27,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:27,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 23:44:27,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:27,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 23:44:27,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 23:44:27,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 1416 [2023-08-26 23:44:27,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 92 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 553.0) internal successors, (1659), 3 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:27,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:27,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 1416 [2023-08-26 23:44:27,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:27,743 INFO L124 PetriNetUnfolderBase]: 4333/6226 cut-off events. [2023-08-26 23:44:27,744 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-08-26 23:44:27,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12703 conditions, 6226 events. 4333/6226 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 30025 event pairs, 3825 based on Foata normal form. 1/3377 useless extension candidates. Maximal degree in co-relation 12693. Up to 6226 conditions per place. [2023-08-26 23:44:27,765 INFO L140 encePairwiseOnDemand]: 1413/1416 looper letters, 89 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-08-26 23:44:27,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 91 transitions, 576 flow [2023-08-26 23:44:27,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 23:44:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 23:44:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1717 transitions. [2023-08-26 23:44:27,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4041902071563089 [2023-08-26 23:44:27,770 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1717 transitions. [2023-08-26 23:44:27,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1717 transitions. [2023-08-26 23:44:27,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:27,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1717 transitions. [2023-08-26 23:44:27,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 572.3333333333334) internal successors, (1717), 3 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:27,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:27,779 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:27,779 INFO L175 Difference]: Start difference. First operand has 77 places, 92 transitions, 398 flow. Second operand 3 states and 1717 transitions. [2023-08-26 23:44:27,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 91 transitions, 576 flow [2023-08-26 23:44:27,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 91 transitions, 554 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 23:44:27,781 INFO L231 Difference]: Finished difference. Result has 77 places, 91 transitions, 376 flow [2023-08-26 23:44:27,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=77, PETRI_TRANSITIONS=91} [2023-08-26 23:44:27,782 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -7 predicate places. [2023-08-26 23:44:27,782 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 91 transitions, 376 flow [2023-08-26 23:44:27,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.0) internal successors, (1659), 3 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:27,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:27,783 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2023-08-26 23:44:27,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 23:44:27,783 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:27,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:27,783 INFO L85 PathProgramCache]: Analyzing trace with hash 309583085, now seen corresponding path program 2 times [2023-08-26 23:44:27,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:27,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695013482] [2023-08-26 23:44:27,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:27,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:27,852 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-26 23:44:27,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:27,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695013482] [2023-08-26 23:44:27,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695013482] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:44:27,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909844376] [2023-08-26 23:44:27,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 23:44:27,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:44:27,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:44:27,857 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-26 23:44:27,865 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-26 23:44:27,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-26 23:44:27,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 23:44:27,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 23:44:27,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:44:27,989 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-26 23:44:27,990 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 23:44:27,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909844376] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:27,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 23:44:27,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2023-08-26 23:44:27,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95336659] [2023-08-26 23:44:27,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:27,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 23:44:27,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:27,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 23:44:27,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-26 23:44:27,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 1416 [2023-08-26 23:44:27,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 91 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 567.0) internal successors, (1701), 3 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:27,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:27,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 1416 [2023-08-26 23:44:27,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:28,573 INFO L124 PetriNetUnfolderBase]: 4333/6223 cut-off events. [2023-08-26 23:44:28,574 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-08-26 23:44:28,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12676 conditions, 6223 events. 4333/6223 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 30019 event pairs, 3825 based on Foata normal form. 3/3372 useless extension candidates. Maximal degree in co-relation 12666. Up to 6223 conditions per place. [2023-08-26 23:44:28,594 INFO L140 encePairwiseOnDemand]: 1412/1416 looper letters, 87 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-08-26 23:44:28,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 88 transitions, 522 flow [2023-08-26 23:44:28,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 23:44:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 23:44:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2023-08-26 23:44:28,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4143126177024482 [2023-08-26 23:44:28,598 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1760 transitions. [2023-08-26 23:44:28,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1760 transitions. [2023-08-26 23:44:28,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:28,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1760 transitions. [2023-08-26 23:44:28,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 586.6666666666666) internal successors, (1760), 3 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:28,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:28,606 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:28,606 INFO L175 Difference]: Start difference. First operand has 77 places, 91 transitions, 376 flow. Second operand 3 states and 1760 transitions. [2023-08-26 23:44:28,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 88 transitions, 522 flow [2023-08-26 23:44:28,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 88 transitions, 470 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-26 23:44:28,609 INFO L231 Difference]: Finished difference. Result has 71 places, 88 transitions, 296 flow [2023-08-26 23:44:28,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=71, PETRI_TRANSITIONS=88} [2023-08-26 23:44:28,609 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -13 predicate places. [2023-08-26 23:44:28,609 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 88 transitions, 296 flow [2023-08-26 23:44:28,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.0) internal successors, (1701), 3 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:28,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:28,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:44:28,621 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-26 23:44:28,815 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,SelfDestructingSolverStorable12 [2023-08-26 23:44:28,815 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:28,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:28,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1153057060, now seen corresponding path program 1 times [2023-08-26 23:44:28,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:28,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396524592] [2023-08-26 23:44:28,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:28,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:28,897 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-26 23:44:28,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:28,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396524592] [2023-08-26 23:44:28,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396524592] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:28,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:44:28,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 23:44:28,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898872361] [2023-08-26 23:44:28,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:28,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 23:44:28,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:28,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 23:44:28,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 23:44:28,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 1416 [2023-08-26 23:44:28,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 88 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 532.75) internal successors, (2131), 4 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:28,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:28,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 1416 [2023-08-26 23:44:28,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:29,581 INFO L124 PetriNetUnfolderBase]: 4332/6222 cut-off events. [2023-08-26 23:44:29,582 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-08-26 23:44:29,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12642 conditions, 6222 events. 4332/6222 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 30013 event pairs, 3825 based on Foata normal form. 0/3362 useless extension candidates. Maximal degree in co-relation 12636. Up to 6217 conditions per place. [2023-08-26 23:44:29,597 INFO L140 encePairwiseOnDemand]: 1411/1416 looper letters, 80 selfloop transitions, 7 changer transitions 0/87 dead transitions. [2023-08-26 23:44:29,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 466 flow [2023-08-26 23:44:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 23:44:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 23:44:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2186 transitions. [2023-08-26 23:44:29,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3859463276836158 [2023-08-26 23:44:29,601 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 2186 transitions. [2023-08-26 23:44:29,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 2186 transitions. [2023-08-26 23:44:29,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:29,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 2186 transitions. [2023-08-26 23:44:29,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 546.5) internal successors, (2186), 4 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:29,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1416.0) internal successors, (7080), 5 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:29,610 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1416.0) internal successors, (7080), 5 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:29,610 INFO L175 Difference]: Start difference. First operand has 71 places, 88 transitions, 296 flow. Second operand 4 states and 2186 transitions. [2023-08-26 23:44:29,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 466 flow [2023-08-26 23:44:29,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 87 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 23:44:29,612 INFO L231 Difference]: Finished difference. Result has 73 places, 87 transitions, 305 flow [2023-08-26 23:44:29,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=305, PETRI_PLACES=73, PETRI_TRANSITIONS=87} [2023-08-26 23:44:29,613 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -11 predicate places. [2023-08-26 23:44:29,613 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 87 transitions, 305 flow [2023-08-26 23:44:29,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 532.75) internal successors, (2131), 4 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:29,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:29,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:44:29,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 23:44:29,614 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:29,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:29,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1280792474, now seen corresponding path program 1 times [2023-08-26 23:44:29,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:29,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3110872] [2023-08-26 23:44:29,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:29,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 23:44:29,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:29,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3110872] [2023-08-26 23:44:29,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3110872] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:29,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:44:29,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 23:44:29,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074278832] [2023-08-26 23:44:29,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:29,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 23:44:29,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:29,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 23:44:29,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 23:44:29,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 1416 [2023-08-26 23:44:29,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 87 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 533.0) internal successors, (2132), 4 states have internal predecessors, (2132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:29,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:29,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 1416 [2023-08-26 23:44:29,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:30,361 INFO L124 PetriNetUnfolderBase]: 4331/6221 cut-off events. [2023-08-26 23:44:30,361 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-08-26 23:44:30,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12645 conditions, 6221 events. 4331/6221 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 29994 event pairs, 3825 based on Foata normal form. 1/3366 useless extension candidates. Maximal degree in co-relation 12639. Up to 6216 conditions per place. [2023-08-26 23:44:30,375 INFO L140 encePairwiseOnDemand]: 1411/1416 looper letters, 79 selfloop transitions, 7 changer transitions 0/86 dead transitions. [2023-08-26 23:44:30,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 86 transitions, 471 flow [2023-08-26 23:44:30,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 23:44:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 23:44:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2186 transitions. [2023-08-26 23:44:30,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3859463276836158 [2023-08-26 23:44:30,378 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 2186 transitions. [2023-08-26 23:44:30,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 2186 transitions. [2023-08-26 23:44:30,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:30,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 2186 transitions. [2023-08-26 23:44:30,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 546.5) internal successors, (2186), 4 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:30,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1416.0) internal successors, (7080), 5 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:30,386 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1416.0) internal successors, (7080), 5 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:30,386 INFO L175 Difference]: Start difference. First operand has 73 places, 87 transitions, 305 flow. Second operand 4 states and 2186 transitions. [2023-08-26 23:44:30,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 86 transitions, 471 flow [2023-08-26 23:44:30,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 86 transitions, 470 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 23:44:30,389 INFO L231 Difference]: Finished difference. Result has 75 places, 86 transitions, 312 flow [2023-08-26 23:44:30,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=75, PETRI_TRANSITIONS=86} [2023-08-26 23:44:30,389 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -9 predicate places. [2023-08-26 23:44:30,389 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 86 transitions, 312 flow [2023-08-26 23:44:30,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 533.0) internal successors, (2132), 4 states have internal predecessors, (2132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:30,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:30,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:44:30,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 23:44:30,390 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:30,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:30,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1045869786, now seen corresponding path program 1 times [2023-08-26 23:44:30,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:30,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620246845] [2023-08-26 23:44:30,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:30,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 23:44:30,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:30,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620246845] [2023-08-26 23:44:30,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620246845] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:44:30,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224857429] [2023-08-26 23:44:30,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:30,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:44:30,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:44:30,451 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-26 23:44:30,459 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-26 23:44:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:30,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-26 23:44:30,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:44:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 23:44:30,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:44:30,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 23:44:30,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224857429] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:44:30,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:44:30,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 12 [2023-08-26 23:44:30,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939551650] [2023-08-26 23:44:30,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:44:30,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 23:44:30,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:30,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 23:44:30,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-08-26 23:44:30,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 1416 [2023-08-26 23:44:30,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 86 transitions, 312 flow. Second operand has 13 states, 13 states have (on average 499.84615384615387) internal successors, (6498), 13 states have internal predecessors, (6498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:30,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:30,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 1416 [2023-08-26 23:44:30,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:32,216 INFO L124 PetriNetUnfolderBase]: 8666/12444 cut-off events. [2023-08-26 23:44:32,216 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2023-08-26 23:44:32,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25289 conditions, 12444 events. 8666/12444 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 67172 event pairs, 7650 based on Foata normal form. 0/6733 useless extension candidates. Maximal degree in co-relation 25283. Up to 6209 conditions per place. [2023-08-26 23:44:32,257 INFO L140 encePairwiseOnDemand]: 1400/1416 looper letters, 134 selfloop transitions, 40 changer transitions 0/174 dead transitions. [2023-08-26 23:44:32,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 174 transitions, 958 flow [2023-08-26 23:44:32,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 23:44:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 23:44:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5628 transitions. [2023-08-26 23:44:32,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3613251155624037 [2023-08-26 23:44:32,264 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 5628 transitions. [2023-08-26 23:44:32,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 5628 transitions. [2023-08-26 23:44:32,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:32,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 5628 transitions. [2023-08-26 23:44:32,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 511.6363636363636) internal successors, (5628), 11 states have internal predecessors, (5628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:32,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 1416.0) internal successors, (16992), 12 states have internal predecessors, (16992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:32,285 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 1416.0) internal successors, (16992), 12 states have internal predecessors, (16992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:32,285 INFO L175 Difference]: Start difference. First operand has 75 places, 86 transitions, 312 flow. Second operand 11 states and 5628 transitions. [2023-08-26 23:44:32,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 174 transitions, 958 flow [2023-08-26 23:44:32,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 174 transitions, 928 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 23:44:32,289 INFO L231 Difference]: Finished difference. Result has 88 places, 112 transitions, 583 flow [2023-08-26 23:44:32,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=583, PETRI_PLACES=88, PETRI_TRANSITIONS=112} [2023-08-26 23:44:32,290 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 4 predicate places. [2023-08-26 23:44:32,290 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 112 transitions, 583 flow [2023-08-26 23:44:32,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 499.84615384615387) internal successors, (6498), 13 states have internal predecessors, (6498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:32,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:32,291 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:44:32,300 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-26 23:44:32,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:44:32,497 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:32,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash 52086648, now seen corresponding path program 1 times [2023-08-26 23:44:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:32,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025182038] [2023-08-26 23:44:32,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:32,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:32,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-26 23:44:32,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:32,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025182038] [2023-08-26 23:44:32,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025182038] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:44:32,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345943005] [2023-08-26 23:44:32,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:32,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:44:32,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:44:32,595 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-26 23:44:32,597 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-26 23:44:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:32,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-26 23:44:32,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:44:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 23:44:32,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:44:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 23:44:32,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345943005] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:44:32,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:44:32,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 17 [2023-08-26 23:44:32,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227346808] [2023-08-26 23:44:32,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:44:32,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-26 23:44:32,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:32,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-26 23:44:32,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-08-26 23:44:32,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 1416 [2023-08-26 23:44:32,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 112 transitions, 583 flow. Second operand has 18 states, 18 states have (on average 499.6111111111111) internal successors, (8993), 18 states have internal predecessors, (8993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:32,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:32,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 1416 [2023-08-26 23:44:32,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:35,120 INFO L124 PetriNetUnfolderBase]: 12989/18646 cut-off events. [2023-08-26 23:44:35,120 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2023-08-26 23:44:35,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37971 conditions, 18646 events. 12989/18646 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 106868 event pairs, 11475 based on Foata normal form. 17/10118 useless extension candidates. Maximal degree in co-relation 37960. Up to 12386 conditions per place. [2023-08-26 23:44:35,202 INFO L140 encePairwiseOnDemand]: 1402/1416 looper letters, 125 selfloop transitions, 56 changer transitions 0/181 dead transitions. [2023-08-26 23:44:35,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 181 transitions, 1198 flow [2023-08-26 23:44:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 23:44:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 23:44:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 7620 transitions. [2023-08-26 23:44:35,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3587570621468927 [2023-08-26 23:44:35,212 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 7620 transitions. [2023-08-26 23:44:35,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 7620 transitions. [2023-08-26 23:44:35,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:35,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 7620 transitions. [2023-08-26 23:44:35,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 508.0) internal successors, (7620), 15 states have internal predecessors, (7620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:35,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 1416.0) internal successors, (22656), 16 states have internal predecessors, (22656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:35,238 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 1416.0) internal successors, (22656), 16 states have internal predecessors, (22656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:35,238 INFO L175 Difference]: Start difference. First operand has 88 places, 112 transitions, 583 flow. Second operand 15 states and 7620 transitions. [2023-08-26 23:44:35,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 181 transitions, 1198 flow [2023-08-26 23:44:35,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 181 transitions, 1134 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-08-26 23:44:35,243 INFO L231 Difference]: Finished difference. Result has 98 places, 122 transitions, 725 flow [2023-08-26 23:44:35,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=725, PETRI_PLACES=98, PETRI_TRANSITIONS=122} [2023-08-26 23:44:35,243 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 14 predicate places. [2023-08-26 23:44:35,244 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 122 transitions, 725 flow [2023-08-26 23:44:35,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 499.6111111111111) internal successors, (8993), 18 states have internal predecessors, (8993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:35,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:35,245 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:44:35,251 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-26 23:44:35,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-26 23:44:35,451 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:35,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash 59916300, now seen corresponding path program 1 times [2023-08-26 23:44:35,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:35,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672877708] [2023-08-26 23:44:35,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:35,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 23:44:35,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:35,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672877708] [2023-08-26 23:44:35,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672877708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:35,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:44:35,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 23:44:35,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830109499] [2023-08-26 23:44:35,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:35,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 23:44:35,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:35,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 23:44:35,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 23:44:35,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 534 out of 1416 [2023-08-26 23:44:35,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 122 transitions, 725 flow. Second operand has 4 states, 4 states have (on average 536.5) internal successors, (2146), 4 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:35,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:35,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 534 of 1416 [2023-08-26 23:44:35,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:37,449 INFO L124 PetriNetUnfolderBase]: 12986/18643 cut-off events. [2023-08-26 23:44:37,450 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2023-08-26 23:44:37,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37988 conditions, 18643 events. 12986/18643 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 106866 event pairs, 11475 based on Foata normal form. 3/10104 useless extension candidates. Maximal degree in co-relation 37975. Up to 18631 conditions per place. [2023-08-26 23:44:37,546 INFO L140 encePairwiseOnDemand]: 1412/1416 looper letters, 103 selfloop transitions, 16 changer transitions 0/119 dead transitions. [2023-08-26 23:44:37,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 119 transitions, 938 flow [2023-08-26 23:44:37,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 23:44:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 23:44:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2194 transitions. [2023-08-26 23:44:37,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3873587570621469 [2023-08-26 23:44:37,550 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 2194 transitions. [2023-08-26 23:44:37,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 2194 transitions. [2023-08-26 23:44:37,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:37,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 2194 transitions. [2023-08-26 23:44:37,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 548.5) internal successors, (2194), 4 states have internal predecessors, (2194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:37,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1416.0) internal successors, (7080), 5 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:37,559 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1416.0) internal successors, (7080), 5 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:37,559 INFO L175 Difference]: Start difference. First operand has 98 places, 122 transitions, 725 flow. Second operand 4 states and 2194 transitions. [2023-08-26 23:44:37,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 119 transitions, 938 flow [2023-08-26 23:44:37,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 119 transitions, 912 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-26 23:44:37,563 INFO L231 Difference]: Finished difference. Result has 97 places, 119 transitions, 706 flow [2023-08-26 23:44:37,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=706, PETRI_PLACES=97, PETRI_TRANSITIONS=119} [2023-08-26 23:44:37,564 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 13 predicate places. [2023-08-26 23:44:37,564 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 119 transitions, 706 flow [2023-08-26 23:44:37,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 536.5) internal successors, (2146), 4 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:37,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:37,564 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:44:37,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 23:44:37,565 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:37,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:37,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1608082454, now seen corresponding path program 2 times [2023-08-26 23:44:37,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:37,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693656536] [2023-08-26 23:44:37,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:37,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-26 23:44:37,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:37,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693656536] [2023-08-26 23:44:37,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693656536] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:44:37,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616588705] [2023-08-26 23:44:37,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 23:44:37,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:44:37,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:44:37,648 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-26 23:44:37,674 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-26 23:44:37,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-26 23:44:37,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 23:44:37,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 23:44:37,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:44:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-26 23:44:37,811 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 23:44:37,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616588705] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:37,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 23:44:37,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-26 23:44:37,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519175627] [2023-08-26 23:44:37,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:37,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 23:44:37,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:37,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 23:44:37,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 23:44:37,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 1416 [2023-08-26 23:44:37,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 119 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 572.0) internal successors, (1716), 3 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:37,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:37,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 1416 [2023-08-26 23:44:37,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:39,543 INFO L124 PetriNetUnfolderBase]: 12986/18636 cut-off events. [2023-08-26 23:44:39,544 INFO L125 PetriNetUnfolderBase]: For 288/288 co-relation queries the response was YES. [2023-08-26 23:44:39,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37959 conditions, 18636 events. 12986/18636 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 106234 event pairs, 11475 based on Foata normal form. 0/10101 useless extension candidates. Maximal degree in co-relation 37947. Up to 18584 conditions per place. [2023-08-26 23:44:39,644 INFO L140 encePairwiseOnDemand]: 1412/1416 looper letters, 104 selfloop transitions, 12 changer transitions 0/116 dead transitions. [2023-08-26 23:44:39,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 116 transitions, 912 flow [2023-08-26 23:44:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 23:44:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 23:44:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2023-08-26 23:44:39,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4150188323917137 [2023-08-26 23:44:39,647 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2023-08-26 23:44:39,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2023-08-26 23:44:39,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:39,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2023-08-26 23:44:39,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:39,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:39,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1416.0) internal successors, (5664), 4 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:39,651 INFO L175 Difference]: Start difference. First operand has 97 places, 119 transitions, 706 flow. Second operand 3 states and 1763 transitions. [2023-08-26 23:44:39,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 116 transitions, 912 flow [2023-08-26 23:44:39,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 116 transitions, 893 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 23:44:39,655 INFO L231 Difference]: Finished difference. Result has 94 places, 116 transitions, 685 flow [2023-08-26 23:44:39,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=685, PETRI_PLACES=94, PETRI_TRANSITIONS=116} [2023-08-26 23:44:39,655 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 10 predicate places. [2023-08-26 23:44:39,655 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 116 transitions, 685 flow [2023-08-26 23:44:39,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 572.0) internal successors, (1716), 3 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:39,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:39,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:44:39,660 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-26 23:44:39,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:44:39,857 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:39,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:39,857 INFO L85 PathProgramCache]: Analyzing trace with hash 687451981, now seen corresponding path program 1 times [2023-08-26 23:44:39,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:39,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551241381] [2023-08-26 23:44:39,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:39,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 23:44:40,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:40,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551241381] [2023-08-26 23:44:40,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551241381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:40,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:44:40,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 23:44:40,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755712576] [2023-08-26 23:44:40,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:40,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 23:44:40,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:40,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 23:44:40,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 23:44:40,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 534 out of 1416 [2023-08-26 23:44:40,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 116 transitions, 685 flow. Second operand has 4 states, 4 states have (on average 538.25) internal successors, (2153), 4 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:40,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:40,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 534 of 1416 [2023-08-26 23:44:40,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:41,755 INFO L124 PetriNetUnfolderBase]: 12983/18633 cut-off events. [2023-08-26 23:44:41,755 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2023-08-26 23:44:41,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37957 conditions, 18633 events. 12983/18633 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 106156 event pairs, 11475 based on Foata normal form. 3/10101 useless extension candidates. Maximal degree in co-relation 37945. Up to 18628 conditions per place. [2023-08-26 23:44:41,812 INFO L140 encePairwiseOnDemand]: 1412/1416 looper letters, 106 selfloop transitions, 9 changer transitions 0/115 dead transitions. [2023-08-26 23:44:41,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 115 transitions, 911 flow [2023-08-26 23:44:41,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 23:44:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 23:44:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2191 transitions. [2023-08-26 23:44:41,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3868290960451977 [2023-08-26 23:44:41,815 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 2191 transitions. [2023-08-26 23:44:41,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 2191 transitions. [2023-08-26 23:44:41,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:41,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 2191 transitions. [2023-08-26 23:44:41,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 547.75) internal successors, (2191), 4 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:41,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1416.0) internal successors, (7080), 5 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:41,821 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1416.0) internal successors, (7080), 5 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:41,821 INFO L175 Difference]: Start difference. First operand has 94 places, 116 transitions, 685 flow. Second operand 4 states and 2191 transitions. [2023-08-26 23:44:41,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 115 transitions, 911 flow [2023-08-26 23:44:41,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 115 transitions, 864 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 23:44:41,825 INFO L231 Difference]: Finished difference. Result has 95 places, 115 transitions, 652 flow [2023-08-26 23:44:41,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=652, PETRI_PLACES=95, PETRI_TRANSITIONS=115} [2023-08-26 23:44:41,825 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 11 predicate places. [2023-08-26 23:44:41,825 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 115 transitions, 652 flow [2023-08-26 23:44:41,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 538.25) internal successors, (2153), 4 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:41,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:41,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:44:41,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 23:44:41,826 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:41,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:41,826 INFO L85 PathProgramCache]: Analyzing trace with hash 916432052, now seen corresponding path program 1 times [2023-08-26 23:44:41,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:41,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283120223] [2023-08-26 23:44:41,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:41,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-26 23:44:41,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:41,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283120223] [2023-08-26 23:44:41,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283120223] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:44:41,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:44:41,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 23:44:41,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160938719] [2023-08-26 23:44:41,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:44:41,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 23:44:41,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:44:41,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 23:44:41,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 23:44:41,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 534 out of 1416 [2023-08-26 23:44:41,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 115 transitions, 652 flow. Second operand has 4 states, 4 states have (on average 538.5) internal successors, (2154), 4 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:41,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:44:41,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 534 of 1416 [2023-08-26 23:44:41,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:44:43,718 INFO L124 PetriNetUnfolderBase]: 12980/18630 cut-off events. [2023-08-26 23:44:43,718 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2023-08-26 23:44:43,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37928 conditions, 18630 events. 12980/18630 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 106193 event pairs, 11475 based on Foata normal form. 3/10098 useless extension candidates. Maximal degree in co-relation 37916. Up to 18624 conditions per place. [2023-08-26 23:44:43,793 INFO L140 encePairwiseOnDemand]: 1412/1416 looper letters, 102 selfloop transitions, 10 changer transitions 0/112 dead transitions. [2023-08-26 23:44:43,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 112 transitions, 855 flow [2023-08-26 23:44:43,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 23:44:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 23:44:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2191 transitions. [2023-08-26 23:44:43,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3868290960451977 [2023-08-26 23:44:43,796 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 2191 transitions. [2023-08-26 23:44:43,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 2191 transitions. [2023-08-26 23:44:43,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:44:43,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 2191 transitions. [2023-08-26 23:44:43,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 547.75) internal successors, (2191), 4 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:43,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1416.0) internal successors, (7080), 5 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:43,801 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1416.0) internal successors, (7080), 5 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:43,801 INFO L175 Difference]: Start difference. First operand has 95 places, 115 transitions, 652 flow. Second operand 4 states and 2191 transitions. [2023-08-26 23:44:43,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 112 transitions, 855 flow [2023-08-26 23:44:43,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 112 transitions, 839 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-26 23:44:43,804 INFO L231 Difference]: Finished difference. Result has 96 places, 112 transitions, 635 flow [2023-08-26 23:44:43,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=635, PETRI_PLACES=96, PETRI_TRANSITIONS=112} [2023-08-26 23:44:43,804 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 12 predicate places. [2023-08-26 23:44:43,804 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 112 transitions, 635 flow [2023-08-26 23:44:43,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 538.5) internal successors, (2154), 4 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:44:43,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:44:43,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:44:43,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 23:44:43,805 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:44:43,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:44:43,805 INFO L85 PathProgramCache]: Analyzing trace with hash 2072725650, now seen corresponding path program 1 times [2023-08-26 23:44:43,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:44:43,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122692053] [2023-08-26 23:44:43,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:43,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:44:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 23:44:45,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:44:45,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122692053] [2023-08-26 23:44:45,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122692053] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:44:45,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854620593] [2023-08-26 23:44:45,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:44:45,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:44:45,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:44:45,010 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-26 23:44:45,024 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-26 23:44:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:44:45,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-26 23:44:45,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:44:45,285 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-26 23:44:45,324 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 11 treesize of output 7 [2023-08-26 23:44:45,396 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 23:44:45,396 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 23:44:45,449 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-26 23:44:45,494 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 23:44:45,495 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 23:44:45,566 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-26 23:44:45,656 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-26 23:44:45,657 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 16 treesize of output 18 [2023-08-26 23:44:45,702 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-26 23:44:45,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:44:45,752 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-26 23:44:45,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:44:45,813 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-26 23:44:45,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:44:45,863 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-26 23:44:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 23:44:45,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:44:45,957 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~get_8~0.base) (+ (* c_~id_6~0 4) c_~get_8~0.offset)) 9223372039002259456)) is different from false [2023-08-26 23:44:45,969 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~get_8~0.base) (+ (* c_~id_6~0 4) c_~get_8~0.offset)) 9223372039002259456)) is different from false [2023-08-26 23:44:46,383 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:44:46,384 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 41 treesize of output 42 [2023-08-26 23:44:46,410 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:44:46,411 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 155905 treesize of output 154881 [2023-08-26 23:44:46,550 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 1200 treesize of output 1104 [2023-08-26 23:44:46,587 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 549 treesize of output 537 [2023-08-26 23:44:46,621 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 1092 treesize of output 900 [2023-08-26 23:44:46,658 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 441 treesize of output 435 [2023-08-26 23:44:46,691 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 435 treesize of output 411 [2023-08-26 23:44:46,725 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 458 treesize of output 410 [2023-08-26 23:44:47,988 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-26 23:44:48,713 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:44:48,714 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 661 treesize of output 1158 [2023-08-26 23:45:31,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2023-08-26 23:45:31,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854620593] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:45:31,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:45:31,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 33 [2023-08-26 23:45:31,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149613870] [2023-08-26 23:45:31,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:45:31,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-26 23:45:31,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:45:31,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-26 23:45:31,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=829, Unknown=9, NotChecked=126, Total=1190 [2023-08-26 23:45:31,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 474 out of 1416 [2023-08-26 23:45:31,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 112 transitions, 635 flow. Second operand has 35 states, 35 states have (on average 475.51428571428573) internal successors, (16643), 35 states have internal predecessors, (16643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:45:31,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:45:31,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 474 of 1416 [2023-08-26 23:45:31,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:45:32,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:45:34,983 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-26 23:45:37,504 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-26 23:45:41,474 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_6~0 4) c_~get_8~0.offset)) (.cse1 (+ |c_#StackHeapBarrier| 1))) (and (<= 0 c_~id_6~0) (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_720) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~get_8~0.base) .cse0) 9223372039002259456)) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_170| Int) (v_ArrVal_720 (Array Int Int))) (or (< (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_719) |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_170| v_ArrVal_720) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~get_8~0.base) .cse0) 9223372039002259456) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_170|) 0)))) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2023-08-26 23:45:43,490 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-26 23:45:45,800 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-26 23:45:56,302 INFO L124 PetriNetUnfolderBase]: 48982/69640 cut-off events. [2023-08-26 23:45:56,303 INFO L125 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2023-08-26 23:45:56,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141727 conditions, 69640 events. 48982/69640 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 2475. Compared 474918 event pairs, 18519 based on Foata normal form. 0/38299 useless extension candidates. Maximal degree in co-relation 141715. Up to 17898 conditions per place. [2023-08-26 23:45:56,720 INFO L140 encePairwiseOnDemand]: 1393/1416 looper letters, 313 selfloop transitions, 80 changer transitions 0/393 dead transitions. [2023-08-26 23:45:56,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 393 transitions, 2486 flow [2023-08-26 23:45:56,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-26 23:45:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-26 23:45:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 10247 transitions. [2023-08-26 23:45:56,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34459913909066453 [2023-08-26 23:45:56,735 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 10247 transitions. [2023-08-26 23:45:56,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 10247 transitions. [2023-08-26 23:45:56,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:45:56,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 10247 transitions. [2023-08-26 23:45:56,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 487.95238095238096) internal successors, (10247), 21 states have internal predecessors, (10247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:45:56,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 1416.0) internal successors, (31152), 22 states have internal predecessors, (31152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:45:56,768 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 1416.0) internal successors, (31152), 22 states have internal predecessors, (31152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:45:56,768 INFO L175 Difference]: Start difference. First operand has 96 places, 112 transitions, 635 flow. Second operand 21 states and 10247 transitions. [2023-08-26 23:45:56,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 393 transitions, 2486 flow [2023-08-26 23:45:56,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 393 transitions, 2430 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-26 23:45:56,776 INFO L231 Difference]: Finished difference. Result has 130 places, 179 transitions, 1412 flow [2023-08-26 23:45:56,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1412, PETRI_PLACES=130, PETRI_TRANSITIONS=179} [2023-08-26 23:45:56,777 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 46 predicate places. [2023-08-26 23:45:56,777 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 179 transitions, 1412 flow [2023-08-26 23:45:56,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 475.51428571428573) internal successors, (16643), 35 states have internal predecessors, (16643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:45:56,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:45:56,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:45:56,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-26 23:45:56,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:45:56,985 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:45:56,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:45:56,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2072725664, now seen corresponding path program 1 times [2023-08-26 23:45:56,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:45:56,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860445322] [2023-08-26 23:45:56,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:45:56,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:45:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:45:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 23:45:58,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:45:58,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860445322] [2023-08-26 23:45:58,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860445322] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:45:58,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746887799] [2023-08-26 23:45:58,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:45:58,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:45:58,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:45:58,374 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-26 23:45:58,378 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-26 23:45:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:45:58,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-26 23:45:58,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:45:58,672 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-26 23:45:58,743 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 11 treesize of output 7 [2023-08-26 23:45:58,853 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 23:45:58,854 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 23:45:58,942 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 16 treesize of output 18 [2023-08-26 23:45:59,069 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 23:45:59,070 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 23:45:59,146 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 16 treesize of output 18 [2023-08-26 23:45:59,243 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-26 23:45:59,244 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 16 treesize of output 18 [2023-08-26 23:45:59,313 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 16 treesize of output 18 [2023-08-26 23:45:59,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:45:59,376 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 16 treesize of output 18 [2023-08-26 23:45:59,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:45:59,458 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 16 treesize of output 18 [2023-08-26 23:45:59,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:45:59,526 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 16 treesize of output 18 [2023-08-26 23:45:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 23:45:59,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:46:02,414 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:46:02,414 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 43 treesize of output 44 [2023-08-26 23:46:02,594 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:46:02,599 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 44105731 treesize of output 43843587 [2023-08-26 23:46:02,951 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 661 treesize of output 655 [2023-08-26 23:46:02,970 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 655 treesize of output 631 [2023-08-26 23:46:02,989 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 631 treesize of output 583 [2023-08-26 23:46:03,011 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 1250 treesize of output 1058 [2023-08-26 23:46:03,031 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 487 treesize of output 475 [2023-08-26 23:46:03,054 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 570 treesize of output 474 [2023-08-26 23:46:03,701 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-26 23:46:04,477 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:46:04,478 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 622 treesize of output 1119 [2023-08-26 23:47:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 23:47:28,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746887799] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:47:28,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:47:28,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2023-08-26 23:47:28,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152633634] [2023-08-26 23:47:28,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:47:28,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-26 23:47:28,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:47:28,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-26 23:47:28,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=868, Unknown=21, NotChecked=0, Total=1122 [2023-08-26 23:47:28,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 474 out of 1416 [2023-08-26 23:47:28,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 179 transitions, 1412 flow. Second operand has 34 states, 34 states have (on average 475.5) internal successors, (16167), 34 states have internal predecessors, (16167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:47:28,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:47:28,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 474 of 1416 [2023-08-26 23:47:28,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:47:32,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:47:37,953 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-26 23:47:43,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:47:45,634 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-26 23:47:47,648 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-26 23:47:49,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:47:51,757 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-26 23:47:53,771 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-26 23:47:55,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:47:57,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:47:59,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:48:10,194 INFO L124 PetriNetUnfolderBase]: 53512/76741 cut-off events. [2023-08-26 23:48:10,195 INFO L125 PetriNetUnfolderBase]: For 43996/43996 co-relation queries the response was YES. [2023-08-26 23:48:10,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212198 conditions, 76741 events. 53512/76741 cut-off events. For 43996/43996 co-relation queries the response was YES. Maximal size of possible extension queue 2743. Compared 539699 event pairs, 23415 based on Foata normal form. 0/51055 useless extension candidates. Maximal degree in co-relation 212171. Up to 38172 conditions per place. [2023-08-26 23:48:10,902 INFO L140 encePairwiseOnDemand]: 1391/1416 looper letters, 284 selfloop transitions, 78 changer transitions 0/362 dead transitions. [2023-08-26 23:48:10,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 362 transitions, 3001 flow [2023-08-26 23:48:10,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-26 23:48:10,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-26 23:48:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 9691 transitions. [2023-08-26 23:48:10,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3421963276836158 [2023-08-26 23:48:10,909 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 9691 transitions. [2023-08-26 23:48:10,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 9691 transitions. [2023-08-26 23:48:10,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:48:10,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 9691 transitions. [2023-08-26 23:48:10,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 484.55) internal successors, (9691), 20 states have internal predecessors, (9691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:48:10,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 1416.0) internal successors, (29736), 21 states have internal predecessors, (29736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:48:10,939 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 1416.0) internal successors, (29736), 21 states have internal predecessors, (29736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:48:10,939 INFO L175 Difference]: Start difference. First operand has 130 places, 179 transitions, 1412 flow. Second operand 20 states and 9691 transitions. [2023-08-26 23:48:10,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 362 transitions, 3001 flow [2023-08-26 23:48:11,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 362 transitions, 2974 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-08-26 23:48:11,033 INFO L231 Difference]: Finished difference. Result has 155 places, 211 transitions, 1886 flow [2023-08-26 23:48:11,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1886, PETRI_PLACES=155, PETRI_TRANSITIONS=211} [2023-08-26 23:48:11,033 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 71 predicate places. [2023-08-26 23:48:11,033 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 211 transitions, 1886 flow [2023-08-26 23:48:11,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 475.5) internal successors, (16167), 34 states have internal predecessors, (16167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:48:11,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:48:11,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:48:11,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-26 23:48:11,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:48:11,236 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:48:11,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:48:11,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2072725682, now seen corresponding path program 1 times [2023-08-26 23:48:11,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:48:11,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793549386] [2023-08-26 23:48:11,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:48:11,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:48:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:48:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:48:12,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:48:12,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793549386] [2023-08-26 23:48:12,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793549386] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:48:12,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128260251] [2023-08-26 23:48:12,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:48:12,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:48:12,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:48:12,665 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-26 23:48:12,670 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-26 23:48:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:48:12,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-26 23:48:12,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:48:12,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:48:12,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:48:12,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:48:12,941 INFO L322 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-26 23:48:12,942 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2023-08-26 23:48:13,037 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 11 treesize of output 7 [2023-08-26 23:48:13,152 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 23:48:13,152 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 23:48:13,227 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-26 23:48:13,323 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 23:48:13,323 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 23:48:13,419 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-26 23:48:13,568 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-26 23:48:13,569 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-26 23:48:13,660 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-26 23:48:13,722 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-26 23:48:13,722 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-26 23:48:13,769 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-26 23:48:13,831 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-26 23:48:13,831 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 16 treesize of output 18 [2023-08-26 23:48:13,884 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-26 23:48:13,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:48:13,922 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-26 23:48:13,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:48:13,986 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-26 23:48:14,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:48:14,028 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-26 23:48:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:48:14,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:48:14,135 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_920) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset)) 2147483648)) is different from false [2023-08-26 23:48:16,219 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_919 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_918) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_919) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_920) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset)) 2147483648)) is different from false [2023-08-26 23:48:17,302 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:48:17,303 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 41 treesize of output 42 [2023-08-26 23:48:17,323 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:48:17,324 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 9745 treesize of output 9681 [2023-08-26 23:48:17,366 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 1200 treesize of output 1104 [2023-08-26 23:48:17,383 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 1104 treesize of output 912 [2023-08-26 23:48:17,403 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 912 treesize of output 864 [2023-08-26 23:48:17,425 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 429 treesize of output 423 [2023-08-26 23:48:17,444 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 423 treesize of output 411 [2023-08-26 23:48:17,464 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 434 treesize of output 410 [2023-08-26 23:48:18,842 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-26 23:48:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-26 23:48:19,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128260251] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:48:19,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:48:19,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 13] total 34 [2023-08-26 23:48:19,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926954616] [2023-08-26 23:48:19,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:48:19,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-26 23:48:19,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:48:19,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-26 23:48:19,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=876, Unknown=17, NotChecked=130, Total=1260 [2023-08-26 23:48:19,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 1416 [2023-08-26 23:48:19,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 211 transitions, 1886 flow. Second operand has 36 states, 36 states have (on average 476.52777777777777) internal successors, (17155), 36 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:48:19,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:48:19,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 1416 [2023-08-26 23:48:19,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:48:23,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:48:27,422 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (forall ((v_ArrVal_920 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_177| Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_919 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (or (< (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_916) |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_177| v_ArrVal_917) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_918) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_919) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_920) c_~get_2~0.base) .cse0) 2147483648) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_177|) 0)))) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_919 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_918) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_919) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_920) c_~get_2~0.base) .cse0) 2147483648)))) is different from false [2023-08-26 23:48:31,107 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-26 23:48:33,133 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-26 23:48:35,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:48:37,198 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-26 23:48:39,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:48:41,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:48:43,320 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-26 23:48:45,335 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-26 23:48:47,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:48:59,588 INFO L124 PetriNetUnfolderBase]: 57617/82807 cut-off events. [2023-08-26 23:48:59,588 INFO L125 PetriNetUnfolderBase]: For 142780/142780 co-relation queries the response was YES. [2023-08-26 23:49:00,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271937 conditions, 82807 events. 57617/82807 cut-off events. For 142780/142780 co-relation queries the response was YES. Maximal size of possible extension queue 2980. Compared 583404 event pairs, 36416 based on Foata normal form. 0/60289 useless extension candidates. Maximal degree in co-relation 271902. Up to 44372 conditions per place. [2023-08-26 23:49:00,455 INFO L140 encePairwiseOnDemand]: 1387/1416 looper letters, 363 selfloop transitions, 99 changer transitions 0/462 dead transitions. [2023-08-26 23:49:00,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 462 transitions, 4458 flow [2023-08-26 23:49:00,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-26 23:49:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-26 23:49:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 10182 transitions. [2023-08-26 23:49:00,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3424132364810331 [2023-08-26 23:49:00,462 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 10182 transitions. [2023-08-26 23:49:00,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 10182 transitions. [2023-08-26 23:49:00,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:49:00,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 10182 transitions. [2023-08-26 23:49:00,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 484.85714285714283) internal successors, (10182), 21 states have internal predecessors, (10182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:49:00,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 1416.0) internal successors, (31152), 22 states have internal predecessors, (31152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:49:00,487 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 1416.0) internal successors, (31152), 22 states have internal predecessors, (31152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:49:00,487 INFO L175 Difference]: Start difference. First operand has 155 places, 211 transitions, 1886 flow. Second operand 21 states and 10182 transitions. [2023-08-26 23:49:00,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 462 transitions, 4458 flow [2023-08-26 23:49:00,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 462 transitions, 4342 flow, removed 11 selfloop flow, removed 9 redundant places. [2023-08-26 23:49:00,921 INFO L231 Difference]: Finished difference. Result has 181 places, 294 transitions, 2967 flow [2023-08-26 23:49:00,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=1814, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2967, PETRI_PLACES=181, PETRI_TRANSITIONS=294} [2023-08-26 23:49:00,921 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 97 predicate places. [2023-08-26 23:49:00,922 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 294 transitions, 2967 flow [2023-08-26 23:49:00,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 476.52777777777777) internal successors, (17155), 36 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:49:00,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:49:00,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:49:00,929 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-26 23:49:01,124 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,SelfDestructingSolverStorable23 [2023-08-26 23:49:01,125 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:49:01,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:49:01,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2072725683, now seen corresponding path program 1 times [2023-08-26 23:49:01,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:49:01,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136227767] [2023-08-26 23:49:01,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:49:01,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:49:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:49:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:49:03,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:49:03,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136227767] [2023-08-26 23:49:03,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136227767] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:49:03,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261010971] [2023-08-26 23:49:03,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:49:03,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:49:03,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:49:03,385 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-26 23:49:03,386 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-26 23:49:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:49:03,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 60 conjunts are in the unsatisfiable core [2023-08-26 23:49:03,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:49:03,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:49:03,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:49:03,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:49:03,644 INFO L322 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-26 23:49:03,644 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2023-08-26 23:49:03,734 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 11 treesize of output 7 [2023-08-26 23:49:03,846 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 23:49:03,846 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 23:49:04,010 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 16 treesize of output 18 [2023-08-26 23:49:04,127 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 23:49:04,127 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 23:49:04,257 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 16 treesize of output 18 [2023-08-26 23:49:04,423 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-26 23:49:04,423 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-26 23:49:04,522 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 23:49:04,600 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-26 23:49:04,601 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-26 23:49:04,724 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 23:49:04,978 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-26 23:49:04,978 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-26 23:49:05,038 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 16 treesize of output 18 [2023-08-26 23:49:05,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:49:05,119 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 16 treesize of output 18 [2023-08-26 23:49:05,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:49:05,199 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 16 treesize of output 18 [2023-08-26 23:49:05,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:49:05,269 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 16 treesize of output 18 [2023-08-26 23:49:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:49:05,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:49:05,368 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1022 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1022) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset))))) is different from false [2023-08-26 23:49:16,386 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:49:16,387 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 46 treesize of output 47 [2023-08-26 23:49:16,417 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:49:16,418 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 86083 treesize of output 85827 [2023-08-26 23:49:16,556 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 2672 treesize of output 2288 [2023-08-26 23:49:16,590 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 2288 treesize of output 2264 [2023-08-26 23:49:16,625 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 2264 treesize of output 2072 [2023-08-26 23:49:16,661 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 2072 treesize of output 1976 [2023-08-26 23:49:16,698 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 985 treesize of output 979 [2023-08-26 23:49:16,733 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 1970 treesize of output 1922 [2023-08-26 23:49:16,775 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 966 treesize of output 954 [2023-08-26 23:49:16,802 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-26 23:49:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:49:21,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261010971] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:49:21,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:49:21,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 41 [2023-08-26 23:49:21,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563974323] [2023-08-26 23:49:21,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:49:21,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-08-26 23:49:21,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:49:21,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-08-26 23:49:21,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1455, Unknown=27, NotChecked=80, Total=1806 [2023-08-26 23:49:21,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 1416 [2023-08-26 23:49:21,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 294 transitions, 2967 flow. Second operand has 43 states, 43 states have (on average 460.3255813953488) internal successors, (19794), 43 states have internal predecessors, (19794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:49:21,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:49:21,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 1416 [2023-08-26 23:49:21,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:49:29,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:49:37,576 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-26 23:49:43,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:49:49,267 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-26 23:49:51,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:49:53,900 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-26 23:49:56,643 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-26 23:49:56,800 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (forall ((v_ArrVal_1022 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1022) c_~get_2~0.base) .cse0)))) (forall ((v_ArrVal_1022 (Array Int Int)) (v_ArrVal_1021 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1022) c_~get_2~0.base) .cse0)))) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_181| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_181|) 0)) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1022 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_181| v_ArrVal_1019) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1022) c_~get_2~0.base) .cse0)))))))) is different from false [2023-08-26 23:50:06,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:50:08,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:50:11,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:50:15,196 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-26 23:50:17,760 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-26 23:50:21,211 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-26 23:50:26,383 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-26 23:50:28,450 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-26 23:50:30,526 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-26 23:50:32,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:50:37,498 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-26 23:50:39,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:50:41,892 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-26 23:50:44,727 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-26 23:50:46,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:50:48,811 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-26 23:50:50,848 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-26 23:50:52,936 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-26 23:50:55,166 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-26 23:50:57,183 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-26 23:50:59,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:51:01,534 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-26 23:51:03,556 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-26 23:51:05,558 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-26 23:51:07,601 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-26 23:51:09,734 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-26 23:51:11,788 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-26 23:51:13,843 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-26 23:51:15,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:51:18,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:51:20,409 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-26 23:51:22,458 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-26 23:51:24,485 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-26 23:51:26,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:51:28,570 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-26 23:51:30,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:51:32,717 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-26 23:51:34,748 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-26 23:51:36,750 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-26 23:51:53,550 INFO L124 PetriNetUnfolderBase]: 61228/88508 cut-off events. [2023-08-26 23:51:53,550 INFO L125 PetriNetUnfolderBase]: For 319919/319919 co-relation queries the response was YES. [2023-08-26 23:51:54,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355659 conditions, 88508 events. 61228/88508 cut-off events. For 319919/319919 co-relation queries the response was YES. Maximal size of possible extension queue 3222. Compared 639273 event pairs, 35596 based on Foata normal form. 3222/70597 useless extension candidates. Maximal degree in co-relation 355610. Up to 43908 conditions per place. [2023-08-26 23:51:54,899 INFO L140 encePairwiseOnDemand]: 1387/1416 looper letters, 376 selfloop transitions, 155 changer transitions 0/531 dead transitions. [2023-08-26 23:51:54,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 531 transitions, 5775 flow [2023-08-26 23:51:54,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-26 23:51:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-26 23:51:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 12168 transitions. [2023-08-26 23:51:54,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3305084745762712 [2023-08-26 23:51:54,910 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 12168 transitions. [2023-08-26 23:51:54,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 12168 transitions. [2023-08-26 23:51:54,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:51:54,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 12168 transitions. [2023-08-26 23:51:54,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 468.0) internal successors, (12168), 26 states have internal predecessors, (12168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:51:54,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 1416.0) internal successors, (38232), 27 states have internal predecessors, (38232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:51:54,954 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 1416.0) internal successors, (38232), 27 states have internal predecessors, (38232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:51:54,954 INFO L175 Difference]: Start difference. First operand has 181 places, 294 transitions, 2967 flow. Second operand 26 states and 12168 transitions. [2023-08-26 23:51:54,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 531 transitions, 5775 flow [2023-08-26 23:51:55,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 531 transitions, 5706 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-08-26 23:51:55,990 INFO L231 Difference]: Finished difference. Result has 215 places, 339 transitions, 3935 flow [2023-08-26 23:51:55,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=2832, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3935, PETRI_PLACES=215, PETRI_TRANSITIONS=339} [2023-08-26 23:51:55,990 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 131 predicate places. [2023-08-26 23:51:55,991 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 339 transitions, 3935 flow [2023-08-26 23:51:55,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 460.3255813953488) internal successors, (19794), 43 states have internal predecessors, (19794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:51:55,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:51:55,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:51:56,000 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-26 23:51:56,193 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,SelfDestructingSolverStorable24 [2023-08-26 23:51:56,193 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:51:56,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:51:56,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1875935544, now seen corresponding path program 1 times [2023-08-26 23:51:56,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:51:56,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579771462] [2023-08-26 23:51:56,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:51:56,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:51:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:51:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:51:59,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:51:59,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579771462] [2023-08-26 23:51:59,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579771462] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:51:59,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895610543] [2023-08-26 23:51:59,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:51:59,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:51:59,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:51:59,110 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-26 23:51:59,111 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-26 23:51:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:51:59,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-26 23:51:59,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:51:59,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:51:59,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:51:59,595 INFO L322 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2023-08-26 23:51:59,595 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 3 case distinctions, treesize of input 15 treesize of output 36 [2023-08-26 23:51:59,845 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 11 treesize of output 7 [2023-08-26 23:52:00,177 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 23:52:00,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 23:52:00,421 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 16 treesize of output 18 [2023-08-26 23:52:00,589 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 23:52:00,589 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 23:52:00,854 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 16 treesize of output 18 [2023-08-26 23:52:01,278 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-26 23:52:01,279 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-26 23:52:01,566 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 23:52:01,859 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-26 23:52:01,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-26 23:52:02,153 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 23:52:02,669 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-26 23:52:02,670 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-26 23:52:02,912 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 16 treesize of output 18 [2023-08-26 23:52:03,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:52:03,215 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 16 treesize of output 18 [2023-08-26 23:52:03,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:52:03,725 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 16 treesize of output 18 [2023-08-26 23:52:03,826 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 17 treesize of output 9 [2023-08-26 23:52:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 23:52:03,836 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:52:04,025 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1119) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset))))) is different from false [2023-08-26 23:52:08,828 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:52:08,828 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 46 treesize of output 47 [2023-08-26 23:52:09,216 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:52:09,224 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 176291843 treesize of output 175767555 [2023-08-26 23:52:10,432 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 1333 treesize of output 1321 [2023-08-26 23:52:10,477 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 1321 treesize of output 1315 [2023-08-26 23:52:10,518 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 2654 treesize of output 2462 [2023-08-26 23:52:10,564 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 2462 treesize of output 2366 [2023-08-26 23:52:10,606 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 2366 treesize of output 2318 [2023-08-26 23:52:10,647 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 2318 treesize of output 1934 [2023-08-26 23:52:10,693 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 978 treesize of output 954 [2023-08-26 23:52:10,721 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-26 23:52:53,356 WARN L234 SmtUtils]: Spent 36.21s on a formula simplification. DAG size of input: 133 DAG size of output: 118 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 23:52:53,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:52:53,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895610543] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:52:53,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:52:53,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 15] total 35 [2023-08-26 23:52:53,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683013856] [2023-08-26 23:52:53,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:52:53,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-26 23:52:53,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:52:53,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-26 23:52:53,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=994, Unknown=22, NotChecked=68, Total=1332 [2023-08-26 23:52:53,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 474 out of 1416 [2023-08-26 23:52:53,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 339 transitions, 3935 flow. Second operand has 37 states, 37 states have (on average 475.6216216216216) internal successors, (17598), 37 states have internal predecessors, (17598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:52:53,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:52:53,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 474 of 1416 [2023-08-26 23:52:53,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:53:00,429 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-26 23:53:04,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:53:06,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:53:09,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:53:17,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:53:19,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:53:24,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:53:27,823 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-26 23:53:30,157 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-26 23:53:32,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 23:53:32,994 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1117 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1119) c_~get_2~0.base) .cse0)))) (forall ((v_ArrVal_1119 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_185| Int) (v_ArrVal_1118 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_186| Int) (v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1114 (Array Int Int))) (or (< 0 (+ 2147483649 (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_1114) |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_186| v_ArrVal_1116) |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_185| v_ArrVal_1117) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1119) c_~get_2~0.base) .cse0))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_186|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_186| 1) |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_185|) 0)))) (forall ((v_ArrVal_1119 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_185| Int) (v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1116 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_185|) 0)) (< 0 (+ 2147483649 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_1116) |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_185| v_ArrVal_1117) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1119) c_~get_2~0.base) .cse0))))) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_185| Int)) (or (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1117 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_185| v_ArrVal_1117) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1119) c_~get_2~0.base) .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_185|) 0)))))) is different from false [2023-08-26 23:53:58,506 INFO L124 PetriNetUnfolderBase]: 65655/94819 cut-off events. [2023-08-26 23:53:58,506 INFO L125 PetriNetUnfolderBase]: For 414935/414935 co-relation queries the response was YES. [2023-08-26 23:53:59,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418686 conditions, 94819 events. 65655/94819 cut-off events. For 414935/414935 co-relation queries the response was YES. Maximal size of possible extension queue 3444. Compared 691261 event pairs, 31570 based on Foata normal form. 0/71150 useless extension candidates. Maximal degree in co-relation 418624. Up to 72136 conditions per place. [2023-08-26 23:54:00,030 INFO L140 encePairwiseOnDemand]: 1395/1416 looper letters, 518 selfloop transitions, 133 changer transitions 0/651 dead transitions. [2023-08-26 23:54:00,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 651 transitions, 8196 flow [2023-08-26 23:54:00,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-26 23:54:00,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-26 23:54:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 11590 transitions. [2023-08-26 23:54:00,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3410428436911488 [2023-08-26 23:54:00,041 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 11590 transitions. [2023-08-26 23:54:00,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 11590 transitions. [2023-08-26 23:54:00,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:54:00,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 11590 transitions. [2023-08-26 23:54:00,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 482.9166666666667) internal successors, (11590), 24 states have internal predecessors, (11590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:54:00,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 1416.0) internal successors, (35400), 25 states have internal predecessors, (35400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:54:00,084 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 1416.0) internal successors, (35400), 25 states have internal predecessors, (35400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:54:00,084 INFO L175 Difference]: Start difference. First operand has 215 places, 339 transitions, 3935 flow. Second operand 24 states and 11590 transitions. [2023-08-26 23:54:00,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 651 transitions, 8196 flow [2023-08-26 23:54:02,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 651 transitions, 7996 flow, removed 64 selfloop flow, removed 8 redundant places. [2023-08-26 23:54:02,423 INFO L231 Difference]: Finished difference. Result has 240 places, 416 transitions, 5344 flow [2023-08-26 23:54:02,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1416, PETRI_DIFFERENCE_MINUEND_FLOW=3780, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=5344, PETRI_PLACES=240, PETRI_TRANSITIONS=416} [2023-08-26 23:54:02,423 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 156 predicate places. [2023-08-26 23:54:02,423 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 416 transitions, 5344 flow [2023-08-26 23:54:02,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 475.6216216216216) internal successors, (17598), 37 states have internal predecessors, (17598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:54:02,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:54:02,425 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-26 23:54:02,430 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-26 23:54:02,625 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,SelfDestructingSolverStorable25 [2023-08-26 23:54:02,626 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2023-08-26 23:54:02,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:54:02,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1307431764, now seen corresponding path program 1 times [2023-08-26 23:54:02,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:54:02,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289044926] [2023-08-26 23:54:02,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:54:02,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:54:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:54:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:54:05,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:54:05,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289044926] [2023-08-26 23:54:05,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289044926] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:54:05,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661653346] [2023-08-26 23:54:05,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:54:05,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:54:05,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:54:05,610 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-26 23:54:05,611 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-26 23:54:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:54:05,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 55 conjunts are in the unsatisfiable core [2023-08-26 23:54:05,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:54:05,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:54:06,150 INFO L322 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2023-08-26 23:54:06,151 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 39 [2023-08-26 23:54:06,397 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 11 treesize of output 7 [2023-08-26 23:54:06,722 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 23:54:06,722 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 23:54:06,963 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-26 23:54:07,292 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 23:54:07,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 23:54:07,430 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-26 23:54:07,551 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 23:54:07,551 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 23:54:07,854 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-26 23:54:08,250 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-26 23:54:08,250 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-26 23:54:08,615 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-26 23:54:09,089 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-26 23:54:09,089 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-26 23:54:09,344 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-26 23:54:09,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 23:54:09,561 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-26 23:54:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:54:10,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:54:11,263 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (forall ((~get_5~0.offset Int) (v_ArrVal_1211 (Array Int Int)) (~id_3~0 Int) (~get_5~0.base Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1211))) (let ((.cse2 (select (select .cse0 ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)))) (or (< (select (select .cse0 c_~get_2~0.base) .cse1) (+ .cse2 2147483648)) (< 0 .cse2) (< .cse2 0))))) (forall ((~get_5~0.offset Int) (v_ArrVal_1211 (Array Int Int)) (~id_3~0 Int) (~get_5~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1211))) (let ((.cse3 (select (select .cse4 ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)))) (or (< 9223372039002259455 .cse3) (< (select (select .cse4 c_~get_2~0.base) .cse1) (+ .cse3 2147483648)) (<= .cse3 0))))))) is different from false [2023-08-26 23:54:11,353 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (forall ((~get_5~0.offset Int) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1210 (Array Int Int)) (~id_3~0 Int) (~get_5~0.base Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_1210) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1211))) (let ((.cse2 (select (select .cse0 ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)))) (or (< (select (select .cse0 c_~get_2~0.base) .cse1) (+ .cse2 2147483648)) (< 0 .cse2) (< .cse2 0))))) (forall ((~get_5~0.offset Int) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1210 (Array Int Int)) (~id_3~0 Int) (~get_5~0.base Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_1210) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1211))) (let ((.cse4 (select (select .cse3 ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)))) (or (< (select (select .cse3 c_~get_2~0.base) .cse1) (+ .cse4 2147483648)) (<= .cse4 0) (< 9223372039002259455 .cse4))))))) is different from false [2023-08-26 23:54:30,341 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:54:30,342 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 449 treesize of output 366 [2023-08-26 23:54:31,746 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:54:31,763 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 3660810069 treesize of output 3626992500 [2023-08-26 23:55:00,368 WARN L234 SmtUtils]: Spent 28.58s on a formula simplification. DAG size of input: 13463 DAG size of output: 1449 (called from [L 729] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-08-26 23:55:00,489 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:55:00,491 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 224545 treesize of output 221442 [2023-08-26 23:55:03,114 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:55:03,116 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 221425 treesize of output 220662 [2023-08-26 23:55:05,713 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:55:05,715 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 220645 treesize of output 219102 [2023-08-26 23:55:08,368 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:55:08,369 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 219085 treesize of output 194142 [2023-08-26 23:55:11,031 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:55:11,032 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 194125 treesize of output 181662 [2023-08-26 23:55:13,690 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:55:13,692 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 181645 treesize of output 175422 [2023-08-26 23:55:16,352 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:55:16,354 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 175405 treesize of output 172302 [2023-08-26 23:55:19,118 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-26 23:55:19,228 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:55:19,229 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 172285 treesize of output 170742 [2023-08-26 23:55:21,950 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:55:21,951 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 170725 treesize of output 158262 [2023-08-26 23:55:24,715 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:55:24,717 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 158245 treesize of output 157482 [2023-08-26 23:55:27,442 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:55:27,444 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 157465 treesize of output 151242 [2023-08-26 23:55:30,211 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 23:55:30,212 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 151225 treesize of output 126282 Received shutdown request... [2023-08-26 23:57:14,135 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-26 23:57:14,137 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 64 remaining) [2023-08-26 23:57:14,143 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-26 23:57:14,171 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 23:57:14,173 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-26 23:57:14,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-26 23:57:14,338 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. [2023-08-26 23:57:14,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 64 remaining) [2023-08-26 23:57:14,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 64 remaining) [2023-08-26 23:57:14,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 64 remaining) [2023-08-26 23:57:14,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 64 remaining) [2023-08-26 23:57:14,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 64 remaining) [2023-08-26 23:57:14,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 64 remaining) [2023-08-26 23:57:14,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 64 remaining) [2023-08-26 23:57:14,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 64 remaining) [2023-08-26 23:57:14,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 64 remaining) [2023-08-26 23:57:14,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 64 remaining) [2023-08-26 23:57:14,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 64 remaining) [2023-08-26 23:57:14,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 64 remaining) [2023-08-26 23:57:14,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 64 remaining) [2023-08-26 23:57:14,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 64 remaining) [2023-08-26 23:57:14,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 64 remaining) [2023-08-26 23:57:14,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 64 remaining) [2023-08-26 23:57:14,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 64 remaining) [2023-08-26 23:57:14,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 64 remaining) [2023-08-26 23:57:14,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 64 remaining) [2023-08-26 23:57:14,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 64 remaining) [2023-08-26 23:57:14,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 64 remaining) [2023-08-26 23:57:14,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 64 remaining) [2023-08-26 23:57:14,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 64 remaining) [2023-08-26 23:57:14,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 64 remaining) [2023-08-26 23:57:14,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 64 remaining) [2023-08-26 23:57:14,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 64 remaining) [2023-08-26 23:57:14,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 64 remaining) [2023-08-26 23:57:14,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 64 remaining) [2023-08-26 23:57:14,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 64 remaining) [2023-08-26 23:57:14,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24ASSERT_VIOLATIONASSERT (20 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 64 remaining) [2023-08-26 23:57:14,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 64 remaining) [2023-08-26 23:57:14,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 64 remaining) [2023-08-26 23:57:14,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 64 remaining) [2023-08-26 23:57:14,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 64 remaining) [2023-08-26 23:57:14,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 64 remaining) [2023-08-26 23:57:14,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 64 remaining) [2023-08-26 23:57:14,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 64 remaining) [2023-08-26 23:57:14,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 64 remaining) [2023-08-26 23:57:14,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 64 remaining) [2023-08-26 23:57:14,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 64 remaining) [2023-08-26 23:57:14,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 64 remaining) [2023-08-26 23:57:14,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 64 remaining) [2023-08-26 23:57:14,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 64 remaining) [2023-08-26 23:57:14,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 64 remaining) [2023-08-26 23:57:14,344 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 64 remaining) [2023-08-26 23:57:14,344 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 64 remaining) [2023-08-26 23:57:14,344 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 64 remaining) [2023-08-26 23:57:14,344 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:57:14,352 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 23:57:14,352 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 23:57:14,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 11:57:14 BasicIcfg [2023-08-26 23:57:14,355 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 23:57:14,355 INFO L158 Benchmark]: Toolchain (without parser) took 806226.57ms. Allocated memory was 362.8MB in the beginning and 12.1GB in the end (delta: 11.8GB). Free memory was 338.9MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 10.9GB. Max. memory is 16.0GB. [2023-08-26 23:57:14,355 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 362.8MB. Free memory is still 339.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 23:57:14,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.06ms. Allocated memory is still 362.8MB. Free memory was 338.6MB in the beginning and 325.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-26 23:57:14,356 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.15ms. Allocated memory is still 362.8MB. Free memory was 325.7MB in the beginning and 322.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 23:57:14,356 INFO L158 Benchmark]: Boogie Preprocessor took 37.09ms. Allocated memory is still 362.8MB. Free memory was 322.1MB in the beginning and 319.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 23:57:14,358 INFO L158 Benchmark]: RCFGBuilder took 927.49ms. Allocated memory is still 362.8MB. Free memory was 319.4MB in the beginning and 328.2MB in the end (delta: -8.8MB). Peak memory consumption was 36.3MB. Max. memory is 16.0GB. [2023-08-26 23:57:14,358 INFO L158 Benchmark]: TraceAbstraction took 804856.62ms. Allocated memory was 362.8MB in the beginning and 12.1GB in the end (delta: 11.8GB). Free memory was 328.2MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 10.9GB. Max. memory is 16.0GB. [2023-08-26 23:57:14,358 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 362.8MB. Free memory is still 339.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 319.06ms. Allocated memory is still 362.8MB. Free memory was 338.6MB in the beginning and 325.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 80.15ms. Allocated memory is still 362.8MB. Free memory was 325.7MB in the beginning and 322.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.09ms. Allocated memory is still 362.8MB. Free memory was 322.1MB in the beginning and 319.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 927.49ms. Allocated memory is still 362.8MB. Free memory was 319.4MB in the beginning and 328.2MB in the end (delta: -8.8MB). Peak memory consumption was 36.3MB. Max. memory is 16.0GB. * TraceAbstraction took 804856.62ms. Allocated memory was 362.8MB in the beginning and 12.1GB in the end (delta: 11.8GB). Free memory was 328.2MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 10.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.1s, 572 PlacesBefore, 84 PlacesAfterwards, 609 TransitionsBefore, 83 TransitionsAfterwards, 34440 CoEnabledTransitionPairs, 11 FixpointIterations, 381 TrivialSequentialCompositions, 250 ConcurrentSequentialCompositions, 74 TrivialYvCompositions, 50 ConcurrentYvCompositions, 38 ChoiceCompositions, 793 TotalNumberOfCompositions, 46663 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37582, independent: 37198, independent conditional: 0, independent unconditional: 37198, dependent: 384, dependent conditional: 0, dependent unconditional: 384, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 20238, independent: 20175, independent conditional: 0, independent unconditional: 20175, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 37582, independent: 17023, independent conditional: 0, independent unconditional: 17023, dependent: 321, dependent conditional: 0, dependent unconditional: 321, unknown: 20238, unknown conditional: 0, unknown unconditional: 20238] , Statistics on independence cache: Total cache size (in pairs): 426, Positive cache size: 403, Positive conditional cache size: 0, Positive unconditional cache size: 403, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 137]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 137]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 137]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 137]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 137]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 137]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 130]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 130]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 130]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 130]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 130]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 130]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - 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 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - TimeoutResultAtElement [Line: 103]: 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 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - 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 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 30ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 775 locations, 64 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: 804.7s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 356.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 27.3s, HoareTripleCheckerStatistics: 1359 mSolverCounterUnknown, 3118 SdHoareTripleChecker+Valid, 233.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3118 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 228.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2502 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 518 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9644 IncrementalHoareTripleChecker+Invalid, 14023 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 518 mSolverCounterUnsat, 0 mSDtfsCounter, 9644 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1359 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 108 SyntacticMatches, 16 SemanticMatches, 316 ConstructedPredicates, 10 IntricatePredicates, 2 DeprecatedPredicates, 3563 ImplicationChecksByTransitivity, 99.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5344occurred in iteration=26, InterpolantAutomatonStates: 202, 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.0s SatisfiabilityAnalysisTime, 224.0s InterpolantComputationTime, 373 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 449 ConstructedInterpolants, 91 QuantifiedInterpolants, 10500 SizeOfPredicates, 90 NumberOfNonLiveVariables, 3118 ConjunctsInSsa, 324 ConjunctsInUnsatCore, 44 InterpolantComputations, 18 PerfectInterpolantSequences, 90/194 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