/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 00:39:08,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 00:39:08,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 00:39:08,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 00:39:08,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 00:39:08,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 00:39:08,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 00:39:08,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 00:39:08,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 00:39:08,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 00:39:08,299 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 00:39:08,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 00:39:08,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 00:39:08,300 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 00:39:08,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 00:39:08,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 00:39:08,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 00:39:08,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 00:39:08,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 00:39:08,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 00:39:08,301 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 00:39:08,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 00:39:08,302 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 00:39:08,302 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 00:39:08,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 00:39:08,303 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 00:39:08,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 00:39:08,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 00:39:08,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 00:39:08,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 00:39:08,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 00:39:08,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 00:39:08,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 00:39:08,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 00:39:08,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 00:39:08,305 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 00:39:08,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 00:39:08,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 00:39:08,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 00:39:08,559 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 00:39:08,559 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 00:39:08,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2023-08-27 00:39:09,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 00:39:09,685 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 00:39:09,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2023-08-27 00:39:09,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de398c4b9/6afeddbb43cd4b6689fa28556c62f90d/FLAG049741e55 [2023-08-27 00:39:09,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de398c4b9/6afeddbb43cd4b6689fa28556c62f90d [2023-08-27 00:39:09,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 00:39:09,701 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 00:39:09,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 00:39:09,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 00:39:09,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 00:39:09,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 12:39:09" (1/1) ... [2023-08-27 00:39:09,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e065aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:39:09, skipping insertion in model container [2023-08-27 00:39:09,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 12:39:09" (1/1) ... [2023-08-27 00:39:09,718 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 00:39:09,861 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 00:39:09,867 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 00:39:09,899 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 00:39:09,910 INFO L206 MainTranslator]: Completed translation [2023-08-27 00:39:09,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:39:09 WrapperNode [2023-08-27 00:39:09,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 00:39:09,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 00:39:09,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 00:39:09,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 00:39:09,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:39:09" (1/1) ... [2023-08-27 00:39:09,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:39:09" (1/1) ... [2023-08-27 00:39:09,966 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 365 [2023-08-27 00:39:09,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 00:39:09,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 00:39:09,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 00:39:09,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 00:39:09,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:39:09" (1/1) ... [2023-08-27 00:39:09,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:39:09" (1/1) ... [2023-08-27 00:39:09,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:39:09" (1/1) ... [2023-08-27 00:39:09,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:39:09" (1/1) ... [2023-08-27 00:39:09,998 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:39:09" (1/1) ... [2023-08-27 00:39:10,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:39:09" (1/1) ... [2023-08-27 00:39:10,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:39:09" (1/1) ... [2023-08-27 00:39:10,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:39:09" (1/1) ... [2023-08-27 00:39:10,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 00:39:10,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 00:39:10,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 00:39:10,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 00:39:10,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:39:09" (1/1) ... [2023-08-27 00:39:10,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 00:39:10,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:39:10,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 00:39:10,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 00:39:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 00:39:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 00:39:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 00:39:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 00:39:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-27 00:39:10,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-27 00:39:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-27 00:39:10,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-27 00:39:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-27 00:39:10,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-27 00:39:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 00:39:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-27 00:39:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 00:39:10,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 00:39:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 00:39:10,076 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 00:39:10,185 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 00:39:10,186 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 00:39:10,602 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 00:39:10,614 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 00:39:10,614 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-27 00:39:10,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 12:39:10 BoogieIcfgContainer [2023-08-27 00:39:10,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 00:39:10,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 00:39:10,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 00:39:10,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 00:39:10,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 12:39:09" (1/3) ... [2023-08-27 00:39:10,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc755b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 12:39:10, skipping insertion in model container [2023-08-27 00:39:10,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:39:09" (2/3) ... [2023-08-27 00:39:10,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc755b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 12:39:10, skipping insertion in model container [2023-08-27 00:39:10,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 12:39:10" (3/3) ... [2023-08-27 00:39:10,621 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2023-08-27 00:39:10,632 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 00:39:10,632 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2023-08-27 00:39:10,633 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 00:39:10,716 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-27 00:39:10,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 434 places, 463 transitions, 950 flow [2023-08-27 00:39:10,882 INFO L124 PetriNetUnfolderBase]: 39/460 cut-off events. [2023-08-27 00:39:10,882 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-27 00:39:10,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 460 events. 39/460 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 996 event pairs, 0 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 282. Up to 2 conditions per place. [2023-08-27 00:39:10,890 INFO L82 GeneralOperation]: Start removeDead. Operand has 434 places, 463 transitions, 950 flow [2023-08-27 00:39:10,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 420 places, 449 transitions, 916 flow [2023-08-27 00:39:10,900 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 00:39:10,907 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 420 places, 449 transitions, 916 flow [2023-08-27 00:39:10,909 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 420 places, 449 transitions, 916 flow [2023-08-27 00:39:10,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 420 places, 449 transitions, 916 flow [2023-08-27 00:39:10,967 INFO L124 PetriNetUnfolderBase]: 39/449 cut-off events. [2023-08-27 00:39:10,968 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-27 00:39:10,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 449 events. 39/449 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 970 event pairs, 0 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 282. Up to 2 conditions per place. [2023-08-27 00:39:10,984 INFO L119 LiptonReduction]: Number of co-enabled transitions 38304 [2023-08-27 00:39:38,818 INFO L134 LiptonReduction]: Checked pairs total: 41122 [2023-08-27 00:39:38,818 INFO L136 LiptonReduction]: Total number of compositions: 611 [2023-08-27 00:39:38,827 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 00:39:38,831 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;@6d4e4163, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 00:39:38,831 INFO L358 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2023-08-27 00:39:38,832 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 00:39:38,833 INFO L124 PetriNetUnfolderBase]: 1/2 cut-off events. [2023-08-27 00:39:38,833 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 00:39:38,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:39:38,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-27 00:39:38,833 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:39:38,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:39:38,836 INFO L85 PathProgramCache]: Analyzing trace with hash 61998, now seen corresponding path program 1 times [2023-08-27 00:39:38,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:39:38,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220532104] [2023-08-27 00:39:38,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:39:38,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:39:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:39:39,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:39:39,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:39:39,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220532104] [2023-08-27 00:39:39,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220532104] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:39:39,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:39:39,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 00:39:39,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137411247] [2023-08-27 00:39:39,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:39:39,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 00:39:39,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:39:39,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 00:39:39,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 00:39:39,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 1074 [2023-08-27 00:39:39,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:39,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:39:39,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 1074 [2023-08-27 00:39:39,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:39:40,868 INFO L124 PetriNetUnfolderBase]: 9052/11253 cut-off events. [2023-08-27 00:39:40,869 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2023-08-27 00:39:40,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22723 conditions, 11253 events. 9052/11253 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 1340. Compared 52619 event pairs, 4353 based on Foata normal form. 0/2389 useless extension candidates. Maximal degree in co-relation 20609. Up to 11168 conditions per place. [2023-08-27 00:39:40,920 INFO L140 encePairwiseOnDemand]: 1049/1074 looper letters, 54 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2023-08-27 00:39:40,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 268 flow [2023-08-27 00:39:40,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 00:39:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 00:39:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1306 transitions. [2023-08-27 00:39:40,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053382991930478 [2023-08-27 00:39:40,932 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1306 transitions. [2023-08-27 00:39:40,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1306 transitions. [2023-08-27 00:39:40,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:39:40,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1306 transitions. [2023-08-27 00:39:40,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 435.3333333333333) internal successors, (1306), 3 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:40,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:40,947 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:40,948 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 158 flow. Second operand 3 states and 1306 transitions. [2023-08-27 00:39:40,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 268 flow [2023-08-27 00:39:40,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 64 transitions, 256 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-27 00:39:40,978 INFO L231 Difference]: Finished difference. Result has 60 places, 64 transitions, 186 flow [2023-08-27 00:39:40,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=60, PETRI_TRANSITIONS=64} [2023-08-27 00:39:40,982 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -14 predicate places. [2023-08-27 00:39:40,982 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 64 transitions, 186 flow [2023-08-27 00:39:40,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:40,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:39:40,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 00:39:40,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 00:39:40,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:39:40,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:39:40,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1924664, now seen corresponding path program 1 times [2023-08-27 00:39:40,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:39:40,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191403377] [2023-08-27 00:39:40,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:39:40,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:39:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:39:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:39:41,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:39:41,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191403377] [2023-08-27 00:39:41,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191403377] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:39:41,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:39:41,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 00:39:41,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178692138] [2023-08-27 00:39:41,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:39:41,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 00:39:41,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:39:41,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 00:39:41,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 00:39:41,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 1074 [2023-08-27 00:39:41,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 64 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:41,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:39:41,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 1074 [2023-08-27 00:39:41,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:39:42,696 INFO L124 PetriNetUnfolderBase]: 9052/11250 cut-off events. [2023-08-27 00:39:42,696 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-27 00:39:42,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22537 conditions, 11250 events. 9052/11250 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 1340. Compared 52409 event pairs, 4353 based on Foata normal form. 0/2393 useless extension candidates. Maximal degree in co-relation 22478. Up to 11156 conditions per place. [2023-08-27 00:39:42,732 INFO L140 encePairwiseOnDemand]: 1069/1074 looper letters, 55 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2023-08-27 00:39:42,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 290 flow [2023-08-27 00:39:42,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 00:39:42,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 00:39:42,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2023-08-27 00:39:42,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978895096213532 [2023-08-27 00:39:42,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2023-08-27 00:39:42,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2023-08-27 00:39:42,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:39:42,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2023-08-27 00:39:42,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:42,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:42,743 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:42,743 INFO L175 Difference]: Start difference. First operand has 60 places, 64 transitions, 186 flow. Second operand 3 states and 1282 transitions. [2023-08-27 00:39:42,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 290 flow [2023-08-27 00:39:42,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 00:39:42,745 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 166 flow [2023-08-27 00:39:42,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2023-08-27 00:39:42,746 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -17 predicate places. [2023-08-27 00:39:42,746 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 166 flow [2023-08-27 00:39:42,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:42,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:39:42,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 00:39:42,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 00:39:42,747 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:39:42,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:39:42,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1924663, now seen corresponding path program 1 times [2023-08-27 00:39:42,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:39:42,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648303358] [2023-08-27 00:39:42,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:39:42,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:39:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:39:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:39:42,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:39:42,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648303358] [2023-08-27 00:39:42,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648303358] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:39:42,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159221587] [2023-08-27 00:39:42,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:39:42,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:39:42,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:39:42,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:39:42,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-27 00:39:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:39:42,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-27 00:39:42,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:39:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:39:42,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:39:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:39:42,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159221587] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:39:42,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:39:42,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2023-08-27 00:39:42,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202912533] [2023-08-27 00:39:42,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:39:42,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 00:39:42,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:39:42,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 00:39:42,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 00:39:42,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 1074 [2023-08-27 00:39:42,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 166 flow. Second operand has 7 states, 7 states have (on average 410.14285714285717) internal successors, (2871), 7 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:42,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:39:42,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 1074 [2023-08-27 00:39:42,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:39:44,658 INFO L124 PetriNetUnfolderBase]: 9061/11268 cut-off events. [2023-08-27 00:39:44,658 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-27 00:39:44,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22590 conditions, 11268 events. 9061/11268 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 1340. Compared 52704 event pairs, 4353 based on Foata normal form. 0/2403 useless extension candidates. Maximal degree in co-relation 22478. Up to 11168 conditions per place. [2023-08-27 00:39:44,686 INFO L140 encePairwiseOnDemand]: 1064/1074 looper letters, 51 selfloop transitions, 25 changer transitions 0/79 dead transitions. [2023-08-27 00:39:44,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 396 flow [2023-08-27 00:39:44,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 00:39:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 00:39:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2539 transitions. [2023-08-27 00:39:44,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39400993171942894 [2023-08-27 00:39:44,692 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2539 transitions. [2023-08-27 00:39:44,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2539 transitions. [2023-08-27 00:39:44,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:39:44,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2539 transitions. [2023-08-27 00:39:44,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 423.1666666666667) internal successors, (2539), 6 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:44,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1074.0) internal successors, (7518), 7 states have internal predecessors, (7518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:44,705 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1074.0) internal successors, (7518), 7 states have internal predecessors, (7518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:44,706 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 166 flow. Second operand 6 states and 2539 transitions. [2023-08-27 00:39:44,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 396 flow [2023-08-27 00:39:44,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 79 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 00:39:44,707 INFO L231 Difference]: Finished difference. Result has 63 places, 79 transitions, 335 flow [2023-08-27 00:39:44,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=63, PETRI_TRANSITIONS=79} [2023-08-27 00:39:44,708 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-08-27 00:39:44,708 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 79 transitions, 335 flow [2023-08-27 00:39:44,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 410.14285714285717) internal successors, (2871), 7 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:44,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:39:44,709 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2023-08-27 00:39:44,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-27 00:39:44,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:39:44,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:39:44,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:39:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1505797293, now seen corresponding path program 2 times [2023-08-27 00:39:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:39:44,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48120339] [2023-08-27 00:39:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:39:44,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:39:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:39:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:39:45,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:39:45,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48120339] [2023-08-27 00:39:45,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48120339] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:39:45,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082334075] [2023-08-27 00:39:45,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 00:39:45,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:39:45,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:39:45,007 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:39:45,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-27 00:39:45,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-27 00:39:45,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:39:45,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-27 00:39:45,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:39:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-27 00:39:45,126 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 00:39:45,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082334075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:39:45,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 00:39:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2023-08-27 00:39:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825962370] [2023-08-27 00:39:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:39:45,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 00:39:45,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:39:45,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 00:39:45,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-27 00:39:45,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 1074 [2023-08-27 00:39:45,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 79 transitions, 335 flow. Second operand has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:45,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:39:45,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 1074 [2023-08-27 00:39:45,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:39:46,623 INFO L124 PetriNetUnfolderBase]: 9061/11267 cut-off events. [2023-08-27 00:39:46,623 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-08-27 00:39:46,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22637 conditions, 11267 events. 9061/11267 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 1340. Compared 52605 event pairs, 4353 based on Foata normal form. 1/2410 useless extension candidates. Maximal degree in co-relation 22549. Up to 11181 conditions per place. [2023-08-27 00:39:46,655 INFO L140 encePairwiseOnDemand]: 1071/1074 looper letters, 69 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2023-08-27 00:39:46,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 475 flow [2023-08-27 00:39:46,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 00:39:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 00:39:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1288 transitions. [2023-08-27 00:39:46,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39975170701427687 [2023-08-27 00:39:46,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1288 transitions. [2023-08-27 00:39:46,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1288 transitions. [2023-08-27 00:39:46,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:39:46,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1288 transitions. [2023-08-27 00:39:46,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:46,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:46,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:46,711 INFO L175 Difference]: Start difference. First operand has 63 places, 79 transitions, 335 flow. Second operand 3 states and 1288 transitions. [2023-08-27 00:39:46,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 475 flow [2023-08-27 00:39:46,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 438 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-08-27 00:39:46,713 INFO L231 Difference]: Finished difference. Result has 63 places, 78 transitions, 300 flow [2023-08-27 00:39:46,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=63, PETRI_TRANSITIONS=78} [2023-08-27 00:39:46,714 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-08-27 00:39:46,714 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 300 flow [2023-08-27 00:39:46,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:46,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:39:46,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:39:46,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-27 00:39:46,919 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,SelfDestructingSolverStorable3 [2023-08-27 00:39:46,920 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:39:46,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:39:46,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1569946074, now seen corresponding path program 1 times [2023-08-27 00:39:46,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:39:46,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050539894] [2023-08-27 00:39:46,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:39:46,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:39:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:39:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:39:46,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:39:46,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050539894] [2023-08-27 00:39:46,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050539894] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:39:46,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:39:46,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 00:39:46,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310425764] [2023-08-27 00:39:46,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:39:46,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 00:39:46,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:39:46,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 00:39:46,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 00:39:46,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 1074 [2023-08-27 00:39:46,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 78 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:46,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:39:46,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 1074 [2023-08-27 00:39:46,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:39:49,285 INFO L124 PetriNetUnfolderBase]: 12171/15467 cut-off events. [2023-08-27 00:39:49,285 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-27 00:39:49,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31079 conditions, 15467 events. 12171/15467 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 1820. Compared 82961 event pairs, 4395 based on Foata normal form. 0/3656 useless extension candidates. Maximal degree in co-relation 31024. Up to 9997 conditions per place. [2023-08-27 00:39:49,328 INFO L140 encePairwiseOnDemand]: 1069/1074 looper letters, 102 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2023-08-27 00:39:49,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 107 transitions, 570 flow [2023-08-27 00:39:49,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 00:39:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 00:39:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1361 transitions. [2023-08-27 00:39:49,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4224084419615146 [2023-08-27 00:39:49,332 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1361 transitions. [2023-08-27 00:39:49,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1361 transitions. [2023-08-27 00:39:49,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:39:49,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1361 transitions. [2023-08-27 00:39:49,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 453.6666666666667) internal successors, (1361), 3 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:49,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:49,338 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:49,338 INFO L175 Difference]: Start difference. First operand has 63 places, 78 transitions, 300 flow. Second operand 3 states and 1361 transitions. [2023-08-27 00:39:49,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 107 transitions, 570 flow [2023-08-27 00:39:49,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 107 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 00:39:49,340 INFO L231 Difference]: Finished difference. Result has 64 places, 80 transitions, 309 flow [2023-08-27 00:39:49,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=309, PETRI_PLACES=64, PETRI_TRANSITIONS=80} [2023-08-27 00:39:49,340 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-08-27 00:39:49,340 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 80 transitions, 309 flow [2023-08-27 00:39:49,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:49,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:39:49,341 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-27 00:39:49,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 00:39:49,341 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:39:49,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:39:49,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1558947682, now seen corresponding path program 1 times [2023-08-27 00:39:49,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:39:49,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399021506] [2023-08-27 00:39:49,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:39:49,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:39:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:39:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-27 00:39:49,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:39:49,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399021506] [2023-08-27 00:39:49,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399021506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:39:49,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:39:49,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 00:39:49,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895780634] [2023-08-27 00:39:49,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:39:49,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 00:39:49,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:39:49,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 00:39:49,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 00:39:49,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 1074 [2023-08-27 00:39:49,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 80 transitions, 309 flow. Second operand has 4 states, 4 states have (on average 387.25) internal successors, (1549), 4 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:49,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:39:49,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 1074 [2023-08-27 00:39:49,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:39:51,505 INFO L124 PetriNetUnfolderBase]: 10879/13960 cut-off events. [2023-08-27 00:39:51,506 INFO L125 PetriNetUnfolderBase]: For 431/638 co-relation queries the response was YES. [2023-08-27 00:39:51,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29689 conditions, 13960 events. 10879/13960 cut-off events. For 431/638 co-relation queries the response was YES. Maximal size of possible extension queue 1632. Compared 73817 event pairs, 6219 based on Foata normal form. 209/3782 useless extension candidates. Maximal degree in co-relation 29610. Up to 13837 conditions per place. [2023-08-27 00:39:51,548 INFO L140 encePairwiseOnDemand]: 1067/1074 looper letters, 63 selfloop transitions, 16 changer transitions 0/82 dead transitions. [2023-08-27 00:39:51,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 82 transitions, 476 flow [2023-08-27 00:39:51,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 00:39:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 00:39:51,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1605 transitions. [2023-08-27 00:39:51,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37360335195530725 [2023-08-27 00:39:51,552 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1605 transitions. [2023-08-27 00:39:51,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1605 transitions. [2023-08-27 00:39:51,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:39:51,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1605 transitions. [2023-08-27 00:39:51,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 401.25) internal successors, (1605), 4 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:51,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1074.0) internal successors, (5370), 5 states have internal predecessors, (5370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:51,559 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1074.0) internal successors, (5370), 5 states have internal predecessors, (5370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:51,559 INFO L175 Difference]: Start difference. First operand has 64 places, 80 transitions, 309 flow. Second operand 4 states and 1605 transitions. [2023-08-27 00:39:51,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 82 transitions, 476 flow [2023-08-27 00:39:51,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 82 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 00:39:51,561 INFO L231 Difference]: Finished difference. Result has 67 places, 82 transitions, 364 flow [2023-08-27 00:39:51,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=364, PETRI_PLACES=67, PETRI_TRANSITIONS=82} [2023-08-27 00:39:51,562 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-08-27 00:39:51,562 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 82 transitions, 364 flow [2023-08-27 00:39:51,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 387.25) internal successors, (1549), 4 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:51,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:39:51,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:39:51,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 00:39:51,562 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:39:51,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:39:51,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1569946072, now seen corresponding path program 1 times [2023-08-27 00:39:51,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:39:51,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677041841] [2023-08-27 00:39:51,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:39:51,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:39:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:39:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:39:51,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:39:51,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677041841] [2023-08-27 00:39:51,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677041841] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:39:51,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:39:51,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 00:39:51,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966537339] [2023-08-27 00:39:51,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:39:51,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 00:39:51,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:39:51,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 00:39:51,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 00:39:51,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 1074 [2023-08-27 00:39:51,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 82 transitions, 364 flow. Second operand has 5 states, 5 states have (on average 382.4) internal successors, (1912), 5 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:51,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:39:51,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 1074 [2023-08-27 00:39:51,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:39:54,117 INFO L124 PetriNetUnfolderBase]: 13756/17775 cut-off events. [2023-08-27 00:39:54,117 INFO L125 PetriNetUnfolderBase]: For 986/986 co-relation queries the response was YES. [2023-08-27 00:39:54,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37483 conditions, 17775 events. 13756/17775 cut-off events. For 986/986 co-relation queries the response was YES. Maximal size of possible extension queue 1689. Compared 94219 event pairs, 7088 based on Foata normal form. 178/5338 useless extension candidates. Maximal degree in co-relation 37399. Up to 14583 conditions per place. [2023-08-27 00:39:54,176 INFO L140 encePairwiseOnDemand]: 1058/1074 looper letters, 117 selfloop transitions, 18 changer transitions 0/137 dead transitions. [2023-08-27 00:39:54,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 137 transitions, 756 flow [2023-08-27 00:39:54,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 00:39:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 00:39:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2410 transitions. [2023-08-27 00:39:54,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3739913097454997 [2023-08-27 00:39:54,181 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2410 transitions. [2023-08-27 00:39:54,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2410 transitions. [2023-08-27 00:39:54,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:39:54,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2410 transitions. [2023-08-27 00:39:54,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 401.6666666666667) internal successors, (2410), 6 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:54,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1074.0) internal successors, (7518), 7 states have internal predecessors, (7518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:54,192 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1074.0) internal successors, (7518), 7 states have internal predecessors, (7518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:54,192 INFO L175 Difference]: Start difference. First operand has 67 places, 82 transitions, 364 flow. Second operand 6 states and 2410 transitions. [2023-08-27 00:39:54,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 137 transitions, 756 flow [2023-08-27 00:39:54,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 137 transitions, 738 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-27 00:39:54,195 INFO L231 Difference]: Finished difference. Result has 73 places, 84 transitions, 418 flow [2023-08-27 00:39:54,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=418, PETRI_PLACES=73, PETRI_TRANSITIONS=84} [2023-08-27 00:39:54,195 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -1 predicate places. [2023-08-27 00:39:54,195 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 84 transitions, 418 flow [2023-08-27 00:39:54,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 382.4) internal successors, (1912), 5 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:54,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:39:54,196 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2023-08-27 00:39:54,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 00:39:54,196 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:39:54,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:39:54,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1326718252, now seen corresponding path program 1 times [2023-08-27 00:39:54,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:39:54,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656048363] [2023-08-27 00:39:54,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:39:54,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:39:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:39:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:39:54,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:39:54,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656048363] [2023-08-27 00:39:54,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656048363] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:39:54,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961750219] [2023-08-27 00:39:54,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:39:54,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:39:54,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:39:54,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:39:54,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-27 00:39:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:39:54,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-27 00:39:54,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:39:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 00:39:54,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:39:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 00:39:54,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961750219] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:39:54,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:39:54,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2023-08-27 00:39:54,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490707415] [2023-08-27 00:39:54,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:39:54,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-27 00:39:54,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:39:54,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-27 00:39:54,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-08-27 00:39:54,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 1074 [2023-08-27 00:39:54,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 84 transitions, 418 flow. Second operand has 15 states, 15 states have (on average 387.26666666666665) internal successors, (5809), 15 states have internal predecessors, (5809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:54,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:39:54,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 1074 [2023-08-27 00:39:54,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:39:55,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1924] L58-7-->thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_83| |v_thread2Thread1of1ForFork0_plus_~b#1_137|))) (and (<= .cse0 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_83| |v_thread2Thread1of1ForFork0_plus_~b#1_137| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#res#1_53| v_~bsum~0_91) (= |v_thread2Thread1of1ForFork0_plus_#res#1_53| .cse0) (= |v_thread2Thread1of1ForFork0_#t~post4#1_51| |v_thread2Thread1of1ForFork0_~i~1#1_81|) (let ((.cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5#1_58| (select (select |v_#memory_int_285| v_~B~0.base_71) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_81| 4) v_~B~0.offset_71)))) (.cse2 (= |v_thread2Thread1of1ForFork0_#t~mem5#1_58| |v_thread2Thread1of1ForFork0_plus_#in~b#1_39|)) (.cse3 (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_39| v_~bsum~0_92)) (.cse5 (= |v_thread2Thread1of1ForFork0_plus_~a#1_83| |v_thread2Thread1of1ForFork0_plus_#in~a#1_39|)) (.cse6 (< |v_thread2Thread1of1ForFork0_~i~1#1_81| v_~N~0_144)) (.cse7 (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_39| |v_thread2Thread1of1ForFork0_plus_~b#1_137|)) (.cse8 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_87| 0))) (.cse9 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_87| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|))) (or (and .cse1 (<= |v_thread2Thread1of1ForFork0_plus_~b#1_137| 0) .cse2 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91| (ite |v_thread2Thread1of1ForFork0_plus_#t~short31#1_148| 1 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92| 0)) .cse3 (let ((.cse4 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92| (ite |v_thread2Thread1of1ForFork0_plus_#t~short30#1_144| 1 0)))) (or (and (<= 0 (+ 9223372039002259455 |v_thread2Thread1of1ForFork0_plus_~b#1_137|)) (not |v_thread2Thread1of1ForFork0_plus_#t~short30#1_143|) .cse4) (and (<= 0 |v_thread2Thread1of1ForFork0_plus_~b#1_137|) .cse4))) .cse5 .cse6 .cse7 .cse8 .cse9) (and |v_thread2Thread1of1ForFork0_plus_#t~short30#1_142| .cse1 (not |v_thread2Thread1of1ForFork0_plus_#t~short31#1_149|) .cse2 (<= |v_thread2Thread1of1ForFork0_plus_~b#1_137| 4294967295) (< 0 |v_thread2Thread1of1ForFork0_plus_~b#1_137|) .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (= (ite |v_thread2Thread1of1ForFork0_plus_#t~short31#1_150| 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|)))) (< 2147483646 |v_thread2Thread1of1ForFork0_#t~post4#1_51|))) InVars {~bsum~0=v_~bsum~0_92, ~B~0.base=v_~B~0.base_71, #memory_int=|v_#memory_int_285|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_81|, ~N~0=v_~N~0_144, ~B~0.offset=v_~B~0.offset_71} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_39|, ~B~0.base=v_~B~0.base_71, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_83|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|, thread2Thread1of1ForFork0_plus_#t~short31#1=|v_thread2Thread1of1ForFork0_plus_#t~short31#1_147|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_81|, ~N~0=v_~N~0_144, ~bsum~0=v_~bsum~0_91, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_87|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_39|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_53|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_137|, #memory_int=|v_#memory_int_285|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_57|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_51|, thread2Thread1of1ForFork0_plus_#t~short30#1=|v_thread2Thread1of1ForFork0_plus_#t~short30#1_141|, ~B~0.offset=v_~B~0.offset_71, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_53|} AuxVars[|v_thread2Thread1of1ForFork0_plus_#t~short31#1_150|, |v_thread2Thread1of1ForFork0_#t~mem5#1_58|, |v_thread2Thread1of1ForFork0_plus_#t~short30#1_143|, |v_thread2Thread1of1ForFork0_plus_#t~short30#1_144|, |v_thread2Thread1of1ForFork0_plus_#t~short30#1_142|, |v_thread2Thread1of1ForFork0_plus_#t~short31#1_148|, |v_thread2Thread1of1ForFork0_plus_#t~short31#1_149|, |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_plus_#t~short31#1, ~bsum~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_plus_#t~short30#1, thread2Thread1of1ForFork0_#t~ret6#1][76], [Black: 511#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 510#(<= ~N~0 0), 573#(or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 70#L50-7true, 447#true, 496#(= |thread1Thread1of1ForFork2_~i~0#1| 0), 25#thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 461#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483647), 396#thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 450#(<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1), Black: 465#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483646), 507#true, 282#L86-1true, Black: 501#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 439#(= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)]) [2023-08-27 00:39:55,838 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 00:39:55,838 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-27 00:39:55,838 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 00:39:55,838 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-27 00:39:56,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1939] L66-7-->thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (< 2147483646 |v_thread3Thread1of1ForFork1_#t~post7#1_63|) (let ((.cse0 (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_250| 0))) (.cse1 (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_250|))) (or (and (not |v_thread3Thread1of1ForFork1_plus_#t~short31#1_378|) (< 0 |v_thread3Thread1of1ForFork1_plus_~b#1_351|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220| (ite |v_thread3Thread1of1ForFork1_plus_#t~short31#1_379| 1 0)) .cse0 .cse1) (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220| (ite |v_thread3Thread1of1ForFork1_plus_#t~short31#1_380| 1 0)) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_351| 0) .cse0 .cse1))) (= (+ |v_thread3Thread1of1ForFork1_plus_~a#1_245| |v_thread3Thread1of1ForFork1_plus_~b#1_351|) |v_thread3Thread1of1ForFork1_plus_#res#1_133|) (= |v_thread3Thread1of1ForFork1_#t~post7#1_63| |v_thread3Thread1of1ForFork1_~i~2#1_151|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_133| 2147483648)) (let ((.cse30 (* |v_thread3Thread1of1ForFork1_~i~2#1_151| 4))) (let ((.cse10 (+ .cse30 v_~C~0.offset_77))) (let ((.cse2 (= |v_thread3Thread1of1ForFork1_plus_~b#1_351| |v_thread3Thread1of1ForFork1_plus_#in~b#1_137|)) (.cse3 (= |v_thread3Thread1of1ForFork1_#t~mem11#1_82| |v_thread3Thread1of1ForFork1_plus_#in~b#1_137|)) (.cse4 (= |v_thread3Thread1of1ForFork1_#t~mem11#1_82| (select (select |v_#memory_int_331| v_~C~0.base_77) .cse10))) (.cse9 (select |v_#memory_int_332| v_~C~0.base_77)) (.cse19 (< |v_thread3Thread1of1ForFork1_~i~2#1_151| v_~N~0_172)) (.cse21 (select (select |v_#memory_int_332| v_~B~0.base_99) (+ .cse30 v_~B~0.offset_99))) (.cse20 (select (select |v_#memory_int_332| v_~A~0.base_103) (+ .cse30 v_~A~0.offset_103))) (.cse5 (= v_~csum~0_98 |v_thread3Thread1of1ForFork1_plus_#in~a#1_131|)) (.cse6 (= |v_thread3Thread1of1ForFork1_plus_~a#1_245| |v_thread3Thread1of1ForFork1_plus_#in~a#1_131|)) (.cse8 (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_221| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_251|))) (or (let ((.cse7 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_246| |v_thread3Thread1of1ForFork1_plus_~b#1_352|))) (and .cse2 .cse3 .cse4 (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_351|) .cse5 .cse6 (<= .cse7 2147483647) .cse8 (= (store |v_#memory_int_332| v_~C~0.base_77 (store .cse9 .cse10 .cse7)) |v_#memory_int_331|) (= (ite |v_thread3Thread1of1ForFork1_plus_#t~short30#1_390| 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_221|) (let ((.cse11 (= (ite |v_thread3Thread1of1ForFork1_plus_#t~short31#1_384| 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_252|))) (or (and |v_thread3Thread1of1ForFork1_plus_#t~short31#1_384| (<= |v_thread3Thread1of1ForFork1_plus_~b#1_352| 4294967295) .cse11 (not |v_thread3Thread1of1ForFork1_plus_#t~short31#1_382|)) (and |v_thread3Thread1of1ForFork1_plus_#t~short31#1_384| (<= |v_thread3Thread1of1ForFork1_plus_~b#1_352| 0) .cse11))) (let ((.cse12 (= |v_thread3Thread1of1ForFork1_#t~mem9#1_110| |v_thread3Thread1of1ForFork1_plus_#in~b#1_138|)) (.cse13 (= |v_thread3Thread1of1ForFork1_plus_~b#1_352| |v_thread3Thread1of1ForFork1_plus_#in~b#1_138|)) (.cse14 (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_222| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_253|)) (.cse15 (= |v_thread3Thread1of1ForFork1_#t~mem8#1_111| |v_thread3Thread1of1ForFork1_plus_#in~a#1_133|)) (.cse16 (= |v_thread3Thread1of1ForFork1_plus_~a#1_246| |v_thread3Thread1of1ForFork1_plus_#in~a#1_133|)) (.cse17 (= .cse21 |v_thread3Thread1of1ForFork1_#t~mem9#1_110|)) (.cse18 (= |v_thread3Thread1of1ForFork1_#t~mem8#1_111| .cse20))) (or (and .cse12 .cse13 .cse14 (= (ite |v_thread3Thread1of1ForFork1_plus_#t~short30#1_391| 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_222|) .cse15 .cse16 .cse17 (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_352|) .cse18 |v_thread3Thread1of1ForFork1_plus_#t~short30#1_391| .cse19) (and .cse12 .cse13 .cse14 (not |v_thread3Thread1of1ForFork1_plus_#t~short30#1_389|) .cse15 .cse16 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork1_plus_~b#1_352|)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_222| (ite |v_thread3Thread1of1ForFork1_plus_#t~short30#1_392| 1 0)) (< |v_thread3Thread1of1ForFork1_plus_~b#1_352| 0) .cse17 .cse18 (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_253| 0)) .cse19))) |v_thread3Thread1of1ForFork1_plus_#t~short30#1_390|)) (and (< |v_thread3Thread1of1ForFork1_plus_~b#1_351| 0) .cse2 (not |v_thread3Thread1of1ForFork1_plus_#t~short30#1_385|) .cse3 .cse4 (let ((.cse22 (= (ite |v_thread3Thread1of1ForFork1_plus_#t~short31#1_385| 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_254|))) (or (and .cse22 |v_thread3Thread1of1ForFork1_plus_#t~short31#1_385| (<= |v_thread3Thread1of1ForFork1_plus_~b#1_353| 4294967295) (not |v_thread3Thread1of1ForFork1_plus_#t~short31#1_383|)) (and .cse22 |v_thread3Thread1of1ForFork1_plus_#t~short31#1_385| (<= |v_thread3Thread1of1ForFork1_plus_~b#1_353| 0)))) (= (store |v_#memory_int_332| v_~C~0.base_77 (store .cse9 .cse10 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_247| |v_thread3Thread1of1ForFork1_plus_~b#1_353|))) |v_#memory_int_331|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_221| (ite |v_thread3Thread1of1ForFork1_plus_#t~short30#1_384| 1 0)) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_251| 0)) (let ((.cse23 (= |v_thread3Thread1of1ForFork1_plus_~a#1_247| |v_thread3Thread1of1ForFork1_plus_#in~a#1_132|)) (.cse24 (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_255|)) (.cse25 (= |v_thread3Thread1of1ForFork1_#t~mem8#1_110| |v_thread3Thread1of1ForFork1_plus_#in~a#1_132|)) (.cse26 (= |v_thread3Thread1of1ForFork1_plus_~b#1_353| |v_thread3Thread1of1ForFork1_plus_#in~b#1_139|)) (.cse27 (= |v_thread3Thread1of1ForFork1_#t~mem8#1_110| .cse20)) (.cse28 (= |v_thread3Thread1of1ForFork1_#t~mem9#1_111| |v_thread3Thread1of1ForFork1_plus_#in~b#1_139|)) (.cse29 (= .cse21 |v_thread3Thread1of1ForFork1_#t~mem9#1_111|))) (or (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223| (ite |v_thread3Thread1of1ForFork1_plus_#t~short30#1_387| 1 0)) .cse23 (not |v_thread3Thread1of1ForFork1_plus_#t~short30#1_388|) (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork1_plus_~b#1_353|)) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_255| 0)) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (< |v_thread3Thread1of1ForFork1_plus_~b#1_353| 0) .cse19) (and .cse23 .cse24 .cse25 (= (ite |v_thread3Thread1of1ForFork1_plus_#t~short30#1_386| 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223|) .cse26 .cse27 .cse28 (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_353|) .cse29 |v_thread3Thread1of1ForFork1_plus_#t~short30#1_386| .cse19))) .cse5 .cse6 .cse8 (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_247| |v_thread3Thread1of1ForFork1_plus_~b#1_353| 2147483648))))))) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_133| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#res#1_133| v_~csum~0_97)) InVars {~A~0.base=v_~A~0.base_103, ~B~0.base=v_~B~0.base_99, ~A~0.offset=v_~A~0.offset_103, ~C~0.base=v_~C~0.base_77, ~csum~0=v_~csum~0_98, ~C~0.offset=v_~C~0.offset_77, #memory_int=|v_#memory_int_332|, ~N~0=v_~N~0_172, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_151|, ~B~0.offset=v_~B~0.offset_99} OutVars{~A~0.base=v_~A~0.base_103, ~B~0.base=v_~B~0.base_99, ~C~0.base=v_~C~0.base_77, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_131|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_109|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_151|, thread3Thread1of1ForFork1_#t~ret12#1=|v_thread3Thread1of1ForFork1_#t~ret12#1_61|, thread3Thread1of1ForFork1_#t~mem11#1=|v_thread3Thread1of1ForFork1_#t~mem11#1_81|, thread3Thread1of1ForFork1_plus_#t~short30#1=|v_thread3Thread1of1ForFork1_plus_#t~short30#1_383|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_137|, thread3Thread1of1ForFork1_#t~post7#1=|v_thread3Thread1of1ForFork1_#t~post7#1_63|, ~B~0.offset=v_~B~0.offset_99, thread3Thread1of1ForFork1_plus_#t~short31#1=|v_thread3Thread1of1ForFork1_plus_#t~short31#1_377|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_133|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_250|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_73|, ~N~0=v_~N~0_172, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_245|, ~A~0.offset=v_~A~0.offset_103, ~csum~0=v_~csum~0_97, ~C~0.offset=v_~C~0.offset_77, #memory_int=|v_#memory_int_331|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_351|, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_109|} AuxVars[|v_thread3Thread1of1ForFork1_#t~mem9#1_110|, |v_thread3Thread1of1ForFork1_#t~mem9#1_111|, |v_thread3Thread1of1ForFork1_plus_~b#1_353|, |v_thread3Thread1of1ForFork1_plus_~b#1_352|, |v_thread3Thread1of1ForFork1_plus_~a#1_246|, |v_thread3Thread1of1ForFork1_plus_#t~short31#1_378|, |v_thread3Thread1of1ForFork1_plus_#in~a#1_133|, |v_thread3Thread1of1ForFork1_plus_~a#1_247|, |v_thread3Thread1of1ForFork1_plus_#in~a#1_132|, |v_thread3Thread1of1ForFork1_#t~mem11#1_82|, |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_255|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_384|, |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_254|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_385|, |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_253|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_386|, |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_252|, |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_251|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_387|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_388|, |v_thread3Thread1of1ForFork1_plus_#t~short31#1_379|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_389|, |v_thread3Thread1of1ForFork1_plus_#t~short31#1_380|, |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223|, |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_221|, |v_thread3Thread1of1ForFork1_#t~mem8#1_111|, |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_222|, |v_thread3Thread1of1ForFork1_#t~mem8#1_110|, |v_thread3Thread1of1ForFork1_plus_#t~short31#1_384|, |v_thread3Thread1of1ForFork1_plus_#t~short31#1_385|, |v_thread3Thread1of1ForFork1_plus_#t~short31#1_382|, |v_thread3Thread1of1ForFork1_plus_#t~short31#1_383|, |v_thread3Thread1of1ForFork1_plus_#in~b#1_139|, |v_thread3Thread1of1ForFork1_plus_#in~b#1_138|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_390|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_391|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_392|] AssignedVars[thread3Thread1of1ForFork1_plus_#t~short31#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~ret12#1, thread3Thread1of1ForFork1_#t~mem11#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_plus_#t~short30#1, thread3Thread1of1ForFork1_plus_#in~b#1, ~csum~0, #memory_int, thread3Thread1of1ForFork1_#t~post7#1, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~mem8#1][90], [Black: 511#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 510#(<= ~N~0 0), 573#(or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 70#L50-7true, 447#true, 496#(= |thread1Thread1of1ForFork2_~i~0#1| 0), 25#thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 461#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483647), 396#thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 450#(<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1), Black: 465#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483646), 507#true, 282#L86-1true, Black: 501#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 439#(= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)]) [2023-08-27 00:39:56,151 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is not cut-off event [2023-08-27 00:39:56,151 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-27 00:39:56,152 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-27 00:39:56,152 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-27 00:39:58,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1939] L66-7-->thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (< 2147483646 |v_thread3Thread1of1ForFork1_#t~post7#1_63|) (let ((.cse0 (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_250| 0))) (.cse1 (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_250|))) (or (and (not |v_thread3Thread1of1ForFork1_plus_#t~short31#1_378|) (< 0 |v_thread3Thread1of1ForFork1_plus_~b#1_351|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220| (ite |v_thread3Thread1of1ForFork1_plus_#t~short31#1_379| 1 0)) .cse0 .cse1) (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220| (ite |v_thread3Thread1of1ForFork1_plus_#t~short31#1_380| 1 0)) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_351| 0) .cse0 .cse1))) (= (+ |v_thread3Thread1of1ForFork1_plus_~a#1_245| |v_thread3Thread1of1ForFork1_plus_~b#1_351|) |v_thread3Thread1of1ForFork1_plus_#res#1_133|) (= |v_thread3Thread1of1ForFork1_#t~post7#1_63| |v_thread3Thread1of1ForFork1_~i~2#1_151|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_133| 2147483648)) (let ((.cse30 (* |v_thread3Thread1of1ForFork1_~i~2#1_151| 4))) (let ((.cse10 (+ .cse30 v_~C~0.offset_77))) (let ((.cse2 (= |v_thread3Thread1of1ForFork1_plus_~b#1_351| |v_thread3Thread1of1ForFork1_plus_#in~b#1_137|)) (.cse3 (= |v_thread3Thread1of1ForFork1_#t~mem11#1_82| |v_thread3Thread1of1ForFork1_plus_#in~b#1_137|)) (.cse4 (= |v_thread3Thread1of1ForFork1_#t~mem11#1_82| (select (select |v_#memory_int_331| v_~C~0.base_77) .cse10))) (.cse9 (select |v_#memory_int_332| v_~C~0.base_77)) (.cse19 (< |v_thread3Thread1of1ForFork1_~i~2#1_151| v_~N~0_172)) (.cse21 (select (select |v_#memory_int_332| v_~B~0.base_99) (+ .cse30 v_~B~0.offset_99))) (.cse20 (select (select |v_#memory_int_332| v_~A~0.base_103) (+ .cse30 v_~A~0.offset_103))) (.cse5 (= v_~csum~0_98 |v_thread3Thread1of1ForFork1_plus_#in~a#1_131|)) (.cse6 (= |v_thread3Thread1of1ForFork1_plus_~a#1_245| |v_thread3Thread1of1ForFork1_plus_#in~a#1_131|)) (.cse8 (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_221| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_251|))) (or (let ((.cse7 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_246| |v_thread3Thread1of1ForFork1_plus_~b#1_352|))) (and .cse2 .cse3 .cse4 (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_351|) .cse5 .cse6 (<= .cse7 2147483647) .cse8 (= (store |v_#memory_int_332| v_~C~0.base_77 (store .cse9 .cse10 .cse7)) |v_#memory_int_331|) (= (ite |v_thread3Thread1of1ForFork1_plus_#t~short30#1_390| 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_221|) (let ((.cse11 (= (ite |v_thread3Thread1of1ForFork1_plus_#t~short31#1_384| 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_252|))) (or (and |v_thread3Thread1of1ForFork1_plus_#t~short31#1_384| (<= |v_thread3Thread1of1ForFork1_plus_~b#1_352| 4294967295) .cse11 (not |v_thread3Thread1of1ForFork1_plus_#t~short31#1_382|)) (and |v_thread3Thread1of1ForFork1_plus_#t~short31#1_384| (<= |v_thread3Thread1of1ForFork1_plus_~b#1_352| 0) .cse11))) (let ((.cse12 (= |v_thread3Thread1of1ForFork1_#t~mem9#1_110| |v_thread3Thread1of1ForFork1_plus_#in~b#1_138|)) (.cse13 (= |v_thread3Thread1of1ForFork1_plus_~b#1_352| |v_thread3Thread1of1ForFork1_plus_#in~b#1_138|)) (.cse14 (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_222| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_253|)) (.cse15 (= |v_thread3Thread1of1ForFork1_#t~mem8#1_111| |v_thread3Thread1of1ForFork1_plus_#in~a#1_133|)) (.cse16 (= |v_thread3Thread1of1ForFork1_plus_~a#1_246| |v_thread3Thread1of1ForFork1_plus_#in~a#1_133|)) (.cse17 (= .cse21 |v_thread3Thread1of1ForFork1_#t~mem9#1_110|)) (.cse18 (= |v_thread3Thread1of1ForFork1_#t~mem8#1_111| .cse20))) (or (and .cse12 .cse13 .cse14 (= (ite |v_thread3Thread1of1ForFork1_plus_#t~short30#1_391| 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_222|) .cse15 .cse16 .cse17 (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_352|) .cse18 |v_thread3Thread1of1ForFork1_plus_#t~short30#1_391| .cse19) (and .cse12 .cse13 .cse14 (not |v_thread3Thread1of1ForFork1_plus_#t~short30#1_389|) .cse15 .cse16 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork1_plus_~b#1_352|)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_222| (ite |v_thread3Thread1of1ForFork1_plus_#t~short30#1_392| 1 0)) (< |v_thread3Thread1of1ForFork1_plus_~b#1_352| 0) .cse17 .cse18 (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_253| 0)) .cse19))) |v_thread3Thread1of1ForFork1_plus_#t~short30#1_390|)) (and (< |v_thread3Thread1of1ForFork1_plus_~b#1_351| 0) .cse2 (not |v_thread3Thread1of1ForFork1_plus_#t~short30#1_385|) .cse3 .cse4 (let ((.cse22 (= (ite |v_thread3Thread1of1ForFork1_plus_#t~short31#1_385| 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_254|))) (or (and .cse22 |v_thread3Thread1of1ForFork1_plus_#t~short31#1_385| (<= |v_thread3Thread1of1ForFork1_plus_~b#1_353| 4294967295) (not |v_thread3Thread1of1ForFork1_plus_#t~short31#1_383|)) (and .cse22 |v_thread3Thread1of1ForFork1_plus_#t~short31#1_385| (<= |v_thread3Thread1of1ForFork1_plus_~b#1_353| 0)))) (= (store |v_#memory_int_332| v_~C~0.base_77 (store .cse9 .cse10 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_247| |v_thread3Thread1of1ForFork1_plus_~b#1_353|))) |v_#memory_int_331|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_221| (ite |v_thread3Thread1of1ForFork1_plus_#t~short30#1_384| 1 0)) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_251| 0)) (let ((.cse23 (= |v_thread3Thread1of1ForFork1_plus_~a#1_247| |v_thread3Thread1of1ForFork1_plus_#in~a#1_132|)) (.cse24 (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_255|)) (.cse25 (= |v_thread3Thread1of1ForFork1_#t~mem8#1_110| |v_thread3Thread1of1ForFork1_plus_#in~a#1_132|)) (.cse26 (= |v_thread3Thread1of1ForFork1_plus_~b#1_353| |v_thread3Thread1of1ForFork1_plus_#in~b#1_139|)) (.cse27 (= |v_thread3Thread1of1ForFork1_#t~mem8#1_110| .cse20)) (.cse28 (= |v_thread3Thread1of1ForFork1_#t~mem9#1_111| |v_thread3Thread1of1ForFork1_plus_#in~b#1_139|)) (.cse29 (= .cse21 |v_thread3Thread1of1ForFork1_#t~mem9#1_111|))) (or (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223| (ite |v_thread3Thread1of1ForFork1_plus_#t~short30#1_387| 1 0)) .cse23 (not |v_thread3Thread1of1ForFork1_plus_#t~short30#1_388|) (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork1_plus_~b#1_353|)) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_255| 0)) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (< |v_thread3Thread1of1ForFork1_plus_~b#1_353| 0) .cse19) (and .cse23 .cse24 .cse25 (= (ite |v_thread3Thread1of1ForFork1_plus_#t~short30#1_386| 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223|) .cse26 .cse27 .cse28 (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_353|) .cse29 |v_thread3Thread1of1ForFork1_plus_#t~short30#1_386| .cse19))) .cse5 .cse6 .cse8 (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_247| |v_thread3Thread1of1ForFork1_plus_~b#1_353| 2147483648))))))) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_133| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#res#1_133| v_~csum~0_97)) InVars {~A~0.base=v_~A~0.base_103, ~B~0.base=v_~B~0.base_99, ~A~0.offset=v_~A~0.offset_103, ~C~0.base=v_~C~0.base_77, ~csum~0=v_~csum~0_98, ~C~0.offset=v_~C~0.offset_77, #memory_int=|v_#memory_int_332|, ~N~0=v_~N~0_172, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_151|, ~B~0.offset=v_~B~0.offset_99} OutVars{~A~0.base=v_~A~0.base_103, ~B~0.base=v_~B~0.base_99, ~C~0.base=v_~C~0.base_77, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_131|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_109|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_151|, thread3Thread1of1ForFork1_#t~ret12#1=|v_thread3Thread1of1ForFork1_#t~ret12#1_61|, thread3Thread1of1ForFork1_#t~mem11#1=|v_thread3Thread1of1ForFork1_#t~mem11#1_81|, thread3Thread1of1ForFork1_plus_#t~short30#1=|v_thread3Thread1of1ForFork1_plus_#t~short30#1_383|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_137|, thread3Thread1of1ForFork1_#t~post7#1=|v_thread3Thread1of1ForFork1_#t~post7#1_63|, ~B~0.offset=v_~B~0.offset_99, thread3Thread1of1ForFork1_plus_#t~short31#1=|v_thread3Thread1of1ForFork1_plus_#t~short31#1_377|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_133|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_250|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_73|, ~N~0=v_~N~0_172, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_245|, ~A~0.offset=v_~A~0.offset_103, ~csum~0=v_~csum~0_97, ~C~0.offset=v_~C~0.offset_77, #memory_int=|v_#memory_int_331|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_351|, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_109|} AuxVars[|v_thread3Thread1of1ForFork1_#t~mem9#1_110|, |v_thread3Thread1of1ForFork1_#t~mem9#1_111|, |v_thread3Thread1of1ForFork1_plus_~b#1_353|, |v_thread3Thread1of1ForFork1_plus_~b#1_352|, |v_thread3Thread1of1ForFork1_plus_~a#1_246|, |v_thread3Thread1of1ForFork1_plus_#t~short31#1_378|, |v_thread3Thread1of1ForFork1_plus_#in~a#1_133|, |v_thread3Thread1of1ForFork1_plus_~a#1_247|, |v_thread3Thread1of1ForFork1_plus_#in~a#1_132|, |v_thread3Thread1of1ForFork1_#t~mem11#1_82|, |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_255|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_384|, |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_254|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_385|, |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_253|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_386|, |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_252|, |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_251|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_387|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_388|, |v_thread3Thread1of1ForFork1_plus_#t~short31#1_379|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_389|, |v_thread3Thread1of1ForFork1_plus_#t~short31#1_380|, |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223|, |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_221|, |v_thread3Thread1of1ForFork1_#t~mem8#1_111|, |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_222|, |v_thread3Thread1of1ForFork1_#t~mem8#1_110|, |v_thread3Thread1of1ForFork1_plus_#t~short31#1_384|, |v_thread3Thread1of1ForFork1_plus_#t~short31#1_385|, |v_thread3Thread1of1ForFork1_plus_#t~short31#1_382|, |v_thread3Thread1of1ForFork1_plus_#t~short31#1_383|, |v_thread3Thread1of1ForFork1_plus_#in~b#1_139|, |v_thread3Thread1of1ForFork1_plus_#in~b#1_138|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_390|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_391|, |v_thread3Thread1of1ForFork1_plus_#t~short30#1_392|] AssignedVars[thread3Thread1of1ForFork1_plus_#t~short31#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~ret12#1, thread3Thread1of1ForFork1_#t~mem11#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_plus_#t~short30#1, thread3Thread1of1ForFork1_plus_#in~b#1, ~csum~0, #memory_int, thread3Thread1of1ForFork1_#t~post7#1, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~mem8#1][107], [Black: 511#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 510#(<= ~N~0 0), 447#true, 70#L50-7true, 496#(= |thread1Thread1of1ForFork2_~i~0#1| 0), 517#true, 25#thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 461#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483647), 396#thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 450#(<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1), Black: 465#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483646), 282#L86-1true, 507#true, Black: 501#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 439#(= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)]) [2023-08-27 00:39:58,099 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 00:39:58,099 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 00:39:58,100 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 00:39:58,100 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 00:39:58,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1924] L58-7-->thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_83| |v_thread2Thread1of1ForFork0_plus_~b#1_137|))) (and (<= .cse0 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_83| |v_thread2Thread1of1ForFork0_plus_~b#1_137| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#res#1_53| v_~bsum~0_91) (= |v_thread2Thread1of1ForFork0_plus_#res#1_53| .cse0) (= |v_thread2Thread1of1ForFork0_#t~post4#1_51| |v_thread2Thread1of1ForFork0_~i~1#1_81|) (let ((.cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5#1_58| (select (select |v_#memory_int_285| v_~B~0.base_71) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_81| 4) v_~B~0.offset_71)))) (.cse2 (= |v_thread2Thread1of1ForFork0_#t~mem5#1_58| |v_thread2Thread1of1ForFork0_plus_#in~b#1_39|)) (.cse3 (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_39| v_~bsum~0_92)) (.cse5 (= |v_thread2Thread1of1ForFork0_plus_~a#1_83| |v_thread2Thread1of1ForFork0_plus_#in~a#1_39|)) (.cse6 (< |v_thread2Thread1of1ForFork0_~i~1#1_81| v_~N~0_144)) (.cse7 (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_39| |v_thread2Thread1of1ForFork0_plus_~b#1_137|)) (.cse8 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_87| 0))) (.cse9 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_87| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|))) (or (and .cse1 (<= |v_thread2Thread1of1ForFork0_plus_~b#1_137| 0) .cse2 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91| (ite |v_thread2Thread1of1ForFork0_plus_#t~short31#1_148| 1 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92| 0)) .cse3 (let ((.cse4 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92| (ite |v_thread2Thread1of1ForFork0_plus_#t~short30#1_144| 1 0)))) (or (and (<= 0 (+ 9223372039002259455 |v_thread2Thread1of1ForFork0_plus_~b#1_137|)) (not |v_thread2Thread1of1ForFork0_plus_#t~short30#1_143|) .cse4) (and (<= 0 |v_thread2Thread1of1ForFork0_plus_~b#1_137|) .cse4))) .cse5 .cse6 .cse7 .cse8 .cse9) (and |v_thread2Thread1of1ForFork0_plus_#t~short30#1_142| .cse1 (not |v_thread2Thread1of1ForFork0_plus_#t~short31#1_149|) .cse2 (<= |v_thread2Thread1of1ForFork0_plus_~b#1_137| 4294967295) (< 0 |v_thread2Thread1of1ForFork0_plus_~b#1_137|) .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (= (ite |v_thread2Thread1of1ForFork0_plus_#t~short31#1_150| 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|)))) (< 2147483646 |v_thread2Thread1of1ForFork0_#t~post4#1_51|))) InVars {~bsum~0=v_~bsum~0_92, ~B~0.base=v_~B~0.base_71, #memory_int=|v_#memory_int_285|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_81|, ~N~0=v_~N~0_144, ~B~0.offset=v_~B~0.offset_71} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_39|, ~B~0.base=v_~B~0.base_71, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_83|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|, thread2Thread1of1ForFork0_plus_#t~short31#1=|v_thread2Thread1of1ForFork0_plus_#t~short31#1_147|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_81|, ~N~0=v_~N~0_144, ~bsum~0=v_~bsum~0_91, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_87|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_39|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_53|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_137|, #memory_int=|v_#memory_int_285|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_57|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_51|, thread2Thread1of1ForFork0_plus_#t~short30#1=|v_thread2Thread1of1ForFork0_plus_#t~short30#1_141|, ~B~0.offset=v_~B~0.offset_71, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_53|} AuxVars[|v_thread2Thread1of1ForFork0_plus_#t~short31#1_150|, |v_thread2Thread1of1ForFork0_#t~mem5#1_58|, |v_thread2Thread1of1ForFork0_plus_#t~short30#1_143|, |v_thread2Thread1of1ForFork0_plus_#t~short30#1_144|, |v_thread2Thread1of1ForFork0_plus_#t~short30#1_142|, |v_thread2Thread1of1ForFork0_plus_#t~short31#1_148|, |v_thread2Thread1of1ForFork0_plus_#t~short31#1_149|, |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_plus_#t~short31#1, ~bsum~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_plus_#t~short30#1, thread2Thread1of1ForFork0_#t~ret6#1][96], [Black: 511#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 510#(<= ~N~0 0), 447#true, 70#L50-7true, 496#(= |thread1Thread1of1ForFork2_~i~0#1| 0), 517#true, 25#thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 461#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483647), 396#thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 450#(<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1), Black: 465#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483646), 282#L86-1true, 507#true, Black: 501#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 439#(= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)]) [2023-08-27 00:39:58,105 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 00:39:58,105 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 00:39:58,105 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 00:39:58,105 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 00:39:59,285 INFO L124 PetriNetUnfolderBase]: 24222/30993 cut-off events. [2023-08-27 00:39:59,286 INFO L125 PetriNetUnfolderBase]: For 9334/10299 co-relation queries the response was YES. [2023-08-27 00:39:59,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74451 conditions, 30993 events. 24222/30993 cut-off events. For 9334/10299 co-relation queries the response was YES. Maximal size of possible extension queue 2064. Compared 172534 event pairs, 13837 based on Foata normal form. 959/11266 useless extension candidates. Maximal degree in co-relation 74361. Up to 16909 conditions per place. [2023-08-27 00:39:59,398 INFO L140 encePairwiseOnDemand]: 1065/1074 looper letters, 102 selfloop transitions, 28 changer transitions 0/134 dead transitions. [2023-08-27 00:39:59,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 134 transitions, 856 flow [2023-08-27 00:39:59,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 00:39:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 00:39:59,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3589 transitions. [2023-08-27 00:39:59,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3713014690668322 [2023-08-27 00:39:59,405 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3589 transitions. [2023-08-27 00:39:59,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3589 transitions. [2023-08-27 00:39:59,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:39:59,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3589 transitions. [2023-08-27 00:39:59,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 398.77777777777777) internal successors, (3589), 9 states have internal predecessors, (3589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:59,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 1074.0) internal successors, (10740), 10 states have internal predecessors, (10740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:59,418 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 1074.0) internal successors, (10740), 10 states have internal predecessors, (10740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:59,418 INFO L175 Difference]: Start difference. First operand has 73 places, 84 transitions, 418 flow. Second operand 9 states and 3589 transitions. [2023-08-27 00:39:59,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 134 transitions, 856 flow [2023-08-27 00:39:59,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 134 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 00:39:59,422 INFO L231 Difference]: Finished difference. Result has 79 places, 90 transitions, 502 flow [2023-08-27 00:39:59,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=502, PETRI_PLACES=79, PETRI_TRANSITIONS=90} [2023-08-27 00:39:59,423 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 5 predicate places. [2023-08-27 00:39:59,423 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 90 transitions, 502 flow [2023-08-27 00:39:59,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 387.26666666666665) internal successors, (5809), 15 states have internal predecessors, (5809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:59,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:39:59,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:39:59,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-27 00:39:59,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:39:59,629 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:39:59,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:39:59,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1166182728, now seen corresponding path program 1 times [2023-08-27 00:39:59,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:39:59,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566755909] [2023-08-27 00:39:59,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:39:59,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:39:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:39:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:39:59,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:39:59,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566755909] [2023-08-27 00:39:59,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566755909] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:39:59,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:39:59,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 00:39:59,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250388080] [2023-08-27 00:39:59,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:39:59,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 00:39:59,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:39:59,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 00:39:59,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 00:39:59,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 1074 [2023-08-27 00:39:59,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 90 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:39:59,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:39:59,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 1074 [2023-08-27 00:39:59,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:40:05,673 INFO L124 PetriNetUnfolderBase]: 29322/38393 cut-off events. [2023-08-27 00:40:05,673 INFO L125 PetriNetUnfolderBase]: For 11136/12447 co-relation queries the response was YES. [2023-08-27 00:40:05,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93086 conditions, 38393 events. 29322/38393 cut-off events. For 11136/12447 co-relation queries the response was YES. Maximal size of possible extension queue 3010. Compared 236572 event pairs, 5919 based on Foata normal form. 1306/14686 useless extension candidates. Maximal degree in co-relation 92993. Up to 27101 conditions per place. [2023-08-27 00:40:05,828 INFO L140 encePairwiseOnDemand]: 1066/1074 looper letters, 120 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2023-08-27 00:40:05,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 128 transitions, 868 flow [2023-08-27 00:40:05,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 00:40:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 00:40:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1377 transitions. [2023-08-27 00:40:05,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4273743016759777 [2023-08-27 00:40:05,831 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1377 transitions. [2023-08-27 00:40:05,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1377 transitions. [2023-08-27 00:40:05,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:40:05,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1377 transitions. [2023-08-27 00:40:05,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 459.0) internal successors, (1377), 3 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:05,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:05,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:05,836 INFO L175 Difference]: Start difference. First operand has 79 places, 90 transitions, 502 flow. Second operand 3 states and 1377 transitions. [2023-08-27 00:40:05,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 128 transitions, 868 flow [2023-08-27 00:40:05,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 128 transitions, 799 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-27 00:40:05,842 INFO L231 Difference]: Finished difference. Result has 77 places, 93 transitions, 469 flow [2023-08-27 00:40:05,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=77, PETRI_TRANSITIONS=93} [2023-08-27 00:40:05,842 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 3 predicate places. [2023-08-27 00:40:05,842 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 93 transitions, 469 flow [2023-08-27 00:40:05,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:05,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:40:05,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:40:05,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 00:40:05,843 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:40:05,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:40:05,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1791924310, now seen corresponding path program 1 times [2023-08-27 00:40:05,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:40:05,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14350450] [2023-08-27 00:40:05,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:40:05,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:40:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:40:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:40:05,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:40:05,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14350450] [2023-08-27 00:40:05,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14350450] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:40:05,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:40:05,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 00:40:05,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327423572] [2023-08-27 00:40:05,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:40:05,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 00:40:05,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:40:05,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 00:40:05,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 00:40:05,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 1074 [2023-08-27 00:40:05,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 93 transitions, 469 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:05,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:40:05,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 1074 [2023-08-27 00:40:05,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:40:12,223 INFO L124 PetriNetUnfolderBase]: 28843/37898 cut-off events. [2023-08-27 00:40:12,223 INFO L125 PetriNetUnfolderBase]: For 11889/13359 co-relation queries the response was YES. [2023-08-27 00:40:12,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98041 conditions, 37898 events. 28843/37898 cut-off events. For 11889/13359 co-relation queries the response was YES. Maximal size of possible extension queue 3234. Compared 240193 event pairs, 4432 based on Foata normal form. 1315/16953 useless extension candidates. Maximal degree in co-relation 97954. Up to 29284 conditions per place. [2023-08-27 00:40:12,379 INFO L140 encePairwiseOnDemand]: 1071/1074 looper letters, 112 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2023-08-27 00:40:12,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 117 transitions, 776 flow [2023-08-27 00:40:12,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 00:40:12,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 00:40:12,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1353 transitions. [2023-08-27 00:40:12,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.419925512104283 [2023-08-27 00:40:12,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1353 transitions. [2023-08-27 00:40:12,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1353 transitions. [2023-08-27 00:40:12,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:40:12,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1353 transitions. [2023-08-27 00:40:12,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 451.0) internal successors, (1353), 3 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:12,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:12,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:12,387 INFO L175 Difference]: Start difference. First operand has 77 places, 93 transitions, 469 flow. Second operand 3 states and 1353 transitions. [2023-08-27 00:40:12,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 117 transitions, 776 flow [2023-08-27 00:40:12,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 117 transitions, 773 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 00:40:12,397 INFO L231 Difference]: Finished difference. Result has 77 places, 91 transitions, 461 flow [2023-08-27 00:40:12,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=457, 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=461, PETRI_PLACES=77, PETRI_TRANSITIONS=91} [2023-08-27 00:40:12,398 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 3 predicate places. [2023-08-27 00:40:12,398 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 91 transitions, 461 flow [2023-08-27 00:40:12,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:12,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:40:12,399 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1] [2023-08-27 00:40:12,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 00:40:12,399 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:40:12,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:40:12,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1577426782, now seen corresponding path program 2 times [2023-08-27 00:40:12,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:40:12,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781360635] [2023-08-27 00:40:12,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:40:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:40:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:40:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-27 00:40:12,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:40:12,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781360635] [2023-08-27 00:40:12,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781360635] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:40:12,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065197783] [2023-08-27 00:40:12,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 00:40:12,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:40:12,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:40:12,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:40:12,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-27 00:40:12,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-27 00:40:12,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:40:12,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-27 00:40:12,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:40:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-27 00:40:12,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 00:40:12,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065197783] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:40:12,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 00:40:12,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2023-08-27 00:40:12,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612925472] [2023-08-27 00:40:12,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:40:12,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 00:40:12,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:40:12,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 00:40:12,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-27 00:40:12,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 1074 [2023-08-27 00:40:12,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 91 transitions, 461 flow. Second operand has 4 states, 4 states have (on average 402.25) internal successors, (1609), 4 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:12,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:40:12,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 1074 [2023-08-27 00:40:12,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:40:16,630 INFO L124 PetriNetUnfolderBase]: 19373/25938 cut-off events. [2023-08-27 00:40:16,630 INFO L125 PetriNetUnfolderBase]: For 15533/16949 co-relation queries the response was YES. [2023-08-27 00:40:16,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63061 conditions, 25938 events. 19373/25938 cut-off events. For 15533/16949 co-relation queries the response was YES. Maximal size of possible extension queue 2292. Compared 163285 event pairs, 13186 based on Foata normal form. 3073/13571 useless extension candidates. Maximal degree in co-relation 62986. Up to 25839 conditions per place. [2023-08-27 00:40:16,717 INFO L140 encePairwiseOnDemand]: 1068/1074 looper letters, 80 selfloop transitions, 1 changer transitions 0/85 dead transitions. [2023-08-27 00:40:16,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 85 transitions, 577 flow [2023-08-27 00:40:16,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 00:40:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 00:40:16,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1253 transitions. [2023-08-27 00:40:16,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2023-08-27 00:40:16,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1253 transitions. [2023-08-27 00:40:16,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1253 transitions. [2023-08-27 00:40:16,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:40:16,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1253 transitions. [2023-08-27 00:40:16,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 417.6666666666667) internal successors, (1253), 3 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:16,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:16,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:16,724 INFO L175 Difference]: Start difference. First operand has 77 places, 91 transitions, 461 flow. Second operand 3 states and 1253 transitions. [2023-08-27 00:40:16,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 85 transitions, 577 flow [2023-08-27 00:40:16,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 529 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-27 00:40:16,728 INFO L231 Difference]: Finished difference. Result has 68 places, 85 transitions, 369 flow [2023-08-27 00:40:16,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=68, PETRI_TRANSITIONS=85} [2023-08-27 00:40:16,729 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-08-27 00:40:16,729 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 85 transitions, 369 flow [2023-08-27 00:40:16,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 402.25) internal successors, (1609), 4 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:16,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:40:16,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:40:16,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-27 00:40:16,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:40:16,934 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:40:16,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:40:16,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1166182837, now seen corresponding path program 1 times [2023-08-27 00:40:16,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:40:16,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602607050] [2023-08-27 00:40:16,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:40:16,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:40:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:40:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:40:17,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:40:17,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602607050] [2023-08-27 00:40:17,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602607050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:40:17,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:40:17,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 00:40:17,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271578688] [2023-08-27 00:40:17,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:40:17,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 00:40:17,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:40:17,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 00:40:17,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 00:40:17,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 1074 [2023-08-27 00:40:17,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 85 transitions, 369 flow. Second operand has 5 states, 5 states have (on average 382.8) internal successors, (1914), 5 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:17,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:40:17,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 1074 [2023-08-27 00:40:17,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:40:20,711 INFO L124 PetriNetUnfolderBase]: 20262/26905 cut-off events. [2023-08-27 00:40:20,711 INFO L125 PetriNetUnfolderBase]: For 4278/4950 co-relation queries the response was YES. [2023-08-27 00:40:20,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63854 conditions, 26905 events. 20262/26905 cut-off events. For 4278/4950 co-relation queries the response was YES. Maximal size of possible extension queue 1964. Compared 160637 event pairs, 13537 based on Foata normal form. 736/10716 useless extension candidates. Maximal degree in co-relation 63838. Up to 26161 conditions per place. [2023-08-27 00:40:20,791 INFO L140 encePairwiseOnDemand]: 1062/1074 looper letters, 99 selfloop transitions, 23 changer transitions 0/125 dead transitions. [2023-08-27 00:40:20,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 125 transitions, 707 flow [2023-08-27 00:40:20,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 00:40:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 00:40:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2384 transitions. [2023-08-27 00:40:20,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36995654872749845 [2023-08-27 00:40:20,795 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2384 transitions. [2023-08-27 00:40:20,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2384 transitions. [2023-08-27 00:40:20,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:40:20,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2384 transitions. [2023-08-27 00:40:20,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 397.3333333333333) internal successors, (2384), 6 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:20,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1074.0) internal successors, (7518), 7 states have internal predecessors, (7518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:20,802 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1074.0) internal successors, (7518), 7 states have internal predecessors, (7518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:20,802 INFO L175 Difference]: Start difference. First operand has 68 places, 85 transitions, 369 flow. Second operand 6 states and 2384 transitions. [2023-08-27 00:40:20,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 125 transitions, 707 flow [2023-08-27 00:40:20,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 125 transitions, 706 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 00:40:20,805 INFO L231 Difference]: Finished difference. Result has 74 places, 87 transitions, 435 flow [2023-08-27 00:40:20,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=435, PETRI_PLACES=74, PETRI_TRANSITIONS=87} [2023-08-27 00:40:20,805 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-08-27 00:40:20,806 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 87 transitions, 435 flow [2023-08-27 00:40:20,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 382.8) internal successors, (1914), 5 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:20,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:40:20,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:40:20,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 00:40:20,806 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:40:20,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:40:20,806 INFO L85 PathProgramCache]: Analyzing trace with hash 357779749, now seen corresponding path program 1 times [2023-08-27 00:40:20,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:40:20,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795926781] [2023-08-27 00:40:20,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:40:20,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:40:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:40:20,865 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-27 00:40:20,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:40:20,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795926781] [2023-08-27 00:40:20,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795926781] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:40:20,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:40:20,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 00:40:20,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061114752] [2023-08-27 00:40:20,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:40:20,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 00:40:20,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:40:20,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 00:40:20,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 00:40:20,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 1074 [2023-08-27 00:40:20,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 87 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:20,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:40:20,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 1074 [2023-08-27 00:40:20,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:40:24,172 INFO L124 PetriNetUnfolderBase]: 17792/23859 cut-off events. [2023-08-27 00:40:24,172 INFO L125 PetriNetUnfolderBase]: For 5683/6359 co-relation queries the response was YES. [2023-08-27 00:40:24,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60129 conditions, 23859 events. 17792/23859 cut-off events. For 5683/6359 co-relation queries the response was YES. Maximal size of possible extension queue 2110. Compared 152298 event pairs, 4457 based on Foata normal form. 676/9582 useless extension candidates. Maximal degree in co-relation 60110. Up to 15135 conditions per place. [2023-08-27 00:40:24,261 INFO L140 encePairwiseOnDemand]: 1068/1074 looper letters, 111 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2023-08-27 00:40:24,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 752 flow [2023-08-27 00:40:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 00:40:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 00:40:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2023-08-27 00:40:24,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4245810055865922 [2023-08-27 00:40:24,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1368 transitions. [2023-08-27 00:40:24,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1368 transitions. [2023-08-27 00:40:24,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:40:24,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1368 transitions. [2023-08-27 00:40:24,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:24,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:24,268 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:24,268 INFO L175 Difference]: Start difference. First operand has 74 places, 87 transitions, 435 flow. Second operand 3 states and 1368 transitions. [2023-08-27 00:40:24,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 752 flow [2023-08-27 00:40:24,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 118 transitions, 713 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 00:40:24,271 INFO L231 Difference]: Finished difference. Result has 74 places, 87 transitions, 410 flow [2023-08-27 00:40:24,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=74, PETRI_TRANSITIONS=87} [2023-08-27 00:40:24,272 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-08-27 00:40:24,272 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 87 transitions, 410 flow [2023-08-27 00:40:24,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:24,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:40:24,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:40:24,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 00:40:24,273 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:40:24,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:40:24,273 INFO L85 PathProgramCache]: Analyzing trace with hash 357779649, now seen corresponding path program 1 times [2023-08-27 00:40:24,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:40:24,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179345882] [2023-08-27 00:40:24,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:40:24,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:40:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:40:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:40:24,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:40:24,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179345882] [2023-08-27 00:40:24,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179345882] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:40:24,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176990575] [2023-08-27 00:40:24,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:40:24,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:40:24,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:40:24,687 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:40:24,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-27 00:40:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:40:24,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-27 00:40:24,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:40:24,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:40:24,865 INFO L322 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2023-08-27 00:40:24,865 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-27 00:40:24,893 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-27 00:40:24,930 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-27 00:40:24,931 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-27 00:40:24,958 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-27 00:40:24,989 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:40:24,989 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:40:25,011 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-27 00:40:25,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:40:25,029 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-27 00:40:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:40:25,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:40:25,069 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_454 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_454) c_~A~0.base) c_~A~0.offset)))) is different from false [2023-08-27 00:40:25,205 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:40:25,206 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 30 treesize of output 31 [2023-08-27 00:40:25,228 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:40:25,229 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 141 treesize of output 137 [2023-08-27 00:40:25,240 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 124 treesize of output 116 [2023-08-27 00:40:25,246 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 58 treesize of output 56 [2023-08-27 00:40:25,254 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 114 treesize of output 110 [2023-08-27 00:40:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 00:40:25,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176990575] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:40:25,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:40:25,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2023-08-27 00:40:25,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645866561] [2023-08-27 00:40:25,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:40:25,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-27 00:40:25,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:40:25,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-27 00:40:25,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=4, NotChecked=42, Total=552 [2023-08-27 00:40:25,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 1074 [2023-08-27 00:40:25,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 87 transitions, 410 flow. Second operand has 24 states, 24 states have (on average 368.125) internal successors, (8835), 24 states have internal predecessors, (8835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:25,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:40:25,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 1074 [2023-08-27 00:40:25,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:40:30,003 INFO L124 PetriNetUnfolderBase]: 23343/32120 cut-off events. [2023-08-27 00:40:30,003 INFO L125 PetriNetUnfolderBase]: For 12688/12848 co-relation queries the response was YES. [2023-08-27 00:40:30,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82295 conditions, 32120 events. 23343/32120 cut-off events. For 12688/12848 co-relation queries the response was YES. Maximal size of possible extension queue 2636. Compared 222393 event pairs, 9578 based on Foata normal form. 160/13293 useless extension candidates. Maximal degree in co-relation 82275. Up to 22843 conditions per place. [2023-08-27 00:40:30,132 INFO L140 encePairwiseOnDemand]: 1061/1074 looper letters, 98 selfloop transitions, 24 changer transitions 0/125 dead transitions. [2023-08-27 00:40:30,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 125 transitions, 804 flow [2023-08-27 00:40:30,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 00:40:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 00:40:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3021 transitions. [2023-08-27 00:40:30,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35160614525139666 [2023-08-27 00:40:30,136 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 3021 transitions. [2023-08-27 00:40:30,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 3021 transitions. [2023-08-27 00:40:30,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:40:30,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 3021 transitions. [2023-08-27 00:40:30,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 377.625) internal successors, (3021), 8 states have internal predecessors, (3021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:30,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 1074.0) internal successors, (9666), 9 states have internal predecessors, (9666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:30,144 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 1074.0) internal successors, (9666), 9 states have internal predecessors, (9666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:30,144 INFO L175 Difference]: Start difference. First operand has 74 places, 87 transitions, 410 flow. Second operand 8 states and 3021 transitions. [2023-08-27 00:40:30,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 125 transitions, 804 flow [2023-08-27 00:40:30,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 125 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 00:40:30,159 INFO L231 Difference]: Finished difference. Result has 82 places, 101 transitions, 564 flow [2023-08-27 00:40:30,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=564, PETRI_PLACES=82, PETRI_TRANSITIONS=101} [2023-08-27 00:40:30,160 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 8 predicate places. [2023-08-27 00:40:30,160 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 101 transitions, 564 flow [2023-08-27 00:40:30,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 368.125) internal successors, (8835), 24 states have internal predecessors, (8835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:30,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:40:30,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:40:30,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-27 00:40:30,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-27 00:40:30,367 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:40:30,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:40:30,367 INFO L85 PathProgramCache]: Analyzing trace with hash 357779748, now seen corresponding path program 1 times [2023-08-27 00:40:30,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:40:30,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145702936] [2023-08-27 00:40:30,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:40:30,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:40:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:40:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:40:30,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:40:30,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145702936] [2023-08-27 00:40:30,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145702936] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:40:30,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545090638] [2023-08-27 00:40:30,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:40:30,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:40:30,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:40:30,669 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:40:30,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-27 00:40:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:40:30,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-27 00:40:30,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:40:30,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:40:30,836 INFO L322 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2023-08-27 00:40:30,836 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-27 00:40:30,860 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-27 00:40:30,893 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-27 00:40:30,894 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-27 00:40:30,921 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:40:30,946 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:40:30,946 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:40:30,969 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:40:30,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:40:30,991 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:40:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:40:31,000 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:40:31,029 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_516) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2023-08-27 00:40:31,034 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_515 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_515) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_516) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2023-08-27 00:40:31,115 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:40:31,115 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 28 treesize of output 29 [2023-08-27 00:40:31,125 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:40:31,125 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 977 treesize of output 945 [2023-08-27 00:40:31,136 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 53 treesize of output 51 [2023-08-27 00:40:31,141 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 51 treesize of output 47 [2023-08-27 00:40:31,148 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 54 treesize of output 46 [2023-08-27 00:40:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 00:40:31,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545090638] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:40:31,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:40:31,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2023-08-27 00:40:31,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413720883] [2023-08-27 00:40:31,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:40:31,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-27 00:40:31,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:40:31,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-27 00:40:31,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=371, Unknown=3, NotChecked=82, Total=552 [2023-08-27 00:40:31,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 1074 [2023-08-27 00:40:31,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 101 transitions, 564 flow. Second operand has 24 states, 24 states have (on average 368.125) internal successors, (8835), 24 states have internal predecessors, (8835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:31,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:40:31,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 1074 [2023-08-27 00:40:31,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:40:36,230 INFO L124 PetriNetUnfolderBase]: 24893/34509 cut-off events. [2023-08-27 00:40:36,230 INFO L125 PetriNetUnfolderBase]: For 25232/25386 co-relation queries the response was YES. [2023-08-27 00:40:36,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92494 conditions, 34509 events. 24893/34509 cut-off events. For 25232/25386 co-relation queries the response was YES. Maximal size of possible extension queue 3344. Compared 248619 event pairs, 10586 based on Foata normal form. 156/15016 useless extension candidates. Maximal degree in co-relation 92471. Up to 25201 conditions per place. [2023-08-27 00:40:36,382 INFO L140 encePairwiseOnDemand]: 1061/1074 looper letters, 98 selfloop transitions, 27 changer transitions 0/128 dead transitions. [2023-08-27 00:40:36,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 128 transitions, 909 flow [2023-08-27 00:40:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 00:40:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 00:40:36,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3020 transitions. [2023-08-27 00:40:36,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3514897579143389 [2023-08-27 00:40:36,386 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 3020 transitions. [2023-08-27 00:40:36,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 3020 transitions. [2023-08-27 00:40:36,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:40:36,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 3020 transitions. [2023-08-27 00:40:36,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 377.5) internal successors, (3020), 8 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:36,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 1074.0) internal successors, (9666), 9 states have internal predecessors, (9666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:36,394 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 1074.0) internal successors, (9666), 9 states have internal predecessors, (9666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:36,394 INFO L175 Difference]: Start difference. First operand has 82 places, 101 transitions, 564 flow. Second operand 8 states and 3020 transitions. [2023-08-27 00:40:36,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 128 transitions, 909 flow [2023-08-27 00:40:36,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 128 transitions, 905 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-27 00:40:36,410 INFO L231 Difference]: Finished difference. Result has 90 places, 105 transitions, 642 flow [2023-08-27 00:40:36,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=642, PETRI_PLACES=90, PETRI_TRANSITIONS=105} [2023-08-27 00:40:36,411 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 16 predicate places. [2023-08-27 00:40:36,411 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 105 transitions, 642 flow [2023-08-27 00:40:36,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 368.125) internal successors, (8835), 24 states have internal predecessors, (8835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:36,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:40:36,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:40:36,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-27 00:40:36,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-27 00:40:36,612 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:40:36,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:40:36,613 INFO L85 PathProgramCache]: Analyzing trace with hash 302052195, now seen corresponding path program 1 times [2023-08-27 00:40:36,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:40:36,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076957065] [2023-08-27 00:40:36,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:40:36,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:40:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:40:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:40:36,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:40:36,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076957065] [2023-08-27 00:40:36,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076957065] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:40:36,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:40:36,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 00:40:36,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101060508] [2023-08-27 00:40:36,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:40:36,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 00:40:36,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:40:36,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 00:40:36,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 00:40:36,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 1074 [2023-08-27 00:40:36,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 105 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:36,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:40:36,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 1074 [2023-08-27 00:40:36,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:40:41,588 INFO L124 PetriNetUnfolderBase]: 27893/41435 cut-off events. [2023-08-27 00:40:41,589 INFO L125 PetriNetUnfolderBase]: For 68402/70243 co-relation queries the response was YES. [2023-08-27 00:40:41,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118250 conditions, 41435 events. 27893/41435 cut-off events. For 68402/70243 co-relation queries the response was YES. Maximal size of possible extension queue 3514. Compared 341867 event pairs, 9166 based on Foata normal form. 1841/21861 useless extension candidates. Maximal degree in co-relation 118224. Up to 24725 conditions per place. [2023-08-27 00:40:41,806 INFO L140 encePairwiseOnDemand]: 1069/1074 looper letters, 131 selfloop transitions, 3 changer transitions 0/141 dead transitions. [2023-08-27 00:40:41,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 141 transitions, 1078 flow [2023-08-27 00:40:41,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 00:40:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 00:40:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1365 transitions. [2023-08-27 00:40:41,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236499068901304 [2023-08-27 00:40:41,808 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1365 transitions. [2023-08-27 00:40:41,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1365 transitions. [2023-08-27 00:40:41,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:40:41,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1365 transitions. [2023-08-27 00:40:41,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:41,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:41,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:41,812 INFO L175 Difference]: Start difference. First operand has 90 places, 105 transitions, 642 flow. Second operand 3 states and 1365 transitions. [2023-08-27 00:40:41,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 141 transitions, 1078 flow [2023-08-27 00:40:41,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 141 transitions, 1062 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-27 00:40:41,831 INFO L231 Difference]: Finished difference. Result has 90 places, 107 transitions, 647 flow [2023-08-27 00:40:41,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=647, PETRI_PLACES=90, PETRI_TRANSITIONS=107} [2023-08-27 00:40:41,832 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 16 predicate places. [2023-08-27 00:40:41,832 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 107 transitions, 647 flow [2023-08-27 00:40:41,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:41,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:40:41,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:40:41,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 00:40:41,832 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:40:41,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:40:41,833 INFO L85 PathProgramCache]: Analyzing trace with hash 302052106, now seen corresponding path program 1 times [2023-08-27 00:40:41,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:40:41,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345061028] [2023-08-27 00:40:41,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:40:41,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:40:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:40:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:40:41,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:40:41,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345061028] [2023-08-27 00:40:41,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345061028] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:40:41,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:40:41,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 00:40:41,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104979552] [2023-08-27 00:40:41,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:40:41,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 00:40:41,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:40:41,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 00:40:41,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 00:40:41,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 1074 [2023-08-27 00:40:41,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 107 transitions, 647 flow. Second operand has 5 states, 5 states have (on average 380.2) internal successors, (1901), 5 states have internal predecessors, (1901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:41,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:40:41,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 1074 [2023-08-27 00:40:41,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:40:47,702 INFO L124 PetriNetUnfolderBase]: 30259/44917 cut-off events. [2023-08-27 00:40:47,702 INFO L125 PetriNetUnfolderBase]: For 61895/62028 co-relation queries the response was YES. [2023-08-27 00:40:47,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134532 conditions, 44917 events. 30259/44917 cut-off events. For 61895/62028 co-relation queries the response was YES. Maximal size of possible extension queue 3105. Compared 344159 event pairs, 24924 based on Foata normal form. 151/24191 useless extension candidates. Maximal degree in co-relation 134504. Up to 44711 conditions per place. [2023-08-27 00:40:47,931 INFO L140 encePairwiseOnDemand]: 1059/1074 looper letters, 100 selfloop transitions, 23 changer transitions 0/129 dead transitions. [2023-08-27 00:40:47,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 129 transitions, 970 flow [2023-08-27 00:40:47,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 00:40:47,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 00:40:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2351 transitions. [2023-08-27 00:40:47,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3648355058969584 [2023-08-27 00:40:47,934 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2351 transitions. [2023-08-27 00:40:47,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2351 transitions. [2023-08-27 00:40:47,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:40:47,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2351 transitions. [2023-08-27 00:40:47,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 391.8333333333333) internal successors, (2351), 6 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:47,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1074.0) internal successors, (7518), 7 states have internal predecessors, (7518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:47,940 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1074.0) internal successors, (7518), 7 states have internal predecessors, (7518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:47,940 INFO L175 Difference]: Start difference. First operand has 90 places, 107 transitions, 647 flow. Second operand 6 states and 2351 transitions. [2023-08-27 00:40:47,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 129 transitions, 970 flow [2023-08-27 00:40:47,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 129 transitions, 967 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 00:40:47,962 INFO L231 Difference]: Finished difference. Result has 96 places, 109 transitions, 717 flow [2023-08-27 00:40:47,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=717, PETRI_PLACES=96, PETRI_TRANSITIONS=109} [2023-08-27 00:40:47,962 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 22 predicate places. [2023-08-27 00:40:47,962 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 109 transitions, 717 flow [2023-08-27 00:40:47,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 380.2) internal successors, (1901), 5 states have internal predecessors, (1901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:47,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:40:47,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:40:47,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 00:40:47,963 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:40:47,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:40:47,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1793733579, now seen corresponding path program 1 times [2023-08-27 00:40:47,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:40:47,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970972391] [2023-08-27 00:40:47,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:40:47,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:40:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:40:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:40:48,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:40:48,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970972391] [2023-08-27 00:40:48,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970972391] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:40:48,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122168292] [2023-08-27 00:40:48,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:40:48,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:40:48,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:40:48,497 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:40:48,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-27 00:40:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:40:48,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-27 00:40:48,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:40:48,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:40:48,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:40:48,675 INFO L322 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2023-08-27 00:40:48,675 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-27 00:40:48,706 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-27 00:40:48,744 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-27 00:40:48,744 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-27 00:40:48,782 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:40:48,807 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:40:48,807 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:40:48,836 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:40:48,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:40:48,862 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:40:48,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:40:48,906 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:40:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:40:48,912 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:40:48,929 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_633 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_633) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 4294967296)) is different from false [2023-08-27 00:40:49,076 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:40:49,077 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 31 treesize of output 32 [2023-08-27 00:40:49,085 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:40:49,085 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 969 treesize of output 953 [2023-08-27 00:40:49,097 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 228 treesize of output 224 [2023-08-27 00:40:49,102 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 224 treesize of output 208 [2023-08-27 00:40:49,109 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 104 treesize of output 102 [2023-08-27 00:40:49,115 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 206 treesize of output 198 [2023-08-27 00:40:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:40:49,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122168292] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:40:49,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:40:49,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2023-08-27 00:40:49,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269906457] [2023-08-27 00:40:49,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:40:49,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-27 00:40:49,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:40:49,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-27 00:40:49,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=565, Unknown=11, NotChecked=50, Total=756 [2023-08-27 00:40:49,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 1074 [2023-08-27 00:40:49,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 109 transitions, 717 flow. Second operand has 28 states, 28 states have (on average 367.14285714285717) internal successors, (10280), 28 states have internal predecessors, (10280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:49,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:40:49,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 1074 [2023-08-27 00:40:49,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:40:55,297 INFO L124 PetriNetUnfolderBase]: 28123/41480 cut-off events. [2023-08-27 00:40:55,298 INFO L125 PetriNetUnfolderBase]: For 60569/60613 co-relation queries the response was YES. [2023-08-27 00:40:55,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134536 conditions, 41480 events. 28123/41480 cut-off events. For 60569/60613 co-relation queries the response was YES. Maximal size of possible extension queue 3863. Compared 333218 event pairs, 6883 based on Foata normal form. 66/21747 useless extension candidates. Maximal degree in co-relation 134505. Up to 29563 conditions per place. [2023-08-27 00:40:55,523 INFO L140 encePairwiseOnDemand]: 1062/1074 looper letters, 134 selfloop transitions, 36 changer transitions 0/174 dead transitions. [2023-08-27 00:40:55,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 174 transitions, 1404 flow [2023-08-27 00:40:55,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 00:40:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 00:40:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3035 transitions. [2023-08-27 00:40:55,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35323556797020483 [2023-08-27 00:40:55,527 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 3035 transitions. [2023-08-27 00:40:55,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 3035 transitions. [2023-08-27 00:40:55,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:40:55,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 3035 transitions. [2023-08-27 00:40:55,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 379.375) internal successors, (3035), 8 states have internal predecessors, (3035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:55,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 1074.0) internal successors, (9666), 9 states have internal predecessors, (9666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:55,534 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 1074.0) internal successors, (9666), 9 states have internal predecessors, (9666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:55,534 INFO L175 Difference]: Start difference. First operand has 96 places, 109 transitions, 717 flow. Second operand 8 states and 3035 transitions. [2023-08-27 00:40:55,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 174 transitions, 1404 flow [2023-08-27 00:40:55,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 174 transitions, 1364 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 00:40:55,717 INFO L231 Difference]: Finished difference. Result has 102 places, 123 transitions, 924 flow [2023-08-27 00:40:55,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=924, PETRI_PLACES=102, PETRI_TRANSITIONS=123} [2023-08-27 00:40:55,718 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 28 predicate places. [2023-08-27 00:40:55,718 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 123 transitions, 924 flow [2023-08-27 00:40:55,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 367.14285714285717) internal successors, (10280), 28 states have internal predecessors, (10280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:55,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:40:55,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:40:55,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-27 00:40:55,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:40:55,919 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:40:55,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:40:55,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1793140338, now seen corresponding path program 1 times [2023-08-27 00:40:55,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:40:55,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351015185] [2023-08-27 00:40:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:40:55,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:40:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:40:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:40:56,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:40:56,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351015185] [2023-08-27 00:40:56,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351015185] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:40:56,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122002876] [2023-08-27 00:40:56,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:40:56,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:40:56,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:40:56,269 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:40:56,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-27 00:40:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:40:56,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-27 00:40:56,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:40:56,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:40:56,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:40:56,441 INFO L322 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2023-08-27 00:40:56,443 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-27 00:40:56,476 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-27 00:40:56,518 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-27 00:40:56,519 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-27 00:40:56,545 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-27 00:40:56,580 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:40:56,580 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:40:56,741 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-27 00:40:56,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:40:56,762 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-27 00:40:56,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:40:56,783 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-27 00:40:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:40:56,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:40:56,979 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:40:56,980 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 33 treesize of output 34 [2023-08-27 00:40:56,987 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:40:56,987 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 277 treesize of output 273 [2023-08-27 00:40:56,992 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 260 treesize of output 244 [2023-08-27 00:40:57,000 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 244 treesize of output 240 [2023-08-27 00:40:57,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 240 treesize of output 232 [2023-08-27 00:40:57,017 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 116 treesize of output 114 [2023-08-27 00:40:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:40:57,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122002876] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:40:57,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:40:57,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2023-08-27 00:40:57,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024530178] [2023-08-27 00:40:57,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:40:57,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-27 00:40:57,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:40:57,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-27 00:40:57,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=545, Unknown=16, NotChecked=0, Total=702 [2023-08-27 00:40:57,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 1074 [2023-08-27 00:40:57,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 123 transitions, 924 flow. Second operand has 27 states, 27 states have (on average 367.14814814814815) internal successors, (9913), 27 states have internal predecessors, (9913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:40:57,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:40:57,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 1074 [2023-08-27 00:40:57,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:41:02,979 INFO L124 PetriNetUnfolderBase]: 27121/39654 cut-off events. [2023-08-27 00:41:02,979 INFO L125 PetriNetUnfolderBase]: For 89978/90024 co-relation queries the response was YES. [2023-08-27 00:41:03,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136363 conditions, 39654 events. 27121/39654 cut-off events. For 89978/90024 co-relation queries the response was YES. Maximal size of possible extension queue 3147. Compared 310235 event pairs, 14217 based on Foata normal form. 68/21187 useless extension candidates. Maximal degree in co-relation 136330. Up to 27963 conditions per place. [2023-08-27 00:41:03,182 INFO L140 encePairwiseOnDemand]: 1062/1074 looper letters, 133 selfloop transitions, 37 changer transitions 0/174 dead transitions. [2023-08-27 00:41:03,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 174 transitions, 1486 flow [2023-08-27 00:41:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 00:41:03,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 00:41:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3034 transitions. [2023-08-27 00:41:03,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3531191806331471 [2023-08-27 00:41:03,186 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 3034 transitions. [2023-08-27 00:41:03,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 3034 transitions. [2023-08-27 00:41:03,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:41:03,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 3034 transitions. [2023-08-27 00:41:03,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 379.25) internal successors, (3034), 8 states have internal predecessors, (3034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:03,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 1074.0) internal successors, (9666), 9 states have internal predecessors, (9666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:03,193 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 1074.0) internal successors, (9666), 9 states have internal predecessors, (9666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:03,193 INFO L175 Difference]: Start difference. First operand has 102 places, 123 transitions, 924 flow. Second operand 8 states and 3034 transitions. [2023-08-27 00:41:03,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 174 transitions, 1486 flow [2023-08-27 00:41:03,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 174 transitions, 1462 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-27 00:41:03,247 INFO L231 Difference]: Finished difference. Result has 107 places, 124 transitions, 979 flow [2023-08-27 00:41:03,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=979, PETRI_PLACES=107, PETRI_TRANSITIONS=124} [2023-08-27 00:41:03,248 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 33 predicate places. [2023-08-27 00:41:03,248 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 124 transitions, 979 flow [2023-08-27 00:41:03,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 367.14814814814815) internal successors, (9913), 27 states have internal predecessors, (9913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:03,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:41:03,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:41:03,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-27 00:41:03,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:41:03,453 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:41:03,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:41:03,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1793727875, now seen corresponding path program 1 times [2023-08-27 00:41:03,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:41:03,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116026920] [2023-08-27 00:41:03,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:41:03,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:41:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:41:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:41:03,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:41:03,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116026920] [2023-08-27 00:41:03,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116026920] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:41:03,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409920658] [2023-08-27 00:41:03,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:41:03,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:41:03,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:41:03,544 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:41:03,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-27 00:41:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:41:03,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-27 00:41:03,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:41:03,738 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-27 00:41:03,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:41:03,780 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-27 00:41:03,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409920658] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:41:03,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:41:03,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-08-27 00:41:03,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206831233] [2023-08-27 00:41:03,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:41:03,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-27 00:41:03,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:41:03,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-27 00:41:03,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-08-27 00:41:03,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 1074 [2023-08-27 00:41:03,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 124 transitions, 979 flow. Second operand has 14 states, 14 states have (on average 382.57142857142856) internal successors, (5356), 14 states have internal predecessors, (5356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:03,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:41:03,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 1074 [2023-08-27 00:41:03,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:41:08,217 INFO L124 PetriNetUnfolderBase]: 20289/29687 cut-off events. [2023-08-27 00:41:08,217 INFO L125 PetriNetUnfolderBase]: For 78357/78411 co-relation queries the response was YES. [2023-08-27 00:41:08,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103665 conditions, 29687 events. 20289/29687 cut-off events. For 78357/78411 co-relation queries the response was YES. Maximal size of possible extension queue 2494. Compared 220378 event pairs, 13322 based on Foata normal form. 1342/17471 useless extension candidates. Maximal degree in co-relation 103631. Up to 19732 conditions per place. [2023-08-27 00:41:08,343 INFO L140 encePairwiseOnDemand]: 1059/1074 looper letters, 175 selfloop transitions, 41 changer transitions 0/220 dead transitions. [2023-08-27 00:41:08,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 220 transitions, 1918 flow [2023-08-27 00:41:08,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 00:41:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 00:41:08,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3576 transitions. [2023-08-27 00:41:08,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36995654872749845 [2023-08-27 00:41:08,348 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3576 transitions. [2023-08-27 00:41:08,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3576 transitions. [2023-08-27 00:41:08,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:41:08,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3576 transitions. [2023-08-27 00:41:08,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 397.3333333333333) internal successors, (3576), 9 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:08,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 1074.0) internal successors, (10740), 10 states have internal predecessors, (10740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:08,355 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 1074.0) internal successors, (10740), 10 states have internal predecessors, (10740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:08,356 INFO L175 Difference]: Start difference. First operand has 107 places, 124 transitions, 979 flow. Second operand 9 states and 3576 transitions. [2023-08-27 00:41:08,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 220 transitions, 1918 flow [2023-08-27 00:41:08,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 220 transitions, 1880 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-27 00:41:08,652 INFO L231 Difference]: Finished difference. Result has 115 places, 134 transitions, 1243 flow [2023-08-27 00:41:08,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1243, PETRI_PLACES=115, PETRI_TRANSITIONS=134} [2023-08-27 00:41:08,652 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 41 predicate places. [2023-08-27 00:41:08,652 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 134 transitions, 1243 flow [2023-08-27 00:41:08,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 382.57142857142856) internal successors, (5356), 14 states have internal predecessors, (5356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:08,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:41:08,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:41:08,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-27 00:41:08,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:41:08,857 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:41:08,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:41:08,858 INFO L85 PathProgramCache]: Analyzing trace with hash 247425607, now seen corresponding path program 1 times [2023-08-27 00:41:08,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:41:08,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009497509] [2023-08-27 00:41:08,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:41:08,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:41:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:41:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:41:09,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:41:09,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009497509] [2023-08-27 00:41:09,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009497509] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:41:09,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960267314] [2023-08-27 00:41:09,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:41:09,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:41:09,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:41:09,105 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:41:09,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-27 00:41:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:41:09,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 00:41:09,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:41:09,268 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-27 00:41:09,291 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-27 00:41:09,318 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:41:09,319 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:41:09,340 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-27 00:41:09,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:09,365 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-27 00:41:09,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:09,390 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-27 00:41:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:41:09,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:41:09,430 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_814) c_~B~0.base) c_~B~0.offset) 9223372039002259456))) is different from false [2023-08-27 00:41:09,504 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:41:09,504 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 30 treesize of output 31 [2023-08-27 00:41:09,511 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:41:09,511 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 1107 treesize of output 1075 [2023-08-27 00:41:09,520 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 61 treesize of output 59 [2023-08-27 00:41:09,524 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 59 treesize of output 55 [2023-08-27 00:41:09,529 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 62 treesize of output 54 [2023-08-27 00:41:09,603 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:41:09,603 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 29 treesize of output 34 [2023-08-27 00:41:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:41:09,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960267314] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:41:09,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:41:09,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-08-27 00:41:09,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746021224] [2023-08-27 00:41:09,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:41:09,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-27 00:41:09,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:41:09,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-27 00:41:09,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=370, Unknown=12, NotChecked=40, Total=506 [2023-08-27 00:41:09,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 1074 [2023-08-27 00:41:09,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 134 transitions, 1243 flow. Second operand has 23 states, 23 states have (on average 366.3478260869565) internal successors, (8426), 23 states have internal predecessors, (8426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:09,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:41:09,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 1074 [2023-08-27 00:41:09,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:41:16,059 INFO L124 PetriNetUnfolderBase]: 26892/40590 cut-off events. [2023-08-27 00:41:16,060 INFO L125 PetriNetUnfolderBase]: For 173381/174338 co-relation queries the response was YES. [2023-08-27 00:41:16,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154089 conditions, 40590 events. 26892/40590 cut-off events. For 173381/174338 co-relation queries the response was YES. Maximal size of possible extension queue 3813. Compared 331867 event pairs, 11341 based on Foata normal form. 954/23990 useless extension candidates. Maximal degree in co-relation 154051. Up to 28510 conditions per place. [2023-08-27 00:41:16,296 INFO L140 encePairwiseOnDemand]: 1059/1074 looper letters, 165 selfloop transitions, 57 changer transitions 0/233 dead transitions. [2023-08-27 00:41:16,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 233 transitions, 2570 flow [2023-08-27 00:41:16,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 00:41:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 00:41:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 4500 transitions. [2023-08-27 00:41:16,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34916201117318435 [2023-08-27 00:41:16,300 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 4500 transitions. [2023-08-27 00:41:16,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 4500 transitions. [2023-08-27 00:41:16,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:41:16,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 4500 transitions. [2023-08-27 00:41:16,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 375.0) internal successors, (4500), 12 states have internal predecessors, (4500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:16,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 1074.0) internal successors, (13962), 13 states have internal predecessors, (13962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:16,309 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 1074.0) internal successors, (13962), 13 states have internal predecessors, (13962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:16,309 INFO L175 Difference]: Start difference. First operand has 115 places, 134 transitions, 1243 flow. Second operand 12 states and 4500 transitions. [2023-08-27 00:41:16,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 233 transitions, 2570 flow [2023-08-27 00:41:16,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 233 transitions, 2509 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-08-27 00:41:16,535 INFO L231 Difference]: Finished difference. Result has 125 places, 165 transitions, 1582 flow [2023-08-27 00:41:16,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1582, PETRI_PLACES=125, PETRI_TRANSITIONS=165} [2023-08-27 00:41:16,535 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 51 predicate places. [2023-08-27 00:41:16,535 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 165 transitions, 1582 flow [2023-08-27 00:41:16,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 366.3478260869565) internal successors, (8426), 23 states have internal predecessors, (8426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:16,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:41:16,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:41:16,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-27 00:41:16,741 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,SelfDestructingSolverStorable20 [2023-08-27 00:41:16,741 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:41:16,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:41:16,742 INFO L85 PathProgramCache]: Analyzing trace with hash 247425657, now seen corresponding path program 1 times [2023-08-27 00:41:16,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:41:16,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837290010] [2023-08-27 00:41:16,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:41:16,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:41:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:41:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:41:16,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:41:16,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837290010] [2023-08-27 00:41:16,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837290010] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:41:16,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245367804] [2023-08-27 00:41:16,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:41:16,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:41:16,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:41:16,985 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:41:16,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-27 00:41:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:41:17,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 00:41:17,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:41:17,145 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-27 00:41:17,171 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-27 00:41:17,195 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:41:17,196 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:41:17,221 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:41:17,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:17,242 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:41:17,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:17,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:41:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:41:17,269 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:41:17,384 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:41:17,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 28 treesize of output 29 [2023-08-27 00:41:17,391 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:41:17,391 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 977 treesize of output 945 [2023-08-27 00:41:17,398 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 53 treesize of output 51 [2023-08-27 00:41:17,402 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 51 treesize of output 47 [2023-08-27 00:41:17,406 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 54 treesize of output 46 [2023-08-27 00:41:17,472 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:41:17,473 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 29 treesize of output 34 [2023-08-27 00:41:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:41:17,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245367804] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:41:17,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:41:17,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-08-27 00:41:17,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579070847] [2023-08-27 00:41:17,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:41:17,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-27 00:41:17,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:41:17,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-27 00:41:17,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=400, Unknown=16, NotChecked=0, Total=506 [2023-08-27 00:41:17,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 1074 [2023-08-27 00:41:17,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 165 transitions, 1582 flow. Second operand has 23 states, 23 states have (on average 366.3478260869565) internal successors, (8426), 23 states have internal predecessors, (8426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:17,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:41:17,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 1074 [2023-08-27 00:41:17,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:41:24,098 INFO L124 PetriNetUnfolderBase]: 26856/40534 cut-off events. [2023-08-27 00:41:24,098 INFO L125 PetriNetUnfolderBase]: For 186566/187509 co-relation queries the response was YES. [2023-08-27 00:41:24,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162551 conditions, 40534 events. 26856/40534 cut-off events. For 186566/187509 co-relation queries the response was YES. Maximal size of possible extension queue 3532. Compared 329010 event pairs, 11370 based on Foata normal form. 958/26587 useless extension candidates. Maximal degree in co-relation 162509. Up to 28485 conditions per place. [2023-08-27 00:41:24,399 INFO L140 encePairwiseOnDemand]: 1059/1074 looper letters, 164 selfloop transitions, 73 changer transitions 0/248 dead transitions. [2023-08-27 00:41:24,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 248 transitions, 2888 flow [2023-08-27 00:41:24,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 00:41:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 00:41:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 4499 transitions. [2023-08-27 00:41:24,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34908441961514586 [2023-08-27 00:41:24,403 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 4499 transitions. [2023-08-27 00:41:24,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 4499 transitions. [2023-08-27 00:41:24,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:41:24,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 4499 transitions. [2023-08-27 00:41:24,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 374.9166666666667) internal successors, (4499), 12 states have internal predecessors, (4499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:24,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 1074.0) internal successors, (13962), 13 states have internal predecessors, (13962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:24,412 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 1074.0) internal successors, (13962), 13 states have internal predecessors, (13962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:24,412 INFO L175 Difference]: Start difference. First operand has 125 places, 165 transitions, 1582 flow. Second operand 12 states and 4499 transitions. [2023-08-27 00:41:24,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 248 transitions, 2888 flow [2023-08-27 00:41:24,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 248 transitions, 2875 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-27 00:41:24,666 INFO L231 Difference]: Finished difference. Result has 135 places, 181 transitions, 1897 flow [2023-08-27 00:41:24,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1897, PETRI_PLACES=135, PETRI_TRANSITIONS=181} [2023-08-27 00:41:24,667 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 61 predicate places. [2023-08-27 00:41:24,667 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 181 transitions, 1897 flow [2023-08-27 00:41:24,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 366.3478260869565) internal successors, (8426), 23 states have internal predecessors, (8426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:24,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:41:24,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:41:24,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-27 00:41:24,868 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,SelfDestructingSolverStorable21 [2023-08-27 00:41:24,868 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:41:24,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:41:24,869 INFO L85 PathProgramCache]: Analyzing trace with hash -919798563, now seen corresponding path program 1 times [2023-08-27 00:41:24,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:41:24,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983412214] [2023-08-27 00:41:24,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:41:24,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:41:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:41:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:41:25,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:41:25,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983412214] [2023-08-27 00:41:25,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983412214] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:41:25,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096862919] [2023-08-27 00:41:25,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:41:25,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:41:25,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:41:25,221 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:41:25,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-27 00:41:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:41:25,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-27 00:41:25,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:41:25,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:25,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:25,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:25,396 INFO L322 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-27 00:41:25,396 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-27 00:41:25,432 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-27 00:41:25,474 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-27 00:41:25,474 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-27 00:41:25,508 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:41:25,538 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:41:25,538 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:41:25,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-27 00:41:25,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:25,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:41:25,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:25,632 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:41:25,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:25,674 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:41:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:41:25,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:41:25,702 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_948) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 4294967296)) is different from false [2023-08-27 00:41:25,705 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_948) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2023-08-27 00:41:25,890 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:41:25,891 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 34 treesize of output 35 [2023-08-27 00:41:25,899 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:41:25,900 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 7713 treesize of output 7649 [2023-08-27 00:41:25,927 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 233 treesize of output 225 [2023-08-27 00:41:25,934 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 460 treesize of output 428 [2023-08-27 00:41:25,942 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 209 treesize of output 207 [2023-08-27 00:41:25,950 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 207 treesize of output 203 [2023-08-27 00:41:25,959 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 218 treesize of output 202 [2023-08-27 00:41:26,511 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-27 00:41:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:41:26,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096862919] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:41:26,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:41:26,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-27 00:41:26,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798297000] [2023-08-27 00:41:26,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:41:26,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-27 00:41:26,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:41:26,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-27 00:41:26,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=713, Unknown=11, NotChecked=114, Total=992 [2023-08-27 00:41:26,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 1074 [2023-08-27 00:41:26,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 181 transitions, 1897 flow. Second operand has 32 states, 32 states have (on average 366.21875) internal successors, (11719), 32 states have internal predecessors, (11719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:26,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:41:26,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 1074 [2023-08-27 00:41:26,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:41:32,582 INFO L124 PetriNetUnfolderBase]: 23753/36589 cut-off events. [2023-08-27 00:41:32,582 INFO L125 PetriNetUnfolderBase]: For 170569/170799 co-relation queries the response was YES. [2023-08-27 00:41:32,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148041 conditions, 36589 events. 23753/36589 cut-off events. For 170569/170799 co-relation queries the response was YES. Maximal size of possible extension queue 3157. Compared 295618 event pairs, 11308 based on Foata normal form. 1160/25770 useless extension candidates. Maximal degree in co-relation 147998. Up to 19933 conditions per place. [2023-08-27 00:41:32,831 INFO L140 encePairwiseOnDemand]: 1063/1074 looper letters, 205 selfloop transitions, 43 changer transitions 0/254 dead transitions. [2023-08-27 00:41:32,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 254 transitions, 2828 flow [2023-08-27 00:41:32,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 00:41:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 00:41:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2665 transitions. [2023-08-27 00:41:32,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3544825751529662 [2023-08-27 00:41:32,834 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2665 transitions. [2023-08-27 00:41:32,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2665 transitions. [2023-08-27 00:41:32,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:41:32,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2665 transitions. [2023-08-27 00:41:32,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 380.7142857142857) internal successors, (2665), 7 states have internal predecessors, (2665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:32,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 1074.0) internal successors, (8592), 8 states have internal predecessors, (8592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:32,839 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 1074.0) internal successors, (8592), 8 states have internal predecessors, (8592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:32,839 INFO L175 Difference]: Start difference. First operand has 135 places, 181 transitions, 1897 flow. Second operand 7 states and 2665 transitions. [2023-08-27 00:41:32,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 254 transitions, 2828 flow [2023-08-27 00:41:33,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 254 transitions, 2769 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-27 00:41:33,461 INFO L231 Difference]: Finished difference. Result has 136 places, 184 transitions, 2048 flow [2023-08-27 00:41:33,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2048, PETRI_PLACES=136, PETRI_TRANSITIONS=184} [2023-08-27 00:41:33,462 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 62 predicate places. [2023-08-27 00:41:33,462 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 184 transitions, 2048 flow [2023-08-27 00:41:33,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 366.21875) internal successors, (11719), 32 states have internal predecessors, (11719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:33,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:41:33,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:41:33,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-27 00:41:33,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-27 00:41:33,663 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:41:33,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:41:33,664 INFO L85 PathProgramCache]: Analyzing trace with hash -919798662, now seen corresponding path program 1 times [2023-08-27 00:41:33,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:41:33,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896999548] [2023-08-27 00:41:33,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:41:33,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:41:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:41:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:41:33,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:41:33,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896999548] [2023-08-27 00:41:33,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896999548] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:41:33,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693305085] [2023-08-27 00:41:33,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:41:33,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:41:33,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:41:33,995 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:41:33,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-27 00:41:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:41:34,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-27 00:41:34,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:41:34,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:34,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:34,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:34,178 INFO L322 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-27 00:41:34,178 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-27 00:41:34,206 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-27 00:41:34,251 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-27 00:41:34,251 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-27 00:41:34,281 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-27 00:41:34,312 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:41:34,312 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:41:34,350 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-27 00:41:34,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:34,374 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-27 00:41:34,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:34,400 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-27 00:41:34,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:34,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 16 treesize of output 18 [2023-08-27 00:41:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:41:34,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:41:34,486 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1020 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1020) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2023-08-27 00:41:34,518 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1018) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1020) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2023-08-27 00:41:34,651 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:41:34,651 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 36 treesize of output 37 [2023-08-27 00:41:34,662 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:41:34,662 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 1095 treesize of output 1087 [2023-08-27 00:41:34,678 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 532 treesize of output 524 [2023-08-27 00:41:34,686 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 524 treesize of output 492 [2023-08-27 00:41:34,694 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 492 treesize of output 488 [2023-08-27 00:41:34,701 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 488 treesize of output 472 [2023-08-27 00:41:34,710 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 236 treesize of output 234 [2023-08-27 00:41:34,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 00:41:34,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693305085] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:41:34,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:41:34,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2023-08-27 00:41:34,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211360860] [2023-08-27 00:41:34,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:41:34,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-27 00:41:34,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:41:34,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-27 00:41:34,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=667, Unknown=8, NotChecked=110, Total=930 [2023-08-27 00:41:34,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 1074 [2023-08-27 00:41:35,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 184 transitions, 2048 flow. Second operand has 31 states, 31 states have (on average 366.2258064516129) internal successors, (11353), 31 states have internal predecessors, (11353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:35,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:41:35,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 1074 [2023-08-27 00:41:35,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:41:40,597 INFO L124 PetriNetUnfolderBase]: 21693/33603 cut-off events. [2023-08-27 00:41:40,597 INFO L125 PetriNetUnfolderBase]: For 197120/197340 co-relation queries the response was YES. [2023-08-27 00:41:40,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144891 conditions, 33603 events. 21693/33603 cut-off events. For 197120/197340 co-relation queries the response was YES. Maximal size of possible extension queue 3003. Compared 270155 event pairs, 10409 based on Foata normal form. 1150/23570 useless extension candidates. Maximal degree in co-relation 144846. Up to 19933 conditions per place. [2023-08-27 00:41:40,815 INFO L140 encePairwiseOnDemand]: 1063/1074 looper letters, 204 selfloop transitions, 43 changer transitions 0/253 dead transitions. [2023-08-27 00:41:40,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 253 transitions, 2910 flow [2023-08-27 00:41:40,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 00:41:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 00:41:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2664 transitions. [2023-08-27 00:41:40,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35434956105347165 [2023-08-27 00:41:40,817 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2664 transitions. [2023-08-27 00:41:40,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2664 transitions. [2023-08-27 00:41:40,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:41:40,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2664 transitions. [2023-08-27 00:41:40,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 380.57142857142856) internal successors, (2664), 7 states have internal predecessors, (2664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:40,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 1074.0) internal successors, (8592), 8 states have internal predecessors, (8592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:40,823 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 1074.0) internal successors, (8592), 8 states have internal predecessors, (8592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:40,823 INFO L175 Difference]: Start difference. First operand has 136 places, 184 transitions, 2048 flow. Second operand 7 states and 2664 transitions. [2023-08-27 00:41:40,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 253 transitions, 2910 flow [2023-08-27 00:41:41,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 253 transitions, 2862 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-27 00:41:41,275 INFO L231 Difference]: Finished difference. Result has 138 places, 183 transitions, 2071 flow [2023-08-27 00:41:41,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=1985, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2071, PETRI_PLACES=138, PETRI_TRANSITIONS=183} [2023-08-27 00:41:41,276 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 64 predicate places. [2023-08-27 00:41:41,276 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 183 transitions, 2071 flow [2023-08-27 00:41:41,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 366.2258064516129) internal successors, (11353), 31 states have internal predecessors, (11353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:41,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:41:41,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:41:41,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-27 00:41:41,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-27 00:41:41,478 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:41:41,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:41:41,478 INFO L85 PathProgramCache]: Analyzing trace with hash -919741007, now seen corresponding path program 1 times [2023-08-27 00:41:41,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:41:41,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074556248] [2023-08-27 00:41:41,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:41:41,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:41:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:41:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:41:41,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:41:41,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074556248] [2023-08-27 00:41:41,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074556248] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:41:41,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087241802] [2023-08-27 00:41:41,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:41:41,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:41:41,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:41:41,776 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:41:41,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-27 00:41:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:41:41,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-27 00:41:41,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:41:41,936 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-27 00:41:41,973 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-27 00:41:42,010 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:41:42,010 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:41:42,037 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-27 00:41:42,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:42,063 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-27 00:41:42,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:42,089 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-27 00:41:42,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:42,138 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-27 00:41:42,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:41:42,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:41:42,155 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1087 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1087) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset))))) is different from false [2023-08-27 00:41:42,159 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1087 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1087) c_~B~0.base) c_~B~0.offset) 9223372039002259456))) is different from false [2023-08-27 00:41:42,164 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1087 (Array Int Int)) (v_ArrVal_1086 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1086) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1087) c_~B~0.base) c_~B~0.offset) 9223372039002259456))) is different from false [2023-08-27 00:41:42,244 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:41:42,245 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 33 treesize of output 34 [2023-08-27 00:41:42,252 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:41:42,253 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 2195 treesize of output 2163 [2023-08-27 00:41:42,263 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 129 treesize of output 125 [2023-08-27 00:41:42,268 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 125 treesize of output 123 [2023-08-27 00:41:42,273 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 123 treesize of output 115 [2023-08-27 00:41:42,279 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 130 treesize of output 114 [2023-08-27 00:41:42,386 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:41:42,386 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 62 [2023-08-27 00:41:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:41:42,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087241802] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:41:42,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:41:42,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2023-08-27 00:41:42,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357858710] [2023-08-27 00:41:42,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:41:42,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-27 00:41:42,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:41:42,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-27 00:41:42,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=461, Unknown=8, NotChecked=138, Total=702 [2023-08-27 00:41:42,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 1074 [2023-08-27 00:41:42,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 183 transitions, 2071 flow. Second operand has 27 states, 27 states have (on average 365.3333333333333) internal successors, (9864), 27 states have internal predecessors, (9864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:42,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:41:42,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 1074 [2023-08-27 00:41:42,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:41:48,099 INFO L124 PetriNetUnfolderBase]: 19573/30552 cut-off events. [2023-08-27 00:41:48,099 INFO L125 PetriNetUnfolderBase]: For 179570/181001 co-relation queries the response was YES. [2023-08-27 00:41:48,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129765 conditions, 30552 events. 19573/30552 cut-off events. For 179570/181001 co-relation queries the response was YES. Maximal size of possible extension queue 2949. Compared 249478 event pairs, 8743 based on Foata normal form. 2137/22840 useless extension candidates. Maximal degree in co-relation 129720. Up to 13775 conditions per place. [2023-08-27 00:41:48,262 INFO L140 encePairwiseOnDemand]: 1060/1074 looper letters, 248 selfloop transitions, 34 changer transitions 0/294 dead transitions. [2023-08-27 00:41:48,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 294 transitions, 3724 flow [2023-08-27 00:41:48,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 00:41:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 00:41:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4142 transitions. [2023-08-27 00:41:48,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3506009818858981 [2023-08-27 00:41:48,267 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 4142 transitions. [2023-08-27 00:41:48,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 4142 transitions. [2023-08-27 00:41:48,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:41:48,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 4142 transitions. [2023-08-27 00:41:48,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 376.54545454545456) internal successors, (4142), 11 states have internal predecessors, (4142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:48,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 1074.0) internal successors, (12888), 12 states have internal predecessors, (12888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:48,274 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 1074.0) internal successors, (12888), 12 states have internal predecessors, (12888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:48,275 INFO L175 Difference]: Start difference. First operand has 138 places, 183 transitions, 2071 flow. Second operand 11 states and 4142 transitions. [2023-08-27 00:41:48,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 294 transitions, 3724 flow [2023-08-27 00:41:48,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 294 transitions, 3661 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-27 00:41:48,452 INFO L231 Difference]: Finished difference. Result has 148 places, 187 transitions, 2169 flow [2023-08-27 00:41:48,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=2033, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2169, PETRI_PLACES=148, PETRI_TRANSITIONS=187} [2023-08-27 00:41:48,453 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 74 predicate places. [2023-08-27 00:41:48,453 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 187 transitions, 2169 flow [2023-08-27 00:41:48,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 365.3333333333333) internal successors, (9864), 27 states have internal predecessors, (9864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:48,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:41:48,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:41:48,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-27 00:41:48,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:41:48,654 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:41:48,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:41:48,655 INFO L85 PathProgramCache]: Analyzing trace with hash -919740957, now seen corresponding path program 1 times [2023-08-27 00:41:48,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:41:48,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18910497] [2023-08-27 00:41:48,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:41:48,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:41:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:41:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:41:48,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:41:48,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18910497] [2023-08-27 00:41:48,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18910497] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:41:48,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536134153] [2023-08-27 00:41:48,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:41:48,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:41:48,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:41:48,941 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:41:48,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-27 00:41:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:41:49,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-27 00:41:49,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:41:49,117 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-27 00:41:49,143 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-27 00:41:49,171 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:41:49,171 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:41:49,194 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:41:49,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:49,223 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:41:49,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:49,259 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:41:49,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:41:49,302 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:41:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:41:49,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:41:49,408 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_ArrVal_1152 (Array Int Int)) (v_ArrVal_1151 (Array Int Int))) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1152) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1153) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1154) c_~B~0.base) c_~B~0.offset) 4294967296)) is different from false [2023-08-27 00:41:49,433 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:41:49,434 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 31 treesize of output 32 [2023-08-27 00:41:49,440 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:41:49,440 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 485 treesize of output 477 [2023-08-27 00:41:49,446 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 228 treesize of output 212 [2023-08-27 00:41:49,450 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 212 treesize of output 208 [2023-08-27 00:41:49,454 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 208 treesize of output 200 [2023-08-27 00:41:49,459 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 100 treesize of output 98 [2023-08-27 00:41:49,608 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:41:49,608 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 62 [2023-08-27 00:41:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-08-27 00:41:49,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536134153] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:41:49,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:41:49,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2023-08-27 00:41:49,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313425498] [2023-08-27 00:41:49,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:41:49,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-27 00:41:49,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:41:49,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-27 00:41:49,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=526, Unknown=16, NotChecked=48, Total=702 [2023-08-27 00:41:49,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 1074 [2023-08-27 00:41:49,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 187 transitions, 2169 flow. Second operand has 27 states, 27 states have (on average 365.3333333333333) internal successors, (9864), 27 states have internal predecessors, (9864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:49,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:41:49,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 1074 [2023-08-27 00:41:49,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:41:54,838 INFO L124 PetriNetUnfolderBase]: 18041/28299 cut-off events. [2023-08-27 00:41:54,839 INFO L125 PetriNetUnfolderBase]: For 178529/179836 co-relation queries the response was YES. [2023-08-27 00:41:54,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130374 conditions, 28299 events. 18041/28299 cut-off events. For 178529/179836 co-relation queries the response was YES. Maximal size of possible extension queue 2752. Compared 230664 event pairs, 7520 based on Foata normal form. 2013/21079 useless extension candidates. Maximal degree in co-relation 130325. Up to 13775 conditions per place. [2023-08-27 00:41:55,005 INFO L140 encePairwiseOnDemand]: 1060/1074 looper letters, 247 selfloop transitions, 34 changer transitions 0/293 dead transitions. [2023-08-27 00:41:55,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 293 transitions, 3759 flow [2023-08-27 00:41:55,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 00:41:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 00:41:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4141 transitions. [2023-08-27 00:41:55,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3505163365498561 [2023-08-27 00:41:55,009 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 4141 transitions. [2023-08-27 00:41:55,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 4141 transitions. [2023-08-27 00:41:55,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:41:55,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 4141 transitions. [2023-08-27 00:41:55,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 376.45454545454544) internal successors, (4141), 11 states have internal predecessors, (4141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:55,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 1074.0) internal successors, (12888), 12 states have internal predecessors, (12888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:55,016 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 1074.0) internal successors, (12888), 12 states have internal predecessors, (12888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:55,016 INFO L175 Difference]: Start difference. First operand has 148 places, 187 transitions, 2169 flow. Second operand 11 states and 4141 transitions. [2023-08-27 00:41:55,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 293 transitions, 3759 flow [2023-08-27 00:41:55,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 293 transitions, 3660 flow, removed 21 selfloop flow, removed 7 redundant places. [2023-08-27 00:41:55,232 INFO L231 Difference]: Finished difference. Result has 151 places, 186 transitions, 2150 flow [2023-08-27 00:41:55,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2150, PETRI_PLACES=151, PETRI_TRANSITIONS=186} [2023-08-27 00:41:55,232 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 77 predicate places. [2023-08-27 00:41:55,232 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 186 transitions, 2150 flow [2023-08-27 00:41:55,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 365.3333333333333) internal successors, (9864), 27 states have internal predecessors, (9864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:55,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:41:55,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:41:55,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-27 00:41:55,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-27 00:41:55,434 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:41:55,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:41:55,435 INFO L85 PathProgramCache]: Analyzing trace with hash -919735504, now seen corresponding path program 1 times [2023-08-27 00:41:55,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:41:55,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209142711] [2023-08-27 00:41:55,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:41:55,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:41:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:41:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:41:55,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:41:55,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209142711] [2023-08-27 00:41:55,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209142711] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:41:55,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687551862] [2023-08-27 00:41:55,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:41:55,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:41:55,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:41:55,517 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:41:55,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-27 00:41:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:41:55,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-27 00:41:55,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:41:55,701 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-27 00:41:55,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:41:55,735 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-27 00:41:55,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687551862] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:41:55,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:41:55,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-08-27 00:41:55,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650316573] [2023-08-27 00:41:55,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:41:55,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-27 00:41:55,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:41:55,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-27 00:41:55,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-08-27 00:41:55,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 1074 [2023-08-27 00:41:55,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 186 transitions, 2150 flow. Second operand has 14 states, 14 states have (on average 382.7142857142857) internal successors, (5358), 14 states have internal predecessors, (5358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:41:55,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:41:55,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 1074 [2023-08-27 00:41:55,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:41:59,900 INFO L124 PetriNetUnfolderBase]: 15346/24080 cut-off events. [2023-08-27 00:41:59,900 INFO L125 PetriNetUnfolderBase]: For 130724/130960 co-relation queries the response was YES. [2023-08-27 00:41:59,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108706 conditions, 24080 events. 15346/24080 cut-off events. For 130724/130960 co-relation queries the response was YES. Maximal size of possible extension queue 2525. Compared 187618 event pairs, 9230 based on Foata normal form. 1108/17413 useless extension candidates. Maximal degree in co-relation 108660. Up to 20005 conditions per place. [2023-08-27 00:42:00,024 INFO L140 encePairwiseOnDemand]: 1060/1074 looper letters, 223 selfloop transitions, 38 changer transitions 0/273 dead transitions. [2023-08-27 00:42:00,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 273 transitions, 3266 flow [2023-08-27 00:42:00,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 00:42:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 00:42:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3561 transitions. [2023-08-27 00:42:00,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3684047175667287 [2023-08-27 00:42:00,027 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3561 transitions. [2023-08-27 00:42:00,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3561 transitions. [2023-08-27 00:42:00,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:42:00,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3561 transitions. [2023-08-27 00:42:00,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 395.6666666666667) internal successors, (3561), 9 states have internal predecessors, (3561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:42:00,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 1074.0) internal successors, (10740), 10 states have internal predecessors, (10740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:42:00,034 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 1074.0) internal successors, (10740), 10 states have internal predecessors, (10740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:42:00,034 INFO L175 Difference]: Start difference. First operand has 151 places, 186 transitions, 2150 flow. Second operand 9 states and 3561 transitions. [2023-08-27 00:42:00,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 273 transitions, 3266 flow [2023-08-27 00:42:00,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 273 transitions, 3213 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-27 00:42:00,204 INFO L231 Difference]: Finished difference. Result has 155 places, 193 transitions, 2305 flow [2023-08-27 00:42:00,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2305, PETRI_PLACES=155, PETRI_TRANSITIONS=193} [2023-08-27 00:42:00,205 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 81 predicate places. [2023-08-27 00:42:00,205 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 193 transitions, 2305 flow [2023-08-27 00:42:00,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 382.7142857142857) internal successors, (5358), 14 states have internal predecessors, (5358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:42:00,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:42:00,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:42:00,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-27 00:42:00,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-27 00:42:00,406 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:42:00,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:42:00,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1570101340, now seen corresponding path program 1 times [2023-08-27 00:42:00,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:42:00,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447589057] [2023-08-27 00:42:00,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:42:00,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:42:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:42:00,444 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-27 00:42:00,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:42:00,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447589057] [2023-08-27 00:42:00,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447589057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:42:00,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:42:00,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 00:42:00,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026668312] [2023-08-27 00:42:00,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:42:00,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 00:42:00,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:42:00,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 00:42:00,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 00:42:00,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 1074 [2023-08-27 00:42:00,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 193 transitions, 2305 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:42:00,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:42:00,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 1074 [2023-08-27 00:42:00,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:42:04,288 INFO L124 PetriNetUnfolderBase]: 16008/25102 cut-off events. [2023-08-27 00:42:04,289 INFO L125 PetriNetUnfolderBase]: For 171189/173487 co-relation queries the response was YES. [2023-08-27 00:42:04,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123100 conditions, 25102 events. 16008/25102 cut-off events. For 171189/173487 co-relation queries the response was YES. Maximal size of possible extension queue 2361. Compared 194516 event pairs, 7136 based on Foata normal form. 2294/20142 useless extension candidates. Maximal degree in co-relation 123051. Up to 17533 conditions per place. [2023-08-27 00:42:04,458 INFO L140 encePairwiseOnDemand]: 1070/1074 looper letters, 207 selfloop transitions, 5 changer transitions 0/229 dead transitions. [2023-08-27 00:42:04,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 229 transitions, 3104 flow [2023-08-27 00:42:04,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 00:42:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 00:42:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1340 transitions. [2023-08-27 00:42:04,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4158907510862818 [2023-08-27 00:42:04,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1340 transitions. [2023-08-27 00:42:04,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1340 transitions. [2023-08-27 00:42:04,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:42:04,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1340 transitions. [2023-08-27 00:42:04,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 446.6666666666667) internal successors, (1340), 3 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:42:04,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:42:04,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:42:04,463 INFO L175 Difference]: Start difference. First operand has 155 places, 193 transitions, 2305 flow. Second operand 3 states and 1340 transitions. [2023-08-27 00:42:04,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 229 transitions, 3104 flow [2023-08-27 00:42:04,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 229 transitions, 3047 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-27 00:42:04,675 INFO L231 Difference]: Finished difference. Result has 153 places, 193 transitions, 2269 flow [2023-08-27 00:42:04,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=2248, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2269, PETRI_PLACES=153, PETRI_TRANSITIONS=193} [2023-08-27 00:42:04,675 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 79 predicate places. [2023-08-27 00:42:04,675 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 193 transitions, 2269 flow [2023-08-27 00:42:04,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:42:04,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:42:04,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:42:04,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-27 00:42:04,676 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:42:04,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:42:04,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1570101330, now seen corresponding path program 1 times [2023-08-27 00:42:04,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:42:04,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948303866] [2023-08-27 00:42:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:42:04,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:42:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:42:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:42:05,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:42:05,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948303866] [2023-08-27 00:42:05,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948303866] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:42:05,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984081755] [2023-08-27 00:42:05,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:42:05,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:42:05,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:42:05,139 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:42:05,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-27 00:42:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:42:05,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 51 conjunts are in the unsatisfiable core [2023-08-27 00:42:05,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:42:05,342 INFO L322 Elim1Store]: treesize reduction 85, result has 22.0 percent of original size [2023-08-27 00:42:05,342 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 44 [2023-08-27 00:42:05,386 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-27 00:42:05,476 INFO L322 Elim1Store]: treesize reduction 46, result has 48.9 percent of original size [2023-08-27 00:42:05,477 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 35 treesize of output 69 [2023-08-27 00:42:05,560 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:42:05,619 INFO L322 Elim1Store]: treesize reduction 8, result has 86.0 percent of original size [2023-08-27 00:42:05,619 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 44 treesize of output 82 [2023-08-27 00:42:05,756 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:42:05,812 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:42:05,858 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-27 00:42:05,887 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:42:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:42:05,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:42:08,228 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1322 (Array Int Int)) (~B~0.offset Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1322))) (let ((.cse0 (select (select .cse1 c_~B~0.base) ~B~0.offset))) (or (<= (+ .cse0 (select (select .cse1 c_~A~0.base) c_~A~0.offset)) 2147483647) (< 0 .cse0) (< .cse0 0))))) (forall ((v_ArrVal_1322 (Array Int Int)) (~B~0.offset Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1322))) (let ((.cse2 (select (select .cse3 c_~B~0.base) ~B~0.offset))) (or (<= 0 .cse2) (<= (+ .cse2 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) 2147483647) (< (+ .cse2 9223372039002259455) 0)))))) is different from false [2023-08-27 00:42:08,254 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1322 (Array Int Int)) (v_ArrVal_1321 (Array Int Int)) (~B~0.offset Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1322))) (let ((.cse1 (select (select .cse0 c_~B~0.base) ~B~0.offset))) (or (<= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) .cse1) 2147483647) (< (+ 9223372039002259455 .cse1) 0) (<= 0 .cse1))))) (forall ((v_ArrVal_1322 (Array Int Int)) (v_ArrVal_1321 (Array Int Int)) (~B~0.offset Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1322))) (let ((.cse2 (select (select .cse3 c_~B~0.base) ~B~0.offset))) (or (< 0 .cse2) (<= (+ (select (select .cse3 c_~A~0.base) c_~A~0.offset) .cse2) 2147483647) (< .cse2 0)))))) is different from false [2023-08-27 00:42:08,286 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1322 (Array Int Int)) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (~B~0.offset Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1320) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1322))) (let ((.cse0 (select (select .cse1 c_~B~0.base) ~B~0.offset))) (or (< 0 .cse0) (<= (+ (select (select .cse1 c_~A~0.base) c_~A~0.offset) .cse0) 2147483647) (< .cse0 0))))) (forall ((v_ArrVal_1322 (Array Int Int)) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (~B~0.offset Int)) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1320) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1322))) (let ((.cse3 (select (select .cse2 c_~B~0.base) ~B~0.offset))) (or (<= (+ (select (select .cse2 c_~A~0.base) c_~A~0.offset) .cse3) 2147483647) (<= 0 .cse3) (< (+ 9223372039002259455 .cse3) 0)))))) is different from false [2023-08-27 00:42:18,859 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:42:18,860 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 305 treesize of output 222 [2023-08-27 00:42:19,015 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:42:19,020 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 2500523 treesize of output 2484139 [2023-08-27 00:42:21,003 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:42:21,004 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 20351 treesize of output 19832 [2023-08-27 00:42:21,268 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:42:21,269 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 19823 treesize of output 19700 [2023-08-27 00:42:21,538 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:42:21,539 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 19691 treesize of output 19600 [2023-08-27 00:42:21,808 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:42:21,809 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 19591 treesize of output 18544 [2023-08-27 00:42:22,156 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:42:22,157 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 18535 treesize of output 18280 [2023-08-27 00:42:22,437 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:42:22,438 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 18271 treesize of output 18180 [2023-08-27 00:42:22,719 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:42:22,720 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 18171 treesize of output 17124 [2023-08-27 00:42:22,969 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-27 00:42:23,008 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:42:23,009 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 17115 treesize of output 16860 [2023-08-27 00:42:23,293 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:42:23,294 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16851 treesize of output 16332 [2023-08-27 00:42:23,584 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:42:23,585 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 16323 treesize of output 16200 [2023-08-27 00:44:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 00:44:45,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984081755] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:44:45,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:44:45,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 29 [2023-08-27 00:44:45,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067169256] [2023-08-27 00:44:45,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:44:45,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-27 00:44:45,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:44:45,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-27 00:44:45,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=615, Unknown=10, NotChecked=162, Total=930 [2023-08-27 00:44:45,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 1074 [2023-08-27 00:44:45,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 193 transitions, 2269 flow. Second operand has 31 states, 31 states have (on average 346.35483870967744) internal successors, (10737), 31 states have internal predecessors, (10737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:44:45,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:44:45,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 1074 [2023-08-27 00:44:45,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:44:51,591 INFO L124 PetriNetUnfolderBase]: 15056/23626 cut-off events. [2023-08-27 00:44:51,591 INFO L125 PetriNetUnfolderBase]: For 162635/164803 co-relation queries the response was YES. [2023-08-27 00:44:51,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118652 conditions, 23626 events. 15056/23626 cut-off events. For 162635/164803 co-relation queries the response was YES. Maximal size of possible extension queue 2174. Compared 181367 event pairs, 6496 based on Foata normal form. 2164/20194 useless extension candidates. Maximal degree in co-relation 118603. Up to 15958 conditions per place. [2023-08-27 00:44:51,792 INFO L140 encePairwiseOnDemand]: 1065/1074 looper letters, 231 selfloop transitions, 21 changer transitions 0/269 dead transitions. [2023-08-27 00:44:51,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 269 transitions, 3500 flow [2023-08-27 00:44:51,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 00:44:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 00:44:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3215 transitions. [2023-08-27 00:44:51,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33260914545830744 [2023-08-27 00:44:51,795 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3215 transitions. [2023-08-27 00:44:51,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3215 transitions. [2023-08-27 00:44:51,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:44:51,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3215 transitions. [2023-08-27 00:44:51,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 357.22222222222223) internal successors, (3215), 9 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:44:51,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 1074.0) internal successors, (10740), 10 states have internal predecessors, (10740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:44:51,801 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 1074.0) internal successors, (10740), 10 states have internal predecessors, (10740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:44:51,801 INFO L175 Difference]: Start difference. First operand has 153 places, 193 transitions, 2269 flow. Second operand 9 states and 3215 transitions. [2023-08-27 00:44:51,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 269 transitions, 3500 flow [2023-08-27 00:44:52,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 269 transitions, 3491 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 00:44:52,073 INFO L231 Difference]: Finished difference. Result has 161 places, 196 transitions, 2350 flow [2023-08-27 00:44:52,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=2262, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2350, PETRI_PLACES=161, PETRI_TRANSITIONS=196} [2023-08-27 00:44:52,073 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 87 predicate places. [2023-08-27 00:44:52,074 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 196 transitions, 2350 flow [2023-08-27 00:44:52,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 346.35483870967744) internal successors, (10737), 31 states have internal predecessors, (10737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:44:52,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:44:52,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:44:52,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-27 00:44:52,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-27 00:44:52,280 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:44:52,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:44:52,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1570101335, now seen corresponding path program 1 times [2023-08-27 00:44:52,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:44:52,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371175352] [2023-08-27 00:44:52,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:44:52,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:44:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:44:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:44:52,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:44:52,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371175352] [2023-08-27 00:44:52,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371175352] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:44:52,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067957002] [2023-08-27 00:44:52,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:44:52,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:44:52,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:44:52,927 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:44:52,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-27 00:44:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:44:53,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-27 00:44:53,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:44:53,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:44:53,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:44:53,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:44:53,171 INFO L322 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-27 00:44:53,171 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-27 00:44:53,227 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-27 00:44:53,324 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-27 00:44:53,324 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-27 00:44:53,393 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-27 00:44:53,453 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:44:53,453 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:44:53,513 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-27 00:44:53,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:44:53,579 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-27 00:44:53,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:44:53,645 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-27 00:44:53,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:44:53,700 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-27 00:44:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:44:53,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:44:53,786 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1394 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1394) c_~A~0.base) c_~A~0.offset)))) is different from false [2023-08-27 00:44:54,253 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:44:54,253 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 36 treesize of output 37 [2023-08-27 00:44:54,271 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:44:54,271 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 8739 treesize of output 8675 [2023-08-27 00:44:54,293 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 532 treesize of output 516 [2023-08-27 00:44:54,302 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 516 treesize of output 484 [2023-08-27 00:44:54,314 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 241 treesize of output 239 [2023-08-27 00:44:54,325 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 239 treesize of output 235 [2023-08-27 00:44:54,337 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 242 treesize of output 234 [2023-08-27 00:44:54,912 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-27 00:44:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:44:55,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067957002] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:44:55,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:44:55,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2023-08-27 00:44:55,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782454858] [2023-08-27 00:44:55,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:44:55,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-27 00:44:55,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:44:55,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-27 00:44:55,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=634, Unknown=15, NotChecked=54, Total=870 [2023-08-27 00:44:55,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 1074 [2023-08-27 00:44:55,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 196 transitions, 2350 flow. Second operand has 30 states, 30 states have (on average 366.3) internal successors, (10989), 30 states have internal predecessors, (10989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:44:55,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:44:55,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 1074 [2023-08-27 00:44:55,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:44:59,590 INFO L124 PetriNetUnfolderBase]: 14104/22150 cut-off events. [2023-08-27 00:44:59,591 INFO L125 PetriNetUnfolderBase]: For 156552/158590 co-relation queries the response was YES. [2023-08-27 00:44:59,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115434 conditions, 22150 events. 14104/22150 cut-off events. For 156552/158590 co-relation queries the response was YES. Maximal size of possible extension queue 2082. Compared 168477 event pairs, 6496 based on Foata normal form. 2558/20246 useless extension candidates. Maximal degree in co-relation 115383. Up to 15968 conditions per place. [2023-08-27 00:44:59,774 INFO L140 encePairwiseOnDemand]: 1066/1074 looper letters, 238 selfloop transitions, 13 changer transitions 0/268 dead transitions. [2023-08-27 00:44:59,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 268 transitions, 3551 flow [2023-08-27 00:44:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 00:44:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 00:44:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2662 transitions. [2023-08-27 00:44:59,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3540835328544826 [2023-08-27 00:44:59,776 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2662 transitions. [2023-08-27 00:44:59,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2662 transitions. [2023-08-27 00:44:59,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:44:59,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2662 transitions. [2023-08-27 00:44:59,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 380.2857142857143) internal successors, (2662), 7 states have internal predecessors, (2662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:44:59,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 1074.0) internal successors, (8592), 8 states have internal predecessors, (8592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:44:59,781 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 1074.0) internal successors, (8592), 8 states have internal predecessors, (8592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:44:59,781 INFO L175 Difference]: Start difference. First operand has 161 places, 196 transitions, 2350 flow. Second operand 7 states and 2662 transitions. [2023-08-27 00:44:59,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 268 transitions, 3551 flow [2023-08-27 00:45:00,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 268 transitions, 3532 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-27 00:45:00,021 INFO L231 Difference]: Finished difference. Result has 163 places, 195 transitions, 2351 flow [2023-08-27 00:45:00,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=2325, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2351, PETRI_PLACES=163, PETRI_TRANSITIONS=195} [2023-08-27 00:45:00,021 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 89 predicate places. [2023-08-27 00:45:00,021 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 195 transitions, 2351 flow [2023-08-27 00:45:00,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 366.3) internal successors, (10989), 30 states have internal predecessors, (10989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:00,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:45:00,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:45:00,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-27 00:45:00,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:45:00,228 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:45:00,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:45:00,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1570101254, now seen corresponding path program 1 times [2023-08-27 00:45:00,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:45:00,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499159498] [2023-08-27 00:45:00,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:45:00,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:45:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:45:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:45:00,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:45:00,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499159498] [2023-08-27 00:45:00,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499159498] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:45:00,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634475070] [2023-08-27 00:45:00,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:45:00,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:45:00,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:45:00,714 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:45:00,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-27 00:45:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:45:00,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-27 00:45:00,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:45:00,931 INFO L322 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2023-08-27 00:45:00,931 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 3 case distinctions, treesize of input 15 treesize of output 21 [2023-08-27 00:45:01,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:45:01,052 INFO L322 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-27 00:45:01,052 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 27 treesize of output 41 [2023-08-27 00:45:01,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-27 00:45:01,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:45:01,272 INFO L322 Elim1Store]: treesize reduction 40, result has 29.8 percent of original size [2023-08-27 00:45:01,272 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 32 [2023-08-27 00:45:01,352 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 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-27 00:45:01,412 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 00:45:01,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:45:01,483 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 00:45:01,506 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-27 00:45:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:45:01,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:45:01,772 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1467 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1467) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1468) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1469) c_~B~0.base) c_~B~0.offset) 9223372039002259456))) is different from false [2023-08-27 00:45:01,930 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:45:01,931 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 33 treesize of output 34 [2023-08-27 00:45:01,947 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:45:01,948 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 8771 treesize of output 8643 [2023-08-27 00:45:02,186 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 129 treesize of output 127 [2023-08-27 00:45:02,194 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 258 treesize of output 242 [2023-08-27 00:45:02,200 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 242 treesize of output 234 [2023-08-27 00:45:02,208 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 118 treesize of output 114 [2023-08-27 00:45:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-08-27 00:45:02,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634475070] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:45:02,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:45:02,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2023-08-27 00:45:02,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653321442] [2023-08-27 00:45:02,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:45:02,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-27 00:45:02,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:45:02,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-27 00:45:02,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=479, Unknown=15, NotChecked=46, Total=650 [2023-08-27 00:45:02,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 1074 [2023-08-27 00:45:02,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 195 transitions, 2351 flow. Second operand has 26 states, 26 states have (on average 365.4230769230769) internal successors, (9501), 26 states have internal predecessors, (9501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:02,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:45:02,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 1074 [2023-08-27 00:45:02,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:45:08,641 INFO L124 PetriNetUnfolderBase]: 13152/20677 cut-off events. [2023-08-27 00:45:08,641 INFO L125 PetriNetUnfolderBase]: For 151721/153614 co-relation queries the response was YES. [2023-08-27 00:45:08,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110012 conditions, 20677 events. 13152/20677 cut-off events. For 151721/153614 co-relation queries the response was YES. Maximal size of possible extension queue 1816. Compared 158454 event pairs, 3216 based on Foata normal form. 1890/18716 useless extension candidates. Maximal degree in co-relation 109961. Up to 8856 conditions per place. [2023-08-27 00:45:08,772 INFO L140 encePairwiseOnDemand]: 1057/1074 looper letters, 237 selfloop transitions, 34 changer transitions 0/288 dead transitions. [2023-08-27 00:45:08,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 288 transitions, 3709 flow [2023-08-27 00:45:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 00:45:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 00:45:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 4500 transitions. [2023-08-27 00:45:08,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34916201117318435 [2023-08-27 00:45:08,775 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 4500 transitions. [2023-08-27 00:45:08,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 4500 transitions. [2023-08-27 00:45:08,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:45:08,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 4500 transitions. [2023-08-27 00:45:08,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 375.0) internal successors, (4500), 12 states have internal predecessors, (4500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:08,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 1074.0) internal successors, (13962), 13 states have internal predecessors, (13962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:08,783 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 1074.0) internal successors, (13962), 13 states have internal predecessors, (13962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:08,783 INFO L175 Difference]: Start difference. First operand has 163 places, 195 transitions, 2351 flow. Second operand 12 states and 4500 transitions. [2023-08-27 00:45:08,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 288 transitions, 3709 flow [2023-08-27 00:45:08,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 288 transitions, 3690 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-27 00:45:08,947 INFO L231 Difference]: Finished difference. Result has 174 places, 198 transitions, 2461 flow [2023-08-27 00:45:08,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=2334, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2461, PETRI_PLACES=174, PETRI_TRANSITIONS=198} [2023-08-27 00:45:08,948 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 100 predicate places. [2023-08-27 00:45:08,948 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 198 transitions, 2461 flow [2023-08-27 00:45:08,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 365.4230769230769) internal successors, (9501), 26 states have internal predecessors, (9501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:08,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:45:08,949 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:45:08,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-27 00:45:09,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:45:09,151 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:45:09,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:45:09,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2029804985, now seen corresponding path program 2 times [2023-08-27 00:45:09,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:45:09,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124082389] [2023-08-27 00:45:09,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:45:09,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:45:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:45:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:45:09,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:45:09,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124082389] [2023-08-27 00:45:09,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124082389] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:45:09,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436143519] [2023-08-27 00:45:09,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 00:45:09,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:45:09,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:45:09,783 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:45:09,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-27 00:45:09,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 00:45:09,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:45:09,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-27 00:45:09,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:45:09,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:45:10,075 INFO L322 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2023-08-27 00:45:10,075 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-27 00:45:10,185 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-27 00:45:10,278 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-27 00:45:10,279 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-27 00:45:10,335 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:45:10,359 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:45:10,431 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:45:10,431 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:45:10,491 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:45:10,508 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:45:10,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:45:10,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-27 00:45:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:45:10,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:45:10,881 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1545 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~i~0#1_124| Int)) (or (<= c_~N~0 |v_thread1Thread1of1ForFork2_~i~0#1_124|) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1545) c_~A~0.base) (+ c_~A~0.offset (* |v_thread1Thread1of1ForFork2_~i~0#1_124| 4))) 4294967296) (< |v_thread1Thread1of1ForFork2_~i~0#1_124| 1))) is different from false [2023-08-27 00:45:11,228 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:45:11,228 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 32 treesize of output 33 [2023-08-27 00:45:11,245 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:45:11,245 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 617 treesize of output 585 [2023-08-27 00:45:11,256 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 65 treesize of output 53 [2023-08-27 00:45:11,263 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 53 treesize of output 47 [2023-08-27 00:45:11,271 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 70 treesize of output 46 [2023-08-27 00:45:11,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-08-27 00:45:11,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436143519] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:45:11,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:45:11,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-27 00:45:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303603105] [2023-08-27 00:45:11,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:45:11,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-27 00:45:11,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:45:11,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-27 00:45:11,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=806, Unknown=3, NotChecked=58, Total=992 [2023-08-27 00:45:11,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 1074 [2023-08-27 00:45:11,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 198 transitions, 2461 flow. Second operand has 32 states, 32 states have (on average 350.3125) internal successors, (11210), 32 states have internal predecessors, (11210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:11,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:45:11,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 1074 [2023-08-27 00:45:11,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:45:18,191 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_thread1Thread1of1ForFork2_~i~0#1_124| Int)) (or (< (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread1Thread1of1ForFork2_~i~0#1_124| 4))) 4294967296) (<= c_~N~0 |v_thread1Thread1of1ForFork2_~i~0#1_124|) (< |v_thread1Thread1of1ForFork2_~i~0#1_124| 1))) (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1544 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int) (v_ArrVal_1542 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~i~0#1_124| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0)) (<= c_~N~0 |v_thread1Thread1of1ForFork2_~i~0#1_124|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1542) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| v_ArrVal_1544) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1545) c_~A~0.base) (+ c_~A~0.offset (* |v_thread1Thread1of1ForFork2_~i~0#1_124| 4))) 4294967296) (< |v_thread1Thread1of1ForFork2_~i~0#1_124| 1))) (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_206| Int) (v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1544 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int) (v_ArrVal_1542 (Array Int Int)) (v_ArrVal_1540 Int) (|v_thread1Thread1of1ForFork2_~i~0#1_124| Int)) (or (<= c_~N~0 |v_thread1Thread1of1ForFork2_~i~0#1_124|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_206|) 0)) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_206| v_ArrVal_1540) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|))) (< (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_206| v_ArrVal_1542) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| v_ArrVal_1544) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread1Thread1of1ForFork2_~i~0#1_124| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< |v_thread1Thread1of1ForFork2_~i~0#1_124| 1)))) (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1544 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~i~0#1_124| Int)) (or (<= c_~N~0 |v_thread1Thread1of1ForFork2_~i~0#1_124|) (< |v_thread1Thread1of1ForFork2_~i~0#1_124| 1) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1545) c_~A~0.base) (+ c_~A~0.offset (* |v_thread1Thread1of1ForFork2_~i~0#1_124| 4))) 4294967296))) (forall ((v_ArrVal_1545 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~i~0#1_124| Int)) (or (<= c_~N~0 |v_thread1Thread1of1ForFork2_~i~0#1_124|) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1545) c_~A~0.base) (+ c_~A~0.offset (* |v_thread1Thread1of1ForFork2_~i~0#1_124| 4))) 4294967296) (< |v_thread1Thread1of1ForFork2_~i~0#1_124| 1))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0)) (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1544 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~i~0#1_124| Int)) (or (<= c_~N~0 |v_thread1Thread1of1ForFork2_~i~0#1_124|) (< (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| v_ArrVal_1544) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1545) c_~A~0.base) (+ c_~A~0.offset (* |v_thread1Thread1of1ForFork2_~i~0#1_124| 4))) 4294967296) (< |v_thread1Thread1of1ForFork2_~i~0#1_124| 1)))))) is different from false [2023-08-27 00:45:39,762 INFO L124 PetriNetUnfolderBase]: 15293/24769 cut-off events. [2023-08-27 00:45:39,762 INFO L125 PetriNetUnfolderBase]: For 174375/177830 co-relation queries the response was YES. [2023-08-27 00:45:39,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138345 conditions, 24769 events. 15293/24769 cut-off events. For 174375/177830 co-relation queries the response was YES. Maximal size of possible extension queue 2183. Compared 201216 event pairs, 7547 based on Foata normal form. 3467/24611 useless extension candidates. Maximal degree in co-relation 138290. Up to 14991 conditions per place. [2023-08-27 00:45:39,930 INFO L140 encePairwiseOnDemand]: 1057/1074 looper letters, 295 selfloop transitions, 221 changer transitions 0/527 dead transitions. [2023-08-27 00:45:39,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 527 transitions, 7307 flow [2023-08-27 00:45:39,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-08-27 00:45:39,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-08-27 00:45:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 17387 transitions. [2023-08-27 00:45:39,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303880211302398 [2023-08-27 00:45:39,940 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 17387 transitions. [2023-08-27 00:45:39,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 17387 transitions. [2023-08-27 00:45:39,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:45:39,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 17387 transitions. [2023-08-27 00:45:39,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 354.83673469387753) internal successors, (17387), 49 states have internal predecessors, (17387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:39,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 1074.0) internal successors, (53700), 50 states have internal predecessors, (53700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:39,976 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 1074.0) internal successors, (53700), 50 states have internal predecessors, (53700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:39,976 INFO L175 Difference]: Start difference. First operand has 174 places, 198 transitions, 2461 flow. Second operand 49 states and 17387 transitions. [2023-08-27 00:45:39,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 527 transitions, 7307 flow [2023-08-27 00:45:40,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 527 transitions, 7224 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-27 00:45:40,226 INFO L231 Difference]: Finished difference. Result has 227 places, 365 transitions, 5321 flow [2023-08-27 00:45:40,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=2419, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=5321, PETRI_PLACES=227, PETRI_TRANSITIONS=365} [2023-08-27 00:45:40,227 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 153 predicate places. [2023-08-27 00:45:40,227 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 365 transitions, 5321 flow [2023-08-27 00:45:40,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 350.3125) internal successors, (11210), 32 states have internal predecessors, (11210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:40,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:45:40,228 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:45:40,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-08-27 00:45:40,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-08-27 00:45:40,428 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:45:40,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:45:40,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2029804886, now seen corresponding path program 1 times [2023-08-27 00:45:40,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:45:40,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528075093] [2023-08-27 00:45:40,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:45:40,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:45:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:45:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:45:41,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:45:41,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528075093] [2023-08-27 00:45:41,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528075093] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:45:41,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875478997] [2023-08-27 00:45:41,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:45:41,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:45:41,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:45:41,032 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:45:41,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-27 00:45:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:45:41,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-27 00:45:41,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:45:41,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:45:41,287 INFO L322 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2023-08-27 00:45:41,287 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-27 00:45:41,385 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-27 00:45:41,468 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-27 00:45:41,468 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-27 00:45:41,519 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-27 00:45:41,547 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-27 00:45:41,609 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:45:41,610 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:45:41,660 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-27 00:45:41,680 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-27 00:45:41,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:45:41,726 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-27 00:45:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:45:41,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:45:41,898 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1621 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1621) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2023-08-27 00:45:42,179 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:45:42,179 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 32 treesize of output 33 [2023-08-27 00:45:42,193 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:45:42,194 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 157 treesize of output 151 [2023-08-27 00:45:42,199 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 138 treesize of output 122 [2023-08-27 00:45:42,205 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 122 treesize of output 114 [2023-08-27 00:45:42,212 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 58 treesize of output 54 [2023-08-27 00:45:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-08-27 00:45:42,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875478997] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:45:42,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:45:42,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2023-08-27 00:45:42,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238356952] [2023-08-27 00:45:42,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:45:42,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-27 00:45:42,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:45:42,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-27 00:45:42,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=694, Unknown=5, NotChecked=54, Total=870 [2023-08-27 00:45:42,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 1074 [2023-08-27 00:45:42,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 365 transitions, 5321 flow. Second operand has 30 states, 30 states have (on average 359.3333333333333) internal successors, (10780), 30 states have internal predecessors, (10780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:42,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:45:42,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 1074 [2023-08-27 00:45:42,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:45:49,252 INFO L124 PetriNetUnfolderBase]: 15340/24594 cut-off events. [2023-08-27 00:45:49,252 INFO L125 PetriNetUnfolderBase]: For 201551/206409 co-relation queries the response was YES. [2023-08-27 00:45:49,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142391 conditions, 24594 events. 15340/24594 cut-off events. For 201551/206409 co-relation queries the response was YES. Maximal size of possible extension queue 2265. Compared 198382 event pairs, 7475 based on Foata normal form. 4859/26231 useless extension candidates. Maximal degree in co-relation 142327. Up to 19877 conditions per place. [2023-08-27 00:45:49,424 INFO L140 encePairwiseOnDemand]: 1061/1074 looper letters, 264 selfloop transitions, 122 changer transitions 0/397 dead transitions. [2023-08-27 00:45:49,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 397 transitions, 6425 flow [2023-08-27 00:45:49,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 00:45:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 00:45:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3673 transitions. [2023-08-27 00:45:49,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419925512104283 [2023-08-27 00:45:49,427 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 3673 transitions. [2023-08-27 00:45:49,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 3673 transitions. [2023-08-27 00:45:49,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:45:49,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 3673 transitions. [2023-08-27 00:45:49,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 367.3) internal successors, (3673), 10 states have internal predecessors, (3673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:49,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 1074.0) internal successors, (11814), 11 states have internal predecessors, (11814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:49,433 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 1074.0) internal successors, (11814), 11 states have internal predecessors, (11814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:49,433 INFO L175 Difference]: Start difference. First operand has 227 places, 365 transitions, 5321 flow. Second operand 10 states and 3673 transitions. [2023-08-27 00:45:49,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 397 transitions, 6425 flow [2023-08-27 00:45:49,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 397 transitions, 6313 flow, removed 51 selfloop flow, removed 3 redundant places. [2023-08-27 00:45:49,834 INFO L231 Difference]: Finished difference. Result has 235 places, 366 transitions, 5579 flow [2023-08-27 00:45:49,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=5189, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5579, PETRI_PLACES=235, PETRI_TRANSITIONS=366} [2023-08-27 00:45:49,834 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 161 predicate places. [2023-08-27 00:45:49,834 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 366 transitions, 5579 flow [2023-08-27 00:45:49,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 359.3333333333333) internal successors, (10780), 30 states have internal predecessors, (10780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:49,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:45:49,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:45:49,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-27 00:45:50,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-08-27 00:45:50,041 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:45:50,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:45:50,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1570101336, now seen corresponding path program 1 times [2023-08-27 00:45:50,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:45:50,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866301264] [2023-08-27 00:45:50,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:45:50,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:45:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:45:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:45:50,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:45:50,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866301264] [2023-08-27 00:45:50,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866301264] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:45:50,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006047405] [2023-08-27 00:45:50,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:45:50,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:45:50,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:45:50,560 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:45:50,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-27 00:45:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:45:50,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-27 00:45:50,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:45:50,784 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-27 00:45:50,847 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-27 00:45:50,927 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:45:50,927 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:45:50,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:45:51,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:45:51,052 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:45:51,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:45:51,111 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:45:51,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:45:51,166 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:45:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:45:51,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:45:51,248 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1688 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1688) c_~B~0.base) c_~B~0.offset) 4294967296)) is different from false [2023-08-27 00:45:51,415 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1685 (Array Int Int))) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1685) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1686) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1687) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1688) c_~B~0.base) c_~B~0.offset) 4294967296)) is different from false [2023-08-27 00:45:51,470 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:45:51,470 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 31 treesize of output 32 [2023-08-27 00:45:51,491 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:45:51,492 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 7745 treesize of output 7617 [2023-08-27 00:45:51,508 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 113 treesize of output 111 [2023-08-27 00:45:51,517 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 111 treesize of output 107 [2023-08-27 00:45:51,524 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 222 treesize of output 206 [2023-08-27 00:45:51,532 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 106 treesize of output 98 [2023-08-27 00:45:51,780 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:45:51,781 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 62 [2023-08-27 00:45:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-08-27 00:45:51,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006047405] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:45:51,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:45:51,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2023-08-27 00:45:51,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588848871] [2023-08-27 00:45:51,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:45:51,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-27 00:45:51,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:45:51,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-27 00:45:51,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=442, Unknown=10, NotChecked=90, Total=650 [2023-08-27 00:45:51,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 1074 [2023-08-27 00:45:51,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 366 transitions, 5579 flow. Second operand has 26 states, 26 states have (on average 365.4230769230769) internal successors, (9501), 26 states have internal predecessors, (9501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:51,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:45:51,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 1074 [2023-08-27 00:45:51,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:45:58,218 INFO L124 PetriNetUnfolderBase]: 15241/24362 cut-off events. [2023-08-27 00:45:58,218 INFO L125 PetriNetUnfolderBase]: For 228175/231741 co-relation queries the response was YES. [2023-08-27 00:45:58,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144117 conditions, 24362 events. 15241/24362 cut-off events. For 228175/231741 co-relation queries the response was YES. Maximal size of possible extension queue 1932. Compared 194955 event pairs, 3975 based on Foata normal form. 4230/25637 useless extension candidates. Maximal degree in co-relation 144050. Up to 11022 conditions per place. [2023-08-27 00:45:58,393 INFO L140 encePairwiseOnDemand]: 1057/1074 looper letters, 378 selfloop transitions, 51 changer transitions 0/457 dead transitions. [2023-08-27 00:45:58,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 457 transitions, 7322 flow [2023-08-27 00:45:58,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 00:45:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 00:45:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4135 transitions. [2023-08-27 00:45:58,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3500084645336042 [2023-08-27 00:45:58,396 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 4135 transitions. [2023-08-27 00:45:58,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 4135 transitions. [2023-08-27 00:45:58,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:45:58,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 4135 transitions. [2023-08-27 00:45:58,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 375.90909090909093) internal successors, (4135), 11 states have internal predecessors, (4135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:58,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 1074.0) internal successors, (12888), 12 states have internal predecessors, (12888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:58,403 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 1074.0) internal successors, (12888), 12 states have internal predecessors, (12888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:58,403 INFO L175 Difference]: Start difference. First operand has 235 places, 366 transitions, 5579 flow. Second operand 11 states and 4135 transitions. [2023-08-27 00:45:58,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 457 transitions, 7322 flow [2023-08-27 00:45:58,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 457 transitions, 7114 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-08-27 00:45:58,822 INFO L231 Difference]: Finished difference. Result has 238 places, 365 transitions, 5491 flow [2023-08-27 00:45:58,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=5389, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5491, PETRI_PLACES=238, PETRI_TRANSITIONS=365} [2023-08-27 00:45:58,822 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 164 predicate places. [2023-08-27 00:45:58,822 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 365 transitions, 5491 flow [2023-08-27 00:45:58,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 365.4230769230769) internal successors, (9501), 26 states have internal predecessors, (9501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:58,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:45:58,823 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:45:58,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-27 00:45:59,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:45:59,024 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:45:59,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:45:59,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2029804986, now seen corresponding path program 1 times [2023-08-27 00:45:59,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:45:59,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760792212] [2023-08-27 00:45:59,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:45:59,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:45:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:45:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-27 00:45:59,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:45:59,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760792212] [2023-08-27 00:45:59,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760792212] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:45:59,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:45:59,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 00:45:59,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564993816] [2023-08-27 00:45:59,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:45:59,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 00:45:59,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:45:59,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 00:45:59,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 00:45:59,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 1074 [2023-08-27 00:45:59,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 365 transitions, 5491 flow. Second operand has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:45:59,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:45:59,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 1074 [2023-08-27 00:45:59,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:46:03,284 INFO L124 PetriNetUnfolderBase]: 12914/20788 cut-off events. [2023-08-27 00:46:03,285 INFO L125 PetriNetUnfolderBase]: For 196850/202038 co-relation queries the response was YES. [2023-08-27 00:46:03,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119434 conditions, 20788 events. 12914/20788 cut-off events. For 196850/202038 co-relation queries the response was YES. Maximal size of possible extension queue 1856. Compared 164338 event pairs, 8030 based on Foata normal form. 5184/23998 useless extension candidates. Maximal degree in co-relation 119368. Up to 20569 conditions per place. [2023-08-27 00:46:03,433 INFO L140 encePairwiseOnDemand]: 1071/1074 looper letters, 323 selfloop transitions, 1 changer transitions 0/356 dead transitions. [2023-08-27 00:46:03,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 356 transitions, 5924 flow [2023-08-27 00:46:03,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 00:46:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 00:46:03,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1332 transitions. [2023-08-27 00:46:03,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4134078212290503 [2023-08-27 00:46:03,435 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1332 transitions. [2023-08-27 00:46:03,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1332 transitions. [2023-08-27 00:46:03,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:46:03,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1332 transitions. [2023-08-27 00:46:03,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:03,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:03,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:03,437 INFO L175 Difference]: Start difference. First operand has 238 places, 365 transitions, 5491 flow. Second operand 3 states and 1332 transitions. [2023-08-27 00:46:03,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 356 transitions, 5924 flow [2023-08-27 00:46:03,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 356 transitions, 5842 flow, removed 1 selfloop flow, removed 8 redundant places. [2023-08-27 00:46:03,721 INFO L231 Difference]: Finished difference. Result has 230 places, 356 transitions, 5196 flow [2023-08-27 00:46:03,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=5194, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5196, PETRI_PLACES=230, PETRI_TRANSITIONS=356} [2023-08-27 00:46:03,722 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 156 predicate places. [2023-08-27 00:46:03,722 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 356 transitions, 5196 flow [2023-08-27 00:46:03,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:03,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:46:03,722 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:46:03,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-08-27 00:46:03,722 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:46:03,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:46:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2029804984, now seen corresponding path program 1 times [2023-08-27 00:46:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:46:03,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595157776] [2023-08-27 00:46:03,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:46:03,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:46:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:46:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-27 00:46:03,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:46:03,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595157776] [2023-08-27 00:46:03,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595157776] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:46:03,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:46:03,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 00:46:03,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914689199] [2023-08-27 00:46:03,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:46:03,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 00:46:03,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:46:03,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 00:46:03,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 00:46:03,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 1074 [2023-08-27 00:46:03,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 356 transitions, 5196 flow. Second operand has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:03,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:46:03,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 1074 [2023-08-27 00:46:03,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:46:07,742 INFO L124 PetriNetUnfolderBase]: 11848/19059 cut-off events. [2023-08-27 00:46:07,743 INFO L125 PetriNetUnfolderBase]: For 184939/189862 co-relation queries the response was YES. [2023-08-27 00:46:07,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105805 conditions, 19059 events. 11848/19059 cut-off events. For 184939/189862 co-relation queries the response was YES. Maximal size of possible extension queue 1604. Compared 147501 event pairs, 7241 based on Foata normal form. 5267/22525 useless extension candidates. Maximal degree in co-relation 105740. Up to 18851 conditions per place. [2023-08-27 00:46:07,878 INFO L140 encePairwiseOnDemand]: 1071/1074 looper letters, 300 selfloop transitions, 1 changer transitions 0/333 dead transitions. [2023-08-27 00:46:07,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 333 transitions, 5364 flow [2023-08-27 00:46:07,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 00:46:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 00:46:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1330 transitions. [2023-08-27 00:46:07,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4127870887647424 [2023-08-27 00:46:07,879 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1330 transitions. [2023-08-27 00:46:07,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1330 transitions. [2023-08-27 00:46:07,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:46:07,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1330 transitions. [2023-08-27 00:46:07,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 443.3333333333333) internal successors, (1330), 3 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:07,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:07,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:07,882 INFO L175 Difference]: Start difference. First operand has 230 places, 356 transitions, 5196 flow. Second operand 3 states and 1330 transitions. [2023-08-27 00:46:07,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 333 transitions, 5364 flow [2023-08-27 00:46:08,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 333 transitions, 5290 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-27 00:46:08,096 INFO L231 Difference]: Finished difference. Result has 226 places, 333 transitions, 4690 flow [2023-08-27 00:46:08,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=4688, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4690, PETRI_PLACES=226, PETRI_TRANSITIONS=333} [2023-08-27 00:46:08,096 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 152 predicate places. [2023-08-27 00:46:08,096 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 333 transitions, 4690 flow [2023-08-27 00:46:08,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:08,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:46:08,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:46:08,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-27 00:46:08,097 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:46:08,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:46:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1428503178, now seen corresponding path program 1 times [2023-08-27 00:46:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:46:08,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075990255] [2023-08-27 00:46:08,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:46:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:46:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:46:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:46:08,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:46:08,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075990255] [2023-08-27 00:46:08,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075990255] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:46:08,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567138844] [2023-08-27 00:46:08,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:46:08,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:46:08,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:46:08,238 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:46:08,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-27 00:46:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:46:08,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-27 00:46:08,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:46:08,569 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-27 00:46:08,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:46:08,583 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 11 treesize of output 3 [2023-08-27 00:46:08,712 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-27 00:46:08,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567138844] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:46:08,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:46:08,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-08-27 00:46:08,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271194802] [2023-08-27 00:46:08,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:46:08,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-27 00:46:08,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:46:08,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-27 00:46:08,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-08-27 00:46:08,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 1074 [2023-08-27 00:46:08,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 333 transitions, 4690 flow. Second operand has 14 states, 14 states have (on average 379.85714285714283) internal successors, (5318), 14 states have internal predecessors, (5318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:08,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:46:08,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 1074 [2023-08-27 00:46:08,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:46:11,986 INFO L124 PetriNetUnfolderBase]: 8695/14097 cut-off events. [2023-08-27 00:46:11,986 INFO L125 PetriNetUnfolderBase]: For 114576/115015 co-relation queries the response was YES. [2023-08-27 00:46:12,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80088 conditions, 14097 events. 8695/14097 cut-off events. For 114576/115015 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 98686 event pairs, 5095 based on Foata normal form. 861/13900 useless extension candidates. Maximal degree in co-relation 80024. Up to 12152 conditions per place. [2023-08-27 00:46:12,085 INFO L140 encePairwiseOnDemand]: 1057/1074 looper letters, 296 selfloop transitions, 68 changer transitions 0/392 dead transitions. [2023-08-27 00:46:12,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 392 transitions, 5900 flow [2023-08-27 00:46:12,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 00:46:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 00:46:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3510 transitions. [2023-08-27 00:46:12,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36312849162011174 [2023-08-27 00:46:12,089 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3510 transitions. [2023-08-27 00:46:12,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3510 transitions. [2023-08-27 00:46:12,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:46:12,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3510 transitions. [2023-08-27 00:46:12,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 390.0) internal successors, (3510), 9 states have internal predecessors, (3510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:12,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 1074.0) internal successors, (10740), 10 states have internal predecessors, (10740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:12,095 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 1074.0) internal successors, (10740), 10 states have internal predecessors, (10740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:12,095 INFO L175 Difference]: Start difference. First operand has 226 places, 333 transitions, 4690 flow. Second operand 9 states and 3510 transitions. [2023-08-27 00:46:12,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 392 transitions, 5900 flow [2023-08-27 00:46:12,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 392 transitions, 5899 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 00:46:12,272 INFO L231 Difference]: Finished difference. Result has 236 places, 337 transitions, 4924 flow [2023-08-27 00:46:12,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=4689, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4924, PETRI_PLACES=236, PETRI_TRANSITIONS=337} [2023-08-27 00:46:12,273 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 162 predicate places. [2023-08-27 00:46:12,273 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 337 transitions, 4924 flow [2023-08-27 00:46:12,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 379.85714285714283) internal successors, (5318), 14 states have internal predecessors, (5318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:12,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:46:12,274 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:46:12,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-27 00:46:12,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:46:12,474 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:46:12,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:46:12,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1500553179, now seen corresponding path program 2 times [2023-08-27 00:46:12,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:46:12,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589784912] [2023-08-27 00:46:12,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:46:12,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:46:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:46:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-27 00:46:12,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:46:12,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589784912] [2023-08-27 00:46:12,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589784912] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:46:12,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306197228] [2023-08-27 00:46:12,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 00:46:12,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:46:12,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:46:12,658 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:46:12,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-27 00:46:12,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 00:46:12,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:46:12,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-27 00:46:12,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:46:13,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-27 00:46:13,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:46:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-27 00:46:13,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306197228] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:46:13,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:46:13,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2023-08-27 00:46:13,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214251658] [2023-08-27 00:46:13,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:46:13,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 00:46:13,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:46:13,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 00:46:13,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-08-27 00:46:13,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 1074 [2023-08-27 00:46:13,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 337 transitions, 4924 flow. Second operand has 19 states, 19 states have (on average 382.42105263157896) internal successors, (7266), 19 states have internal predecessors, (7266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:13,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:46:13,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 1074 [2023-08-27 00:46:13,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:46:18,591 INFO L124 PetriNetUnfolderBase]: 15317/24063 cut-off events. [2023-08-27 00:46:18,591 INFO L125 PetriNetUnfolderBase]: For 238495/242512 co-relation queries the response was YES. [2023-08-27 00:46:18,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143592 conditions, 24063 events. 15317/24063 cut-off events. For 238495/242512 co-relation queries the response was YES. Maximal size of possible extension queue 1446. Compared 179350 event pairs, 6617 based on Foata normal form. 5638/27632 useless extension candidates. Maximal degree in co-relation 143524. Up to 11301 conditions per place. [2023-08-27 00:46:18,783 INFO L140 encePairwiseOnDemand]: 1061/1074 looper letters, 394 selfloop transitions, 147 changer transitions 0/553 dead transitions. [2023-08-27 00:46:18,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 553 transitions, 8377 flow [2023-08-27 00:46:18,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 00:46:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 00:46:18,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 4746 transitions. [2023-08-27 00:46:18,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3682495344506518 [2023-08-27 00:46:18,786 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 4746 transitions. [2023-08-27 00:46:18,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 4746 transitions. [2023-08-27 00:46:18,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:46:18,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 4746 transitions. [2023-08-27 00:46:18,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 395.5) internal successors, (4746), 12 states have internal predecessors, (4746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:18,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 1074.0) internal successors, (13962), 13 states have internal predecessors, (13962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:18,794 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 1074.0) internal successors, (13962), 13 states have internal predecessors, (13962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:18,794 INFO L175 Difference]: Start difference. First operand has 236 places, 337 transitions, 4924 flow. Second operand 12 states and 4746 transitions. [2023-08-27 00:46:18,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 553 transitions, 8377 flow [2023-08-27 00:46:19,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 553 transitions, 8129 flow, removed 20 selfloop flow, removed 7 redundant places. [2023-08-27 00:46:19,536 INFO L231 Difference]: Finished difference. Result has 246 places, 357 transitions, 5509 flow [2023-08-27 00:46:19,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=4470, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5509, PETRI_PLACES=246, PETRI_TRANSITIONS=357} [2023-08-27 00:46:19,537 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 172 predicate places. [2023-08-27 00:46:19,537 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 357 transitions, 5509 flow [2023-08-27 00:46:19,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 382.42105263157896) internal successors, (7266), 19 states have internal predecessors, (7266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:19,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:46:19,538 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:46:19,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-27 00:46:19,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-08-27 00:46:19,738 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:46:19,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:46:19,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1482336364, now seen corresponding path program 1 times [2023-08-27 00:46:19,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:46:19,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871731130] [2023-08-27 00:46:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:46:19,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:46:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:46:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:46:20,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:46:20,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871731130] [2023-08-27 00:46:20,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871731130] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:46:20,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635652826] [2023-08-27 00:46:20,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:46:20,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:46:20,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:46:20,395 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:46:20,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-27 00:46:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:46:20,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-27 00:46:20,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:46:20,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:46:20,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:46:20,680 INFO L322 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2023-08-27 00:46:20,680 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-27 00:46:20,797 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-27 00:46:20,882 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-27 00:46:20,882 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-27 00:46:20,965 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:46:20,999 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:46:21,057 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:46:21,057 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:46:21,118 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:46:21,144 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:46:21,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:46:21,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 14 treesize of output 16 [2023-08-27 00:46:21,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:46:21,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 14 treesize of output 16 [2023-08-27 00:46:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:46:21,313 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:46:21,590 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1963) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1964) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1965) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967296)) is different from false [2023-08-27 00:46:21,816 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:46:21,817 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 33 treesize of output 34 [2023-08-27 00:46:21,831 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:46:21,832 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 1097 treesize of output 1073 [2023-08-27 00:46:21,844 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 127 treesize of output 123 [2023-08-27 00:46:21,851 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 254 treesize of output 222 [2023-08-27 00:46:21,859 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 222 treesize of output 206 [2023-08-27 00:46:21,873 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 106 treesize of output 98 [2023-08-27 00:46:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-08-27 00:46:22,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635652826] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:46:22,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:46:22,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2023-08-27 00:46:22,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972595322] [2023-08-27 00:46:22,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:46:22,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-27 00:46:22,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:46:22,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-27 00:46:22,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=828, Unknown=11, NotChecked=60, Total=1056 [2023-08-27 00:46:22,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 1074 [2023-08-27 00:46:22,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 357 transitions, 5509 flow. Second operand has 33 states, 33 states have (on average 367.3333333333333) internal successors, (12122), 33 states have internal predecessors, (12122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:22,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:46:22,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 1074 [2023-08-27 00:46:22,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:46:29,552 INFO L124 PetriNetUnfolderBase]: 15281/23724 cut-off events. [2023-08-27 00:46:29,552 INFO L125 PetriNetUnfolderBase]: For 254416/258476 co-relation queries the response was YES. [2023-08-27 00:46:29,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150521 conditions, 23724 events. 15281/23724 cut-off events. For 254416/258476 co-relation queries the response was YES. Maximal size of possible extension queue 1621. Compared 175473 event pairs, 7013 based on Foata normal form. 4092/25665 useless extension candidates. Maximal degree in co-relation 150448. Up to 19881 conditions per place. [2023-08-27 00:46:29,742 INFO L140 encePairwiseOnDemand]: 1064/1074 looper letters, 297 selfloop transitions, 156 changer transitions 0/465 dead transitions. [2023-08-27 00:46:29,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 465 transitions, 7688 flow [2023-08-27 00:46:29,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 00:46:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 00:46:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4152 transitions. [2023-08-27 00:46:29,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35144743524631794 [2023-08-27 00:46:29,745 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 4152 transitions. [2023-08-27 00:46:29,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 4152 transitions. [2023-08-27 00:46:29,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:46:29,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 4152 transitions. [2023-08-27 00:46:29,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 377.45454545454544) internal successors, (4152), 11 states have internal predecessors, (4152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:29,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 1074.0) internal successors, (12888), 12 states have internal predecessors, (12888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:29,752 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 1074.0) internal successors, (12888), 12 states have internal predecessors, (12888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:29,752 INFO L175 Difference]: Start difference. First operand has 246 places, 357 transitions, 5509 flow. Second operand 11 states and 4152 transitions. [2023-08-27 00:46:29,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 465 transitions, 7688 flow [2023-08-27 00:46:30,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 465 transitions, 7593 flow, removed 35 selfloop flow, removed 2 redundant places. [2023-08-27 00:46:30,399 INFO L231 Difference]: Finished difference. Result has 257 places, 388 transitions, 6427 flow [2023-08-27 00:46:30,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=5335, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6427, PETRI_PLACES=257, PETRI_TRANSITIONS=388} [2023-08-27 00:46:30,400 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 183 predicate places. [2023-08-27 00:46:30,400 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 388 transitions, 6427 flow [2023-08-27 00:46:30,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 367.3333333333333) internal successors, (12122), 33 states have internal predecessors, (12122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:30,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:46:30,401 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:46:30,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-27 00:46:30,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-08-27 00:46:30,602 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:46:30,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:46:30,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1482336463, now seen corresponding path program 1 times [2023-08-27 00:46:30,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:46:30,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345166141] [2023-08-27 00:46:30,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:46:30,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:46:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:46:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:46:31,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:46:31,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345166141] [2023-08-27 00:46:31,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345166141] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:46:31,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769032886] [2023-08-27 00:46:31,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:46:31,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:46:31,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:46:31,396 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:46:31,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-27 00:46:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:46:31,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-27 00:46:31,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:46:31,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:46:31,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:46:31,679 INFO L322 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2023-08-27 00:46:31,679 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-27 00:46:31,806 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-27 00:46:31,895 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-27 00:46:31,895 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-27 00:46:31,950 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-27 00:46:31,975 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-27 00:46:32,049 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:46:32,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:46:32,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-27 00:46:32,135 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-27 00:46:32,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:46:32,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-27 00:46:32,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:46:32,263 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-27 00:46:32,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:46:32,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:46:32,446 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2046 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2046) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2023-08-27 00:46:32,549 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2046 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (v_ArrVal_2044 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_2044) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2045) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2046) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2023-08-27 00:46:32,774 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:46:32,774 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 35 treesize of output 36 [2023-08-27 00:46:32,791 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:46:32,792 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 4899 treesize of output 4803 [2023-08-27 00:46:32,807 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 143 treesize of output 139 [2023-08-27 00:46:32,815 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 139 treesize of output 131 [2023-08-27 00:46:32,823 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 131 treesize of output 115 [2023-08-27 00:46:32,834 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 146 treesize of output 114 [2023-08-27 00:46:33,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-08-27 00:46:33,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769032886] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:46:33,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:46:33,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2023-08-27 00:46:33,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728037172] [2023-08-27 00:46:33,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:46:33,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-27 00:46:33,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:46:33,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-27 00:46:33,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=786, Unknown=6, NotChecked=118, Total=1056 [2023-08-27 00:46:33,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 1074 [2023-08-27 00:46:33,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 388 transitions, 6427 flow. Second operand has 33 states, 33 states have (on average 358.3333333333333) internal successors, (11825), 33 states have internal predecessors, (11825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:33,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:46:33,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 1074 [2023-08-27 00:46:33,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:46:40,540 INFO L124 PetriNetUnfolderBase]: 14867/22982 cut-off events. [2023-08-27 00:46:40,541 INFO L125 PetriNetUnfolderBase]: For 255159/258997 co-relation queries the response was YES. [2023-08-27 00:46:40,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147056 conditions, 22982 events. 14867/22982 cut-off events. For 255159/258997 co-relation queries the response was YES. Maximal size of possible extension queue 1480. Compared 167370 event pairs, 6764 based on Foata normal form. 3860/24782 useless extension candidates. Maximal degree in co-relation 146980. Up to 19200 conditions per place. [2023-08-27 00:46:40,721 INFO L140 encePairwiseOnDemand]: 1064/1074 looper letters, 295 selfloop transitions, 146 changer transitions 0/453 dead transitions. [2023-08-27 00:46:40,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 453 transitions, 7905 flow [2023-08-27 00:46:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 00:46:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 00:46:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 4410 transitions. [2023-08-27 00:46:40,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34217877094972066 [2023-08-27 00:46:40,724 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 4410 transitions. [2023-08-27 00:46:40,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 4410 transitions. [2023-08-27 00:46:40,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:46:40,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 4410 transitions. [2023-08-27 00:46:40,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 367.5) internal successors, (4410), 12 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:40,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 1074.0) internal successors, (13962), 13 states have internal predecessors, (13962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:40,732 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 1074.0) internal successors, (13962), 13 states have internal predecessors, (13962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:40,732 INFO L175 Difference]: Start difference. First operand has 257 places, 388 transitions, 6427 flow. Second operand 12 states and 4410 transitions. [2023-08-27 00:46:40,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 453 transitions, 7905 flow [2023-08-27 00:46:41,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 453 transitions, 7805 flow, removed 13 selfloop flow, removed 6 redundant places. [2023-08-27 00:46:41,427 INFO L231 Difference]: Finished difference. Result has 262 places, 376 transitions, 6402 flow [2023-08-27 00:46:41,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=6110, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6402, PETRI_PLACES=262, PETRI_TRANSITIONS=376} [2023-08-27 00:46:41,427 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 188 predicate places. [2023-08-27 00:46:41,427 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 376 transitions, 6402 flow [2023-08-27 00:46:41,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 358.3333333333333) internal successors, (11825), 33 states have internal predecessors, (11825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:41,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:46:41,429 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:46:41,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-08-27 00:46:41,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-08-27 00:46:41,634 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:46:41,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:46:41,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1298304767, now seen corresponding path program 1 times [2023-08-27 00:46:41,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:46:41,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057909253] [2023-08-27 00:46:41,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:46:41,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:46:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:46:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:46:42,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:46:42,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057909253] [2023-08-27 00:46:42,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057909253] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:46:42,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923351067] [2023-08-27 00:46:42,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:46:42,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:46:42,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:46:42,330 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:46:42,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-27 00:46:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:46:42,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-27 00:46:42,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:46:42,623 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-27 00:46:42,755 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-27 00:46:42,835 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:46:42,836 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:46:42,903 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-27 00:46:42,926 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-27 00:46:42,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:46:42,996 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-27 00:46:43,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:46:43,083 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-27 00:46:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:46:43,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:46:43,483 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2119 (Array Int Int)) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2120 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_2119) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2120) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2121) c_~B~0.base) (+ 4 c_~B~0.offset)) 9223372039002259456))) is different from false [2023-08-27 00:46:43,560 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:46:43,560 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 32 treesize of output 33 [2023-08-27 00:46:43,574 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:46:43,574 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 311 treesize of output 299 [2023-08-27 00:46:43,582 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 70 treesize of output 66 [2023-08-27 00:46:43,599 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 134 treesize of output 126 [2023-08-27 00:46:43,605 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 126 treesize of output 110 [2023-08-27 00:46:43,869 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:46:43,870 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 29 treesize of output 34 [2023-08-27 00:46:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2023-08-27 00:46:43,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923351067] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:46:43,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:46:43,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 31 [2023-08-27 00:46:43,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137949592] [2023-08-27 00:46:43,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:46:43,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-27 00:46:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:46:43,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-27 00:46:43,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=855, Unknown=15, NotChecked=60, Total=1056 [2023-08-27 00:46:43,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 1074 [2023-08-27 00:46:43,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 376 transitions, 6402 flow. Second operand has 33 states, 33 states have (on average 348.3636363636364) internal successors, (11496), 33 states have internal predecessors, (11496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:43,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:46:43,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 1074 [2023-08-27 00:46:43,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:46:53,063 INFO L124 PetriNetUnfolderBase]: 14971/23406 cut-off events. [2023-08-27 00:46:53,064 INFO L125 PetriNetUnfolderBase]: For 299840/303558 co-relation queries the response was YES. [2023-08-27 00:46:53,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149608 conditions, 23406 events. 14971/23406 cut-off events. For 299840/303558 co-relation queries the response was YES. Maximal size of possible extension queue 1518. Compared 172171 event pairs, 5887 based on Foata normal form. 3727/25011 useless extension candidates. Maximal degree in co-relation 149532. Up to 17231 conditions per place. [2023-08-27 00:46:53,286 INFO L140 encePairwiseOnDemand]: 1059/1074 looper letters, 374 selfloop transitions, 217 changer transitions 0/623 dead transitions. [2023-08-27 00:46:53,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 623 transitions, 11762 flow [2023-08-27 00:46:53,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-27 00:46:53,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-27 00:46:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 7785 transitions. [2023-08-27 00:46:53,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32948197054342304 [2023-08-27 00:46:53,291 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 7785 transitions. [2023-08-27 00:46:53,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 7785 transitions. [2023-08-27 00:46:53,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:46:53,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 7785 transitions. [2023-08-27 00:46:53,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 353.8636363636364) internal successors, (7785), 22 states have internal predecessors, (7785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:53,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 1074.0) internal successors, (24702), 23 states have internal predecessors, (24702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:53,304 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 1074.0) internal successors, (24702), 23 states have internal predecessors, (24702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:53,304 INFO L175 Difference]: Start difference. First operand has 262 places, 376 transitions, 6402 flow. Second operand 22 states and 7785 transitions. [2023-08-27 00:46:53,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 623 transitions, 11762 flow [2023-08-27 00:46:54,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 623 transitions, 11329 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-08-27 00:46:54,107 INFO L231 Difference]: Finished difference. Result has 279 places, 461 transitions, 8146 flow [2023-08-27 00:46:54,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=6188, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=8146, PETRI_PLACES=279, PETRI_TRANSITIONS=461} [2023-08-27 00:46:54,108 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 205 predicate places. [2023-08-27 00:46:54,108 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 461 transitions, 8146 flow [2023-08-27 00:46:54,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 348.3636363636364) internal successors, (11496), 33 states have internal predecessors, (11496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:54,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:46:54,109 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:46:54,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-08-27 00:46:54,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:46:54,315 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:46:54,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:46:54,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1298304876, now seen corresponding path program 2 times [2023-08-27 00:46:54,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:46:54,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243313345] [2023-08-27 00:46:54,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:46:54,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:46:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:46:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-27 00:46:54,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:46:54,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243313345] [2023-08-27 00:46:54,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243313345] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:46:54,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:46:54,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 00:46:54,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969758130] [2023-08-27 00:46:54,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:46:54,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 00:46:54,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:46:54,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 00:46:54,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 00:46:54,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 1074 [2023-08-27 00:46:54,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 461 transitions, 8146 flow. Second operand has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:54,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:46:54,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 1074 [2023-08-27 00:46:54,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:46:58,524 INFO L124 PetriNetUnfolderBase]: 12209/19455 cut-off events. [2023-08-27 00:46:58,525 INFO L125 PetriNetUnfolderBase]: For 234402/237230 co-relation queries the response was YES. [2023-08-27 00:46:58,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126599 conditions, 19455 events. 12209/19455 cut-off events. For 234402/237230 co-relation queries the response was YES. Maximal size of possible extension queue 1218. Compared 142008 event pairs, 6679 based on Foata normal form. 2810/20921 useless extension candidates. Maximal degree in co-relation 126518. Up to 19183 conditions per place. [2023-08-27 00:46:58,714 INFO L140 encePairwiseOnDemand]: 1071/1074 looper letters, 403 selfloop transitions, 1 changer transitions 0/445 dead transitions. [2023-08-27 00:46:58,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 445 transitions, 8682 flow [2023-08-27 00:46:58,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 00:46:58,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 00:46:58,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1328 transitions. [2023-08-27 00:46:58,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121663563004345 [2023-08-27 00:46:58,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1328 transitions. [2023-08-27 00:46:58,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1328 transitions. [2023-08-27 00:46:58,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:46:58,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1328 transitions. [2023-08-27 00:46:58,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 442.6666666666667) internal successors, (1328), 3 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:58,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:58,848 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:58,848 INFO L175 Difference]: Start difference. First operand has 279 places, 461 transitions, 8146 flow. Second operand 3 states and 1328 transitions. [2023-08-27 00:46:58,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 445 transitions, 8682 flow [2023-08-27 00:46:59,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 445 transitions, 8592 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-27 00:46:59,425 INFO L231 Difference]: Finished difference. Result has 275 places, 445 transitions, 7786 flow [2023-08-27 00:46:59,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=7784, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7786, PETRI_PLACES=275, PETRI_TRANSITIONS=445} [2023-08-27 00:46:59,426 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 201 predicate places. [2023-08-27 00:46:59,426 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 445 transitions, 7786 flow [2023-08-27 00:46:59,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:59,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:46:59,426 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:46:59,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-08-27 00:46:59,426 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:46:59,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:46:59,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1298304873, now seen corresponding path program 1 times [2023-08-27 00:46:59,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:46:59,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696548337] [2023-08-27 00:46:59,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:46:59,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:46:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:46:59,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-27 00:46:59,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:46:59,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696548337] [2023-08-27 00:46:59,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696548337] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:46:59,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:46:59,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 00:46:59,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249548275] [2023-08-27 00:46:59,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:46:59,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 00:46:59,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:46:59,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 00:46:59,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 00:46:59,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 1074 [2023-08-27 00:46:59,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 445 transitions, 7786 flow. Second operand has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:46:59,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:46:59,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 1074 [2023-08-27 00:46:59,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:47:03,035 INFO L124 PetriNetUnfolderBase]: 10366/16498 cut-off events. [2023-08-27 00:47:03,035 INFO L125 PetriNetUnfolderBase]: For 207687/210161 co-relation queries the response was YES. [2023-08-27 00:47:03,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106565 conditions, 16498 events. 10366/16498 cut-off events. For 207687/210161 co-relation queries the response was YES. Maximal size of possible extension queue 987. Compared 116566 event pairs, 5342 based on Foata normal form. 3031/18397 useless extension candidates. Maximal degree in co-relation 106483. Up to 16242 conditions per place. [2023-08-27 00:47:03,183 INFO L140 encePairwiseOnDemand]: 1071/1074 looper letters, 375 selfloop transitions, 1 changer transitions 0/417 dead transitions. [2023-08-27 00:47:03,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 417 transitions, 8037 flow [2023-08-27 00:47:03,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 00:47:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 00:47:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1326 transitions. [2023-08-27 00:47:03,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41154562383612664 [2023-08-27 00:47:03,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1326 transitions. [2023-08-27 00:47:03,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1326 transitions. [2023-08-27 00:47:03,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:47:03,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1326 transitions. [2023-08-27 00:47:03,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 442.0) internal successors, (1326), 3 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:03,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:03,187 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1074.0) internal successors, (4296), 4 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:03,187 INFO L175 Difference]: Start difference. First operand has 275 places, 445 transitions, 7786 flow. Second operand 3 states and 1326 transitions. [2023-08-27 00:47:03,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 417 transitions, 8037 flow [2023-08-27 00:47:03,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 417 transitions, 8034 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 00:47:03,700 INFO L231 Difference]: Finished difference. Result has 274 places, 417 transitions, 7284 flow [2023-08-27 00:47:03,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=7282, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7284, PETRI_PLACES=274, PETRI_TRANSITIONS=417} [2023-08-27 00:47:03,700 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 200 predicate places. [2023-08-27 00:47:03,700 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 417 transitions, 7284 flow [2023-08-27 00:47:03,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:03,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:47:03,701 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:47:03,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-08-27 00:47:03,701 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:47:03,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:47:03,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1298304817, now seen corresponding path program 1 times [2023-08-27 00:47:03,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:47:03,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594515454] [2023-08-27 00:47:03,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:47:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:47:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:47:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:47:04,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:47:04,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594515454] [2023-08-27 00:47:04,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594515454] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:47:04,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524065081] [2023-08-27 00:47:04,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:47:04,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:47:04,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:47:04,460 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:47:04,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-08-27 00:47:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:47:04,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-27 00:47:04,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:47:04,772 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-27 00:47:04,894 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-27 00:47:04,969 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:47:04,970 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:47:05,037 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:47:05,047 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:47:05,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:05,115 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:47:05,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:05,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:47:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:47:05,245 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:47:05,375 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2264 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2264) c_~B~0.base) (+ 4 c_~B~0.offset)) 4294967296)) is different from false [2023-08-27 00:47:05,475 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2262 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_2262) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2264) c_~B~0.base) (+ 4 c_~B~0.offset)) 4294967296)) is different from false [2023-08-27 00:47:05,547 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:47:05,547 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 30 treesize of output 31 [2023-08-27 00:47:05,560 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:47:05,560 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 277 treesize of output 265 [2023-08-27 00:47:05,566 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 122 treesize of output 106 [2023-08-27 00:47:05,572 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 51 treesize of output 47 [2023-08-27 00:47:05,578 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 54 treesize of output 46 [2023-08-27 00:47:05,877 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:47:05,877 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 29 treesize of output 34 [2023-08-27 00:47:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2023-08-27 00:47:05,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524065081] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:47:05,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:47:05,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 31 [2023-08-27 00:47:05,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739657645] [2023-08-27 00:47:05,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:47:05,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-27 00:47:05,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:47:05,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-27 00:47:05,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=812, Unknown=9, NotChecked=118, Total=1056 [2023-08-27 00:47:05,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 1074 [2023-08-27 00:47:05,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 417 transitions, 7284 flow. Second operand has 33 states, 33 states have (on average 348.3636363636364) internal successors, (11496), 33 states have internal predecessors, (11496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:05,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:47:05,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 1074 [2023-08-27 00:47:05,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:47:13,326 INFO L124 PetriNetUnfolderBase]: 10860/17016 cut-off events. [2023-08-27 00:47:13,327 INFO L125 PetriNetUnfolderBase]: For 207075/209364 co-relation queries the response was YES. [2023-08-27 00:47:13,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109123 conditions, 17016 events. 10860/17016 cut-off events. For 207075/209364 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 117345 event pairs, 4419 based on Foata normal form. 2298/18185 useless extension candidates. Maximal degree in co-relation 109040. Up to 14519 conditions per place. [2023-08-27 00:47:13,470 INFO L140 encePairwiseOnDemand]: 1061/1074 looper letters, 351 selfloop transitions, 165 changer transitions 0/548 dead transitions. [2023-08-27 00:47:13,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 548 transitions, 10356 flow [2023-08-27 00:47:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-27 00:47:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-27 00:47:13,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 7423 transitions. [2023-08-27 00:47:13,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3291212201826727 [2023-08-27 00:47:13,475 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 7423 transitions. [2023-08-27 00:47:13,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 7423 transitions. [2023-08-27 00:47:13,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:47:13,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 7423 transitions. [2023-08-27 00:47:13,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 353.4761904761905) internal successors, (7423), 21 states have internal predecessors, (7423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:13,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 1074.0) internal successors, (23628), 22 states have internal predecessors, (23628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:13,487 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 1074.0) internal successors, (23628), 22 states have internal predecessors, (23628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:13,487 INFO L175 Difference]: Start difference. First operand has 274 places, 417 transitions, 7284 flow. Second operand 21 states and 7423 transitions. [2023-08-27 00:47:13,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 548 transitions, 10356 flow [2023-08-27 00:47:13,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 548 transitions, 10301 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-27 00:47:13,983 INFO L231 Difference]: Finished difference. Result has 291 places, 404 transitions, 7317 flow [2023-08-27 00:47:13,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=6987, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=7317, PETRI_PLACES=291, PETRI_TRANSITIONS=404} [2023-08-27 00:47:13,983 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 217 predicate places. [2023-08-27 00:47:13,983 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 404 transitions, 7317 flow [2023-08-27 00:47:13,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 348.3636363636364) internal successors, (11496), 33 states have internal predecessors, (11496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:13,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:47:13,985 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:47:13,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-08-27 00:47:14,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:47:14,185 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:47:14,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:47:14,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1403379818, now seen corresponding path program 1 times [2023-08-27 00:47:14,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:47:14,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105580055] [2023-08-27 00:47:14,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:47:14,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:47:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:47:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:47:14,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:47:14,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105580055] [2023-08-27 00:47:14,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105580055] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:47:14,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452057198] [2023-08-27 00:47:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:47:14,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:47:14,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:47:14,923 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:47:14,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-08-27 00:47:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:47:15,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-27 00:47:15,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:47:15,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:15,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:15,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:15,200 INFO L322 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-27 00:47:15,201 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-27 00:47:15,335 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-27 00:47:15,439 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-27 00:47:15,439 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-27 00:47:15,524 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:47:15,546 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:47:15,652 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-27 00:47:15,652 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-27 00:47:15,709 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:47:15,746 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:47:15,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:15,812 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:47:15,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:15,883 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:47:16,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:16,056 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:47:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:47:16,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:47:16,213 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2350 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2350) c_~A~0.base) (+ c_~A~0.offset 4 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 4294967296)) is different from false [2023-08-27 00:47:16,288 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2349) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2350) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967296)) is different from false [2023-08-27 00:47:16,759 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:47:16,759 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 36 treesize of output 37 [2023-08-27 00:47:16,784 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:47:16,785 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 69889 treesize of output 69121 [2023-08-27 00:47:16,824 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 263 treesize of output 255 [2023-08-27 00:47:16,835 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 255 treesize of output 251 [2023-08-27 00:47:16,845 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 251 treesize of output 219 [2023-08-27 00:47:16,855 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 219 treesize of output 203 [2023-08-27 00:47:16,866 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 266 treesize of output 202 [2023-08-27 00:47:17,130 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-27 00:47:17,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2023-08-27 00:47:17,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452057198] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:47:17,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:47:17,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2023-08-27 00:47:17,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706031459] [2023-08-27 00:47:17,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:47:17,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-27 00:47:17,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:47:17,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-27 00:47:17,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1073, Unknown=13, NotChecked=138, Total=1406 [2023-08-27 00:47:17,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 1074 [2023-08-27 00:47:17,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 404 transitions, 7317 flow. Second operand has 38 states, 38 states have (on average 366.3421052631579) internal successors, (13921), 38 states have internal predecessors, (13921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:17,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:47:17,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 1074 [2023-08-27 00:47:17,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:47:24,496 INFO L124 PetriNetUnfolderBase]: 12405/18976 cut-off events. [2023-08-27 00:47:24,496 INFO L125 PetriNetUnfolderBase]: For 262859/266736 co-relation queries the response was YES. [2023-08-27 00:47:24,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126137 conditions, 18976 events. 12405/18976 cut-off events. For 262859/266736 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 129772 event pairs, 3616 based on Foata normal form. 4493/22382 useless extension candidates. Maximal degree in co-relation 126054. Up to 10567 conditions per place. [2023-08-27 00:47:24,656 INFO L140 encePairwiseOnDemand]: 1065/1074 looper letters, 458 selfloop transitions, 96 changer transitions 0/568 dead transitions. [2023-08-27 00:47:24,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 568 transitions, 10229 flow [2023-08-27 00:47:24,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 00:47:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 00:47:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3794 transitions. [2023-08-27 00:47:24,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3532588454376164 [2023-08-27 00:47:24,658 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 3794 transitions. [2023-08-27 00:47:24,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 3794 transitions. [2023-08-27 00:47:24,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:47:24,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 3794 transitions. [2023-08-27 00:47:24,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 379.4) internal successors, (3794), 10 states have internal predecessors, (3794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:24,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 1074.0) internal successors, (11814), 11 states have internal predecessors, (11814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:24,665 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 1074.0) internal successors, (11814), 11 states have internal predecessors, (11814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:24,665 INFO L175 Difference]: Start difference. First operand has 291 places, 404 transitions, 7317 flow. Second operand 10 states and 3794 transitions. [2023-08-27 00:47:24,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 568 transitions, 10229 flow [2023-08-27 00:47:25,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 568 transitions, 9891 flow, removed 0 selfloop flow, removed 18 redundant places. [2023-08-27 00:47:25,233 INFO L231 Difference]: Finished difference. Result has 285 places, 413 transitions, 7574 flow [2023-08-27 00:47:25,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=7021, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7574, PETRI_PLACES=285, PETRI_TRANSITIONS=413} [2023-08-27 00:47:25,233 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 211 predicate places. [2023-08-27 00:47:25,233 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 413 transitions, 7574 flow [2023-08-27 00:47:25,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 366.3421052631579) internal successors, (13921), 38 states have internal predecessors, (13921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:25,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:47:25,235 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:47:25,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-08-27 00:47:25,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:47:25,435 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:47:25,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:47:25,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1590947699, now seen corresponding path program 1 times [2023-08-27 00:47:25,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:47:25,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490097676] [2023-08-27 00:47:25,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:47:25,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:47:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:47:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:47:26,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:47:26,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490097676] [2023-08-27 00:47:26,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490097676] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:47:26,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968740471] [2023-08-27 00:47:26,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:47:26,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:47:26,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:47:26,194 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:47:26,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-08-27 00:47:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:47:26,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-27 00:47:26,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:47:26,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:26,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:26,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:26,485 INFO L322 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-27 00:47:26,486 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-27 00:47:26,619 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-27 00:47:26,716 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-27 00:47:26,716 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-27 00:47:26,793 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-27 00:47:26,803 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-27 00:47:26,897 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:47:26,897 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:47:26,966 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-27 00:47:26,991 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-27 00:47:27,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:27,056 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-27 00:47:27,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:27,128 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-27 00:47:27,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:27,299 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-27 00:47:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:47:27,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:47:27,458 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2436 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2436) c_~A~0.base) (+ c_~A~0.offset 4 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 9223372039002259456))) is different from false [2023-08-27 00:47:28,099 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:47:28,099 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 38 treesize of output 39 [2023-08-27 00:47:28,118 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:47:28,118 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 4883 treesize of output 4835 [2023-08-27 00:47:28,147 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 295 treesize of output 287 [2023-08-27 00:47:28,157 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 287 treesize of output 271 [2023-08-27 00:47:28,169 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 271 treesize of output 267 [2023-08-27 00:47:28,179 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 267 treesize of output 235 [2023-08-27 00:47:28,192 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 298 treesize of output 234 [2023-08-27 00:47:28,565 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-27 00:47:28,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2023-08-27 00:47:28,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968740471] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:47:28,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:47:28,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2023-08-27 00:47:28,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58034970] [2023-08-27 00:47:28,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:47:28,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-27 00:47:28,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:47:28,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-27 00:47:28,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1126, Unknown=19, NotChecked=70, Total=1406 [2023-08-27 00:47:28,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 1074 [2023-08-27 00:47:28,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 413 transitions, 7574 flow. Second operand has 38 states, 38 states have (on average 366.3421052631579) internal successors, (13921), 38 states have internal predecessors, (13921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:28,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:47:28,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 1074 [2023-08-27 00:47:28,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:47:35,119 INFO L124 PetriNetUnfolderBase]: 11427/17574 cut-off events. [2023-08-27 00:47:35,120 INFO L125 PetriNetUnfolderBase]: For 256321/259898 co-relation queries the response was YES. [2023-08-27 00:47:35,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122737 conditions, 17574 events. 11427/17574 cut-off events. For 256321/259898 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 119939 event pairs, 3633 based on Foata normal form. 3986/20537 useless extension candidates. Maximal degree in co-relation 122651. Up to 10569 conditions per place. [2023-08-27 00:47:35,265 INFO L140 encePairwiseOnDemand]: 1065/1074 looper letters, 458 selfloop transitions, 95 changer transitions 0/567 dead transitions. [2023-08-27 00:47:35,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 567 transitions, 10252 flow [2023-08-27 00:47:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 00:47:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 00:47:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3792 transitions. [2023-08-27 00:47:35,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35307262569832404 [2023-08-27 00:47:35,268 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 3792 transitions. [2023-08-27 00:47:35,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 3792 transitions. [2023-08-27 00:47:35,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:47:35,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 3792 transitions. [2023-08-27 00:47:35,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 379.2) internal successors, (3792), 10 states have internal predecessors, (3792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:35,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 1074.0) internal successors, (11814), 11 states have internal predecessors, (11814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:35,274 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 1074.0) internal successors, (11814), 11 states have internal predecessors, (11814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:35,274 INFO L175 Difference]: Start difference. First operand has 285 places, 413 transitions, 7574 flow. Second operand 10 states and 3792 transitions. [2023-08-27 00:47:35,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 567 transitions, 10252 flow [2023-08-27 00:47:36,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 567 transitions, 10229 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-27 00:47:36,162 INFO L231 Difference]: Finished difference. Result has 290 places, 412 transitions, 7721 flow [2023-08-27 00:47:36,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=7531, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7721, PETRI_PLACES=290, PETRI_TRANSITIONS=412} [2023-08-27 00:47:36,163 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 216 predicate places. [2023-08-27 00:47:36,163 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 412 transitions, 7721 flow [2023-08-27 00:47:36,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 366.3421052631579) internal successors, (13921), 38 states have internal predecessors, (13921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:36,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:47:36,164 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:47:36,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-08-27 00:47:36,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-08-27 00:47:36,365 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:47:36,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:47:36,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1609733911, now seen corresponding path program 1 times [2023-08-27 00:47:36,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:47:36,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639734419] [2023-08-27 00:47:36,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:47:36,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:47:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:47:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:47:37,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:47:37,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639734419] [2023-08-27 00:47:37,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639734419] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:47:37,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989378803] [2023-08-27 00:47:37,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:47:37,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:47:37,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:47:37,222 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:47:37,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-08-27 00:47:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:47:37,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-27 00:47:37,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:47:37,528 INFO L322 Elim1Store]: treesize reduction 76, result has 30.3 percent of original size [2023-08-27 00:47:37,528 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 3 case distinctions, treesize of input 15 treesize of output 38 [2023-08-27 00:47:37,691 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-27 00:47:37,691 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-27 00:47:37,844 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-27 00:47:37,955 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-27 00:47:37,955 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-27 00:47:38,038 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-27 00:47:38,058 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-27 00:47:38,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:38,140 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 00:47:38,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:38,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 00:47:38,238 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-27 00:47:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:47:38,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:47:38,532 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2519 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2519) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2520) c_~B~0.base) (+ 4 c_~B~0.offset)) 9223372039002259456))) is different from false [2023-08-27 00:47:38,547 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2519 (Array Int Int)) (v_ArrVal_2518 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2519) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2520) c_~B~0.base) (+ 4 c_~B~0.offset)) 9223372039002259456))) is different from false [2023-08-27 00:47:38,770 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:47:38,771 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 35 treesize of output 36 [2023-08-27 00:47:38,786 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:47:38,786 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 2451 treesize of output 2403 [2023-08-27 00:47:38,799 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 143 treesize of output 135 [2023-08-27 00:47:38,806 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 135 treesize of output 119 [2023-08-27 00:47:38,814 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 119 treesize of output 115 [2023-08-27 00:47:38,822 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 146 treesize of output 114 [2023-08-27 00:47:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2023-08-27 00:47:39,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989378803] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:47:39,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:47:39,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 33 [2023-08-27 00:47:39,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378743886] [2023-08-27 00:47:39,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:47:39,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-27 00:47:39,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:47:39,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-27 00:47:39,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=918, Unknown=13, NotChecked=126, Total=1190 [2023-08-27 00:47:39,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 1074 [2023-08-27 00:47:39,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 412 transitions, 7721 flow. Second operand has 35 states, 35 states have (on average 347.34285714285716) internal successors, (12157), 35 states have internal predecessors, (12157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:39,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:47:39,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 1074 [2023-08-27 00:47:39,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:47:49,391 INFO L124 PetriNetUnfolderBase]: 14795/22649 cut-off events. [2023-08-27 00:47:49,391 INFO L125 PetriNetUnfolderBase]: For 373490/377393 co-relation queries the response was YES. [2023-08-27 00:47:49,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155892 conditions, 22649 events. 14795/22649 cut-off events. For 373490/377393 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 154659 event pairs, 4216 based on Foata normal form. 4395/25761 useless extension candidates. Maximal degree in co-relation 155806. Up to 10644 conditions per place. [2023-08-27 00:47:49,620 INFO L140 encePairwiseOnDemand]: 1062/1074 looper letters, 530 selfloop transitions, 97 changer transitions 0/661 dead transitions. [2023-08-27 00:47:49,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 661 transitions, 12946 flow [2023-08-27 00:47:49,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-27 00:47:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-27 00:47:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 8150 transitions. [2023-08-27 00:47:49,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3299327989636467 [2023-08-27 00:47:49,625 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 8150 transitions. [2023-08-27 00:47:49,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 8150 transitions. [2023-08-27 00:47:49,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:47:49,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 8150 transitions. [2023-08-27 00:47:49,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 354.3478260869565) internal successors, (8150), 23 states have internal predecessors, (8150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:49,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 1074.0) internal successors, (25776), 24 states have internal predecessors, (25776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:49,639 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 1074.0) internal successors, (25776), 24 states have internal predecessors, (25776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:49,639 INFO L175 Difference]: Start difference. First operand has 290 places, 412 transitions, 7721 flow. Second operand 23 states and 8150 transitions. [2023-08-27 00:47:49,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 661 transitions, 12946 flow [2023-08-27 00:47:50,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 661 transitions, 12727 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-27 00:47:50,508 INFO L231 Difference]: Finished difference. Result has 312 places, 425 transitions, 8046 flow [2023-08-27 00:47:50,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=7614, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=8046, PETRI_PLACES=312, PETRI_TRANSITIONS=425} [2023-08-27 00:47:50,508 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 238 predicate places. [2023-08-27 00:47:50,508 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 425 transitions, 8046 flow [2023-08-27 00:47:50,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 347.34285714285716) internal successors, (12157), 35 states have internal predecessors, (12157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:50,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:47:50,510 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:47:50,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-08-27 00:47:50,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2023-08-27 00:47:50,710 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:47:50,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:47:50,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1609733961, now seen corresponding path program 1 times [2023-08-27 00:47:50,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:47:50,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622955738] [2023-08-27 00:47:50,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:47:50,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:47:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:47:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 00:47:51,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:47:51,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622955738] [2023-08-27 00:47:51,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622955738] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:47:51,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652688840] [2023-08-27 00:47:51,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:47:51,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:47:51,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:47:51,547 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:47:51,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-08-27 00:47:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:47:51,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-27 00:47:51,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:47:51,892 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-27 00:47:52,041 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-27 00:47:52,140 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:47:52,140 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:47:52,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:47:52,259 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:47:52,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:52,330 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:47:52,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:52,409 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:47:52,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:47:52,476 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:47:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 00:47:52,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:47:52,682 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2600 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2600) c_~B~0.base) (+ 4 c_~B~0.offset)) 4294967296)) is different from false [2023-08-27 00:47:53,101 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:47:53,101 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 33 treesize of output 34 [2023-08-27 00:47:53,118 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:47:53,118 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 2193 treesize of output 2145 [2023-08-27 00:47:53,130 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 258 treesize of output 250 [2023-08-27 00:47:53,139 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 126 treesize of output 122 [2023-08-27 00:47:53,146 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 246 treesize of output 230 [2023-08-27 00:47:53,153 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 230 treesize of output 198 [2023-08-27 00:47:53,520 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:47:53,520 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 62 [2023-08-27 00:47:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-27 00:47:53,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652688840] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:47:53,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:47:53,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 34 [2023-08-27 00:47:53,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775897653] [2023-08-27 00:47:53,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:47:53,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-27 00:47:53,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:47:53,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-27 00:47:53,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1025, Unknown=21, NotChecked=66, Total=1260 [2023-08-27 00:47:53,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 1074 [2023-08-27 00:47:53,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 425 transitions, 8046 flow. Second operand has 36 states, 36 states have (on average 347.3611111111111) internal successors, (12505), 36 states have internal predecessors, (12505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:47:53,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:47:53,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 1074 [2023-08-27 00:47:53,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:48:03,008 INFO L124 PetriNetUnfolderBase]: 13638/20992 cut-off events. [2023-08-27 00:48:03,008 INFO L125 PetriNetUnfolderBase]: For 359613/363130 co-relation queries the response was YES. [2023-08-27 00:48:03,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151690 conditions, 20992 events. 13638/20992 cut-off events. For 359613/363130 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 142382 event pairs, 4047 based on Foata normal form. 4012/23810 useless extension candidates. Maximal degree in co-relation 151598. Up to 10639 conditions per place. [2023-08-27 00:48:03,227 INFO L140 encePairwiseOnDemand]: 1062/1074 looper letters, 522 selfloop transitions, 104 changer transitions 0/660 dead transitions. [2023-08-27 00:48:03,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 660 transitions, 12991 flow [2023-08-27 00:48:03,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-27 00:48:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-27 00:48:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 7104 transitions. [2023-08-27 00:48:03,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3307262569832402 [2023-08-27 00:48:03,232 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 7104 transitions. [2023-08-27 00:48:03,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 7104 transitions. [2023-08-27 00:48:03,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:48:03,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 7104 transitions. [2023-08-27 00:48:03,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 355.2) internal successors, (7104), 20 states have internal predecessors, (7104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:48:03,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 1074.0) internal successors, (22554), 21 states have internal predecessors, (22554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:48:03,244 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 1074.0) internal successors, (22554), 21 states have internal predecessors, (22554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:48:03,244 INFO L175 Difference]: Start difference. First operand has 312 places, 425 transitions, 8046 flow. Second operand 20 states and 7104 transitions. [2023-08-27 00:48:03,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 660 transitions, 12991 flow [2023-08-27 00:48:04,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 660 transitions, 12806 flow, removed 12 selfloop flow, removed 10 redundant places. [2023-08-27 00:48:04,312 INFO L231 Difference]: Finished difference. Result has 321 places, 424 transitions, 8055 flow [2023-08-27 00:48:04,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=7847, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=8055, PETRI_PLACES=321, PETRI_TRANSITIONS=424} [2023-08-27 00:48:04,312 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 247 predicate places. [2023-08-27 00:48:04,312 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 424 transitions, 8055 flow [2023-08-27 00:48:04,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 347.3611111111111) internal successors, (12505), 36 states have internal predecessors, (12505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:48:04,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:48:04,314 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:48:04,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-08-27 00:48:04,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:48:04,514 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:48:04,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:48:04,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1592747325, now seen corresponding path program 2 times [2023-08-27 00:48:04,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:48:04,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656410494] [2023-08-27 00:48:04,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:48:04,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:48:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:48:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-27 00:48:04,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:48:04,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656410494] [2023-08-27 00:48:04,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656410494] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:48:04,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371844109] [2023-08-27 00:48:04,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 00:48:04,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:48:04,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:48:04,708 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:48:04,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-08-27 00:48:04,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 00:48:04,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:48:04,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-27 00:48:04,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:48:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-27 00:48:05,143 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:48:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-27 00:48:05,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371844109] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:48:05,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:48:05,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2023-08-27 00:48:05,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489932050] [2023-08-27 00:48:05,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:48:05,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 00:48:05,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:48:05,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 00:48:05,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-08-27 00:48:05,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 1074 [2023-08-27 00:48:05,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 424 transitions, 8055 flow. Second operand has 19 states, 19 states have (on average 382.5263157894737) internal successors, (7268), 19 states have internal predecessors, (7268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:48:05,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:48:05,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 1074 [2023-08-27 00:48:05,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:48:10,500 INFO L124 PetriNetUnfolderBase]: 11877/18470 cut-off events. [2023-08-27 00:48:10,500 INFO L125 PetriNetUnfolderBase]: For 273317/276061 co-relation queries the response was YES. [2023-08-27 00:48:10,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129362 conditions, 18470 events. 11877/18470 cut-off events. For 273317/276061 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 124179 event pairs, 4257 based on Foata normal form. 3304/20818 useless extension candidates. Maximal degree in co-relation 129273. Up to 10454 conditions per place. [2023-08-27 00:48:10,671 INFO L140 encePairwiseOnDemand]: 1062/1074 looper letters, 463 selfloop transitions, 113 changer transitions 0/610 dead transitions. [2023-08-27 00:48:10,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 610 transitions, 11852 flow [2023-08-27 00:48:10,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 00:48:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 00:48:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 4720 transitions. [2023-08-27 00:48:10,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36623215394165115 [2023-08-27 00:48:10,674 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 4720 transitions. [2023-08-27 00:48:10,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 4720 transitions. [2023-08-27 00:48:10,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:48:10,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 4720 transitions. [2023-08-27 00:48:10,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 393.3333333333333) internal successors, (4720), 12 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:48:10,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 1074.0) internal successors, (13962), 13 states have internal predecessors, (13962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:48:10,682 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 1074.0) internal successors, (13962), 13 states have internal predecessors, (13962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:48:10,682 INFO L175 Difference]: Start difference. First operand has 321 places, 424 transitions, 8055 flow. Second operand 12 states and 4720 transitions. [2023-08-27 00:48:10,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 610 transitions, 11852 flow [2023-08-27 00:48:11,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 610 transitions, 11682 flow, removed 0 selfloop flow, removed 14 redundant places. [2023-08-27 00:48:11,296 INFO L231 Difference]: Finished difference. Result has 322 places, 429 transitions, 8262 flow [2023-08-27 00:48:11,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=7776, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8262, PETRI_PLACES=322, PETRI_TRANSITIONS=429} [2023-08-27 00:48:11,296 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 248 predicate places. [2023-08-27 00:48:11,296 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 429 transitions, 8262 flow [2023-08-27 00:48:11,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 382.5263157894737) internal successors, (7268), 19 states have internal predecessors, (7268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:48:11,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:48:11,297 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:48:11,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2023-08-27 00:48:11,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-08-27 00:48:11,498 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:48:11,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:48:11,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1104498143, now seen corresponding path program 3 times [2023-08-27 00:48:11,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:48:11,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948758774] [2023-08-27 00:48:11,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:48:11,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:48:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:48:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-27 00:48:12,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:48:12,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948758774] [2023-08-27 00:48:12,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948758774] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:48:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773404630] [2023-08-27 00:48:12,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 00:48:12,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:48:12,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:48:12,340 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:48:12,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-08-27 00:48:12,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-27 00:48:12,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:48:12,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-27 00:48:12,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:48:12,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:48:12,774 INFO L322 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2023-08-27 00:48:12,774 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-27 00:48:12,944 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-27 00:48:13,048 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-27 00:48:13,048 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-27 00:48:13,138 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 20 treesize of output 22 [2023-08-27 00:48:13,158 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 20 treesize of output 22 [2023-08-27 00:48:13,185 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 20 treesize of output 22 [2023-08-27 00:48:13,266 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:48:13,266 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:48:13,349 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 20 treesize of output 22 [2023-08-27 00:48:13,368 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 20 treesize of output 22 [2023-08-27 00:48:13,389 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 20 treesize of output 22 [2023-08-27 00:48:13,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:48:13,468 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 20 treesize of output 22 [2023-08-27 00:48:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-27 00:48:13,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:48:14,691 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:48:14,691 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 34 treesize of output 35 [2023-08-27 00:48:14,708 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:48:14,708 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 1363 treesize of output 1299 [2023-08-27 00:48:14,721 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 73 treesize of output 67 [2023-08-27 00:48:14,730 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 67 treesize of output 55 [2023-08-27 00:48:14,739 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 78 treesize of output 54 [2023-08-27 00:48:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-27 00:48:15,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773404630] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:48:15,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:48:15,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2023-08-27 00:48:15,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824534550] [2023-08-27 00:48:15,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:48:15,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-27 00:48:15,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:48:15,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-27 00:48:15,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1261, Unknown=4, NotChecked=0, Total=1406 [2023-08-27 00:48:15,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 1074 [2023-08-27 00:48:15,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 429 transitions, 8262 flow. Second operand has 38 states, 38 states have (on average 350.2631578947368) internal successors, (13310), 38 states have internal predecessors, (13310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:48:15,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:48:15,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 1074 [2023-08-27 00:48:15,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:48:42,262 WARN L234 SmtUtils]: Spent 26.14s on a formula simplification. DAG size of input: 98 DAG size of output: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 00:49:06,733 WARN L234 SmtUtils]: Spent 23.47s on a formula simplification. DAG size of input: 90 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 00:49:45,208 WARN L234 SmtUtils]: Spent 34.35s on a formula simplification. DAG size of input: 95 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 00:50:24,101 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-27 00:50:39,852 INFO L124 PetriNetUnfolderBase]: 14080/21972 cut-off events. [2023-08-27 00:50:39,852 INFO L125 PetriNetUnfolderBase]: For 382466/386952 co-relation queries the response was YES. [2023-08-27 00:50:39,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162762 conditions, 21972 events. 14080/21972 cut-off events. For 382466/386952 co-relation queries the response was YES. Maximal size of possible extension queue 908. Compared 154920 event pairs, 5417 based on Foata normal form. 4479/25182 useless extension candidates. Maximal degree in co-relation 162669. Up to 14729 conditions per place. [2023-08-27 00:50:40,066 INFO L140 encePairwiseOnDemand]: 1059/1074 looper letters, 418 selfloop transitions, 370 changer transitions 0/806 dead transitions. [2023-08-27 00:50:40,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 806 transitions, 15860 flow [2023-08-27 00:50:40,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-08-27 00:50:40,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2023-08-27 00:50:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 26524 transitions. [2023-08-27 00:50:40,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3292861576660459 [2023-08-27 00:50:40,082 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 26524 transitions. [2023-08-27 00:50:40,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 26524 transitions. [2023-08-27 00:50:40,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:50:40,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 26524 transitions. [2023-08-27 00:50:40,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 76 states, 75 states have (on average 353.6533333333333) internal successors, (26524), 75 states have internal predecessors, (26524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:50:40,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 76 states, 76 states have (on average 1074.0) internal successors, (81624), 76 states have internal predecessors, (81624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:50:40,137 INFO L81 ComplementDD]: Finished complementDD. Result has 76 states, 76 states have (on average 1074.0) internal successors, (81624), 76 states have internal predecessors, (81624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:50:40,137 INFO L175 Difference]: Start difference. First operand has 322 places, 429 transitions, 8262 flow. Second operand 75 states and 26524 transitions. [2023-08-27 00:50:40,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 806 transitions, 15860 flow [2023-08-27 00:50:40,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 806 transitions, 15609 flow, removed 24 selfloop flow, removed 8 redundant places. [2023-08-27 00:50:40,965 INFO L231 Difference]: Finished difference. Result has 400 places, 599 transitions, 12284 flow [2023-08-27 00:50:40,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1074, PETRI_DIFFERENCE_MINUEND_FLOW=8047, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=75, PETRI_FLOW=12284, PETRI_PLACES=400, PETRI_TRANSITIONS=599} [2023-08-27 00:50:40,966 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 326 predicate places. [2023-08-27 00:50:40,966 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 599 transitions, 12284 flow [2023-08-27 00:50:40,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 350.2631578947368) internal successors, (13310), 38 states have internal predecessors, (13310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 00:50:40,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:50:40,967 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:50:40,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-08-27 00:50:41,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2023-08-27 00:50:41,169 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2023-08-27 00:50:41,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:50:41,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1633437748, now seen corresponding path program 1 times [2023-08-27 00:50:41,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:50:41,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913661949] [2023-08-27 00:50:41,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:50:41,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:50:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:50:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 00:50:42,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:50:42,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913661949] [2023-08-27 00:50:42,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913661949] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:50:42,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887785180] [2023-08-27 00:50:42,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:50:42,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:50:42,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:50:42,153 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:50:42,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-08-27 00:50:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:50:42,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-27 00:50:42,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:50:42,515 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-27 00:50:42,657 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-27 00:50:42,757 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 00:50:42,757 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 00:50:42,836 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:50:42,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-27 00:50:42,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:50:42,883 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:50:42,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:50:42,975 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:50:43,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 00:50:43,048 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 00:50:43,312 INFO L322 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-08-27 00:50:43,312 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 344 treesize of output 357 [2023-08-27 00:50:43,588 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 78 treesize of output 54 [2023-08-27 00:50:43,676 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 12 treesize of output 10 [2023-08-27 00:50:43,687 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 12 treesize of output 10 [2023-08-27 00:50:43,698 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:50:43,699 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-08-27 00:50:43,713 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 11 treesize of output 9 [2023-08-27 00:50:43,726 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 11 treesize of output 9 [2023-08-27 00:50:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-27 00:50:43,921 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:50:45,269 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_2847 (Array Int Int)) (~C~0.offset Int)) (or (forall ((v_ArrVal_2846 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2846))) (let ((.cse0 (select (select .cse1 c_~B~0.base) c_~B~0.offset))) (or (< .cse0 0) (forall ((~A~0.offset Int) (~A~0.base Int)) (< 2147483647 (+ (select (select .cse1 ~A~0.base) ~A~0.offset) .cse0))) (< (select (select (store .cse1 c_~C~0.base v_ArrVal_2847) c_~B~0.base) .cse2) 4294967296) (< 4294967295 .cse0))))) (< (select v_ArrVal_2847 ~C~0.offset) 0))) (forall ((v_ArrVal_2846 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2846))) (let ((.cse3 (select (select .cse4 c_~B~0.base) c_~B~0.offset))) (or (< .cse3 0) (forall ((~C~0.offset Int) (v_ArrVal_2848 (Array Int Int))) (or (< (select (select (store .cse4 c_~C~0.base v_ArrVal_2848) c_~B~0.base) .cse2) 4294967296) (<= 0 (select v_ArrVal_2848 ~C~0.offset)))) (< 4294967295 .cse3))))) (forall ((v_ArrVal_2847 (Array Int Int)) (~C~0.offset Int)) (or (< (select v_ArrVal_2847 ~C~0.offset) 0) (forall ((v_ArrVal_2846 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2846))) (let ((.cse5 (select (select .cse6 c_~B~0.base) c_~B~0.offset))) (or (<= 0 .cse5) (< (+ 9223372039002259455 .cse5) 0) (< (select (select (store .cse6 c_~C~0.base v_ArrVal_2847) c_~B~0.base) .cse2) 4294967296))))))))) is different from false [2023-08-27 00:50:45,524 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_2846 (Array Int Int)) (v_ArrVal_2845 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2846))) (let ((.cse0 (select (select .cse1 c_~B~0.base) c_~B~0.offset))) (or (< .cse0 0) (< 4294967295 .cse0) (forall ((~C~0.offset Int) (v_ArrVal_2848 (Array Int Int))) (or (<= 0 (select v_ArrVal_2848 ~C~0.offset)) (< (select (select (store .cse1 c_~C~0.base v_ArrVal_2848) c_~B~0.base) .cse2) 4294967296))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_2845 (Array Int Int))) (or (< (select v_ArrVal_2847 ~C~0.offset) 0) (forall ((v_ArrVal_2846 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2846))) (let ((.cse3 (select (select .cse4 c_~B~0.base) c_~B~0.offset))) (or (<= 0 .cse3) (< (+ 9223372039002259455 .cse3) 0) (< (select (select (store .cse4 c_~C~0.base v_ArrVal_2847) c_~B~0.base) .cse2) 4294967296))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_2845 (Array Int Int))) (or (forall ((v_ArrVal_2846 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2846))) (let ((.cse5 (select (select .cse6 c_~B~0.base) c_~B~0.offset))) (or (< .cse5 0) (< 4294967295 .cse5) (forall ((~A~0.offset Int) (~A~0.base Int)) (< 2147483647 (+ (select (select .cse6 ~A~0.base) ~A~0.offset) .cse5))) (< (select (select (store .cse6 c_~C~0.base v_ArrVal_2847) c_~B~0.base) .cse2) 4294967296))))) (< (select v_ArrVal_2847 ~C~0.offset) 0))))) is different from false [2023-08-27 00:50:45,649 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_2847 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2844 (Array Int Int))) (or (forall ((v_ArrVal_2846 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2844) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2846))) (let ((.cse2 (select (select .cse0 c_~B~0.base) c_~B~0.offset))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_2847) c_~B~0.base) .cse1) 4294967296) (< 4294967295 .cse2) (forall ((~A~0.offset Int) (~A~0.base Int)) (< 2147483647 (+ .cse2 (select (select .cse0 ~A~0.base) ~A~0.offset)))) (< .cse2 0))))) (< (select v_ArrVal_2847 ~C~0.offset) 0))) (forall ((v_ArrVal_2846 (Array Int Int)) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2844 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2844) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2846))) (let ((.cse3 (select (select .cse4 c_~B~0.base) c_~B~0.offset))) (or (< 4294967295 .cse3) (< .cse3 0) (forall ((~C~0.offset Int) (v_ArrVal_2848 (Array Int Int))) (or (<= 0 (select v_ArrVal_2848 ~C~0.offset)) (< (select (select (store .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_2848) c_~B~0.base) .cse1) 4294967296))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2844 (Array Int Int))) (or (forall ((v_ArrVal_2846 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2844) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2846))) (let ((.cse6 (select (select .cse5 c_~B~0.base) c_~B~0.offset))) (or (< (select (select (store .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_2847) c_~B~0.base) .cse1) 4294967296) (< (+ 9223372039002259455 .cse6) 0) (<= 0 .cse6))))) (< (select v_ArrVal_2847 ~C~0.offset) 0))))) is different from false [2023-08-27 00:50:47,733 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_2846 (Array Int Int)) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_ArrVal_2843 (Array Int Int))) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_2843) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2844) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2846))) (let ((.cse2 (select (select .cse0 c_~B~0.base) c_~B~0.offset))) (or (forall ((~C~0.offset Int) (v_ArrVal_2848 (Array Int Int))) (or (<= 0 (select v_ArrVal_2848 ~C~0.offset)) (< (select (select (store .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_2848) c_~B~0.base) .cse1) 4294967296))) (< .cse2 0) (< 4294967295 .cse2))))) (forall ((v_ArrVal_2847 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_ArrVal_2843 (Array Int Int))) (or (forall ((v_ArrVal_2846 (Array Int Int))) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_2843) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2844) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2846))) (let ((.cse4 (select (select .cse3 c_~B~0.base) c_~B~0.offset))) (or (< (select (select (store .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_2847) c_~B~0.base) .cse1) 4294967296) (< (+ 9223372039002259455 .cse4) 0) (<= 0 .cse4))))) (< (select v_ArrVal_2847 ~C~0.offset) 0))) (forall ((v_ArrVal_2847 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_ArrVal_2843 (Array Int Int))) (or (forall ((v_ArrVal_2846 (Array Int Int))) (let ((.cse5 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_2843) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2844) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2846))) (let ((.cse6 (select (select .cse5 c_~B~0.base) c_~B~0.offset))) (or (forall ((~A~0.offset Int) (~A~0.base Int)) (< 2147483647 (+ (select (select .cse5 ~A~0.base) ~A~0.offset) .cse6))) (< (select (select (store .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_2847) c_~B~0.base) .cse1) 4294967296) (< .cse6 0) (< 4294967295 .cse6))))) (< (select v_ArrVal_2847 ~C~0.offset) 0))))) is different from false [2023-08-27 00:50:52,950 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:50:52,951 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 394 treesize of output 275 [2023-08-27 00:50:53,172 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:50:53,176 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 2884787 treesize of output 2815090 [2023-08-27 00:50:53,784 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:50:53,785 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 6991 treesize of output 6870 [2023-08-27 00:50:53,907 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:50:53,908 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 6851 treesize of output 6792 [2023-08-27 00:50:54,050 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:50:54,051 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 6783 treesize of output 6522 [2023-08-27 00:50:54,307 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:50:54,308 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 6503 treesize of output 5962 [2023-08-27 00:50:54,438 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:50:54,438 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 5943 treesize of output 5920 [2023-08-27 00:50:54,547 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 5909 treesize of output 5897 [2023-08-27 00:50:54,654 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 5897 treesize of output 5873 [2023-08-27 00:50:54,750 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-27 00:50:54,762 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 5873 treesize of output 5861 [2023-08-27 00:50:54,870 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 5861 treesize of output 5837 [2023-08-27 00:50:54,978 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 5837 treesize of output 5833 [2023-08-27 00:50:55,108 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:50:55,108 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 5833 treesize of output 5810 [2023-08-27 00:50:55,219 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 5799 treesize of output 5751 [2023-08-27 00:50:55,330 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 5751 treesize of output 5703 [2023-08-27 00:50:55,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 5703 treesize of output 5699 [2023-08-27 00:50:55,577 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 00:50:55,578 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 5699 treesize of output 5676 Received shutdown request... [2023-08-27 00:52:40,860 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 76 remaining) [2023-08-27 00:52:40,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2023-08-27 00:52:40,885 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 00:52:40,885 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 00:52:41,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:52:41,066 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. [2023-08-27 00:52:41,067 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 76 remaining) [2023-08-27 00:52:41,067 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 76 remaining) [2023-08-27 00:52:41,067 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 76 remaining) [2023-08-27 00:52:41,068 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 76 remaining) [2023-08-27 00:52:41,068 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 76 remaining) [2023-08-27 00:52:41,068 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 76 remaining) [2023-08-27 00:52:41,068 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 76 remaining) [2023-08-27 00:52:41,068 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 76 remaining) [2023-08-27 00:52:41,068 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 76 remaining) [2023-08-27 00:52:41,068 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 76 remaining) [2023-08-27 00:52:41,068 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 76 remaining) [2023-08-27 00:52:41,068 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 76 remaining) [2023-08-27 00:52:41,068 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 76 remaining) [2023-08-27 00:52:41,068 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 76 remaining) [2023-08-27 00:52:41,068 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 76 remaining) [2023-08-27 00:52:41,069 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 76 remaining) [2023-08-27 00:52:41,069 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 76 remaining) [2023-08-27 00:52:41,069 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 76 remaining) [2023-08-27 00:52:41,069 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 76 remaining) [2023-08-27 00:52:41,069 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 76 remaining) [2023-08-27 00:52:41,069 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 76 remaining) [2023-08-27 00:52:41,069 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 76 remaining) [2023-08-27 00:52:41,069 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 76 remaining) [2023-08-27 00:52:41,069 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 76 remaining) [2023-08-27 00:52:41,069 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 76 remaining) [2023-08-27 00:52:41,069 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 76 remaining) [2023-08-27 00:52:41,069 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 76 remaining) [2023-08-27 00:52:41,070 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 76 remaining) [2023-08-27 00:52:41,070 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 76 remaining) [2023-08-27 00:52:41,070 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 76 remaining) [2023-08-27 00:52:41,070 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 76 remaining) [2023-08-27 00:52:41,070 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 76 remaining) [2023-08-27 00:52:41,070 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 76 remaining) [2023-08-27 00:52:41,070 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 76 remaining) [2023-08-27 00:52:41,070 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 76 remaining) [2023-08-27 00:52:41,070 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 76 remaining) [2023-08-27 00:52:41,070 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 76 remaining) [2023-08-27 00:52:41,070 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 76 remaining) [2023-08-27 00:52:41,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 76 remaining) [2023-08-27 00:52:41,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 76 remaining) [2023-08-27 00:52:41,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 76 remaining) [2023-08-27 00:52:41,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 76 remaining) [2023-08-27 00:52:41,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (32 of 76 remaining) [2023-08-27 00:52:41,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 76 remaining) [2023-08-27 00:52:41,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 76 remaining) [2023-08-27 00:52:41,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 76 remaining) [2023-08-27 00:52:41,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 76 remaining) [2023-08-27 00:52:41,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 76 remaining) [2023-08-27 00:52:41,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 76 remaining) [2023-08-27 00:52:41,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 76 remaining) [2023-08-27 00:52:41,072 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 76 remaining) [2023-08-27 00:52:41,072 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 76 remaining) [2023-08-27 00:52:41,072 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 76 remaining) [2023-08-27 00:52:41,072 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 76 remaining) [2023-08-27 00:52:41,072 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 76 remaining) [2023-08-27 00:52:41,072 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 76 remaining) [2023-08-27 00:52:41,072 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 76 remaining) [2023-08-27 00:52:41,072 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 76 remaining) [2023-08-27 00:52:41,072 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 76 remaining) [2023-08-27 00:52:41,072 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 76 remaining) [2023-08-27 00:52:41,072 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 76 remaining) [2023-08-27 00:52:41,072 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 76 remaining) [2023-08-27 00:52:41,073 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 76 remaining) [2023-08-27 00:52:41,073 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 76 remaining) [2023-08-27 00:52:41,073 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 76 remaining) [2023-08-27 00:52:41,073 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 76 remaining) [2023-08-27 00:52:41,073 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 76 remaining) [2023-08-27 00:52:41,073 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 76 remaining) [2023-08-27 00:52:41,073 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 76 remaining) [2023-08-27 00:52:41,073 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 76 remaining) [2023-08-27 00:52:41,073 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 76 remaining) [2023-08-27 00:52:41,073 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 76 remaining) [2023-08-27 00:52:41,073 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 76 remaining) [2023-08-27 00:52:41,073 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 76 remaining) [2023-08-27 00:52:41,074 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 76 remaining) [2023-08-27 00:52:41,074 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:52:41,079 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 00:52:41,079 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 00:52:41,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 12:52:41 BasicIcfg [2023-08-27 00:52:41,080 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 00:52:41,081 INFO L158 Benchmark]: Toolchain (without parser) took 811379.96ms. Allocated memory was 381.7MB in the beginning and 10.3GB in the end (delta: 10.0GB). Free memory was 357.4MB in the beginning and 5.6GB in the end (delta: -5.2GB). Peak memory consumption was 5.4GB. Max. memory is 16.0GB. [2023-08-27 00:52:41,081 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 381.7MB. Free memory was 359.3MB in the beginning and 359.2MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 00:52:41,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.02ms. Allocated memory is still 381.7MB. Free memory was 357.4MB in the beginning and 344.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-27 00:52:41,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.25ms. Allocated memory is still 381.7MB. Free memory was 344.8MB in the beginning and 341.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 00:52:41,081 INFO L158 Benchmark]: Boogie Preprocessor took 51.03ms. Allocated memory is still 381.7MB. Free memory was 341.9MB in the beginning and 339.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 00:52:41,081 INFO L158 Benchmark]: RCFGBuilder took 597.27ms. Allocated memory is still 381.7MB. Free memory was 339.8MB in the beginning and 306.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-27 00:52:41,081 INFO L158 Benchmark]: TraceAbstraction took 810463.00ms. Allocated memory was 381.7MB in the beginning and 10.3GB in the end (delta: 10.0GB). Free memory was 306.3MB in the beginning and 5.6GB in the end (delta: -5.3GB). Peak memory consumption was 5.3GB. Max. memory is 16.0GB. [2023-08-27 00:52:41,082 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.09ms. Allocated memory is still 381.7MB. Free memory was 359.3MB in the beginning and 359.2MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 209.02ms. Allocated memory is still 381.7MB. Free memory was 357.4MB in the beginning and 344.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.25ms. Allocated memory is still 381.7MB. Free memory was 344.8MB in the beginning and 341.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 51.03ms. Allocated memory is still 381.7MB. Free memory was 341.9MB in the beginning and 339.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 597.27ms. Allocated memory is still 381.7MB. Free memory was 339.8MB in the beginning and 306.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 810463.00ms. Allocated memory was 381.7MB in the beginning and 10.3GB in the end (delta: 10.0GB). Free memory was 306.3MB in the beginning and 5.6GB in the end (delta: -5.3GB). Peak memory consumption was 5.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.9s, 420 PlacesBefore, 74 PlacesAfterwards, 449 TransitionsBefore, 70 TransitionsAfterwards, 38304 CoEnabledTransitionPairs, 9 FixpointIterations, 201 TrivialSequentialCompositions, 284 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 53 ConcurrentYvCompositions, 33 ChoiceCompositions, 611 TotalNumberOfCompositions, 41122 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38452, independent: 38365, independent conditional: 0, independent unconditional: 38365, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 22623, independent: 22576, independent conditional: 0, independent unconditional: 22576, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 38452, independent: 15789, independent conditional: 0, independent unconditional: 15789, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 22623, unknown conditional: 0, unknown unconditional: 22623] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 213, Positive conditional cache size: 0, Positive unconditional cache size: 213, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 83]: 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 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 84]: 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 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - TimeoutResultAtElement [Line: 85]: 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 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-12-4-9-3-10-3-7-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 637 locations, 76 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: 810.3s, OverallIterations: 51, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 439.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 28.1s, HoareTripleCheckerStatistics: 54 mSolverCounterUnknown, 6750 SdHoareTripleChecker+Valid, 53.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6750 mSDsluCounter, 632 SdHoareTripleChecker+Invalid, 49.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4348 IncrementalHoareTripleChecker+Unchecked, 559 mSDsCounter, 2360 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35401 IncrementalHoareTripleChecker+Invalid, 42163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2360 mSolverCounterUnsat, 73 mSDtfsCounter, 35401 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1503 GetRequests, 334 SyntacticMatches, 46 SemanticMatches, 1123 ConstructedPredicates, 35 IntricatePredicates, 0 DeprecatedPredicates, 12014 ImplicationChecksByTransitivity, 196.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12284occurred in iteration=50, InterpolantAutomatonStates: 524, 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.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 209.3s InterpolantComputationTime, 1054 NumberOfCodeBlocks, 1044 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 1370 ConstructedInterpolants, 265 QuantifiedInterpolants, 24868 SizeOfPredicates, 197 NumberOfNonLiveVariables, 8680 ConjunctsInSsa, 1005 ConjunctsInUnsatCore, 116 InterpolantComputations, 18 PerfectInterpolantSequences, 294/737 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