/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 14:18:19,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 14:18:19,620 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 14:18:19,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 14:18:19,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 14:18:19,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 14:18:19,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 14:18:19,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 14:18:19,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 14:18:19,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 14:18:19,656 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 14:18:19,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 14:18:19,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 14:18:19,657 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 14:18:19,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 14:18:19,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 14:18:19,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 14:18:19,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 14:18:19,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 14:18:19,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 14:18:19,658 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 14:18:19,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 14:18:19,659 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 14:18:19,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 14:18:19,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 14:18:19,660 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 14:18:19,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 14:18:19,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 14:18:19,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 14:18:19,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 14:18:19,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 14:18:19,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 14:18:19,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 14:18:19,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 14:18:19,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 14:18:19,663 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 14:18:20,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 14:18:20,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 14:18:20,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 14:18:20,043 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 14:18:20,043 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 14:18:20,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2023-08-27 14:18:21,206 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 14:18:21,451 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 14:18:21,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2023-08-27 14:18:21,459 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a99c0336/da5b1945ca854b269fb0bd9516b7667c/FLAG20dccbdf1 [2023-08-27 14:18:21,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a99c0336/da5b1945ca854b269fb0bd9516b7667c [2023-08-27 14:18:21,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 14:18:21,476 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 14:18:21,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 14:18:21,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 14:18:21,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 14:18:21,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:18:21" (1/1) ... [2023-08-27 14:18:21,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a411940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:18:21, skipping insertion in model container [2023-08-27 14:18:21,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:18:21" (1/1) ... [2023-08-27 14:18:21,500 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 14:18:21,697 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 14:18:21,708 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 14:18:21,746 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 14:18:21,756 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 14:18:21,756 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 14:18:21,762 INFO L206 MainTranslator]: Completed translation [2023-08-27 14:18:21,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:18:21 WrapperNode [2023-08-27 14:18:21,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 14:18:21,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 14:18:21,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 14:18:21,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 14:18:21,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:18:21" (1/1) ... [2023-08-27 14:18:21,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:18:21" (1/1) ... [2023-08-27 14:18:21,827 INFO L138 Inliner]: procedures = 25, calls = 53, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 376 [2023-08-27 14:18:21,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 14:18:21,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 14:18:21,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 14:18:21,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 14:18:21,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:18:21" (1/1) ... [2023-08-27 14:18:21,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:18:21" (1/1) ... [2023-08-27 14:18:21,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:18:21" (1/1) ... [2023-08-27 14:18:21,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:18:21" (1/1) ... [2023-08-27 14:18:21,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:18:21" (1/1) ... [2023-08-27 14:18:21,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:18:21" (1/1) ... [2023-08-27 14:18:21,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:18:21" (1/1) ... [2023-08-27 14:18:21,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:18:21" (1/1) ... [2023-08-27 14:18:21,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 14:18:21,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 14:18:21,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 14:18:21,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 14:18:21,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:18:21" (1/1) ... [2023-08-27 14:18:21,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 14:18:21,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:18:21,913 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 14:18:21,929 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 14:18:21,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 14:18:21,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 14:18:21,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 14:18:21,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 14:18:21,952 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-27 14:18:21,952 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-27 14:18:21,952 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-27 14:18:21,952 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-27 14:18:21,952 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-27 14:18:21,952 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-27 14:18:21,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 14:18:21,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 14:18:21,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 14:18:21,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-27 14:18:21,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 14:18:21,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 14:18:21,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 14:18:21,955 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 14:18:22,052 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 14:18:22,054 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 14:18:22,659 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 14:18:23,817 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 14:18:23,817 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-27 14:18:23,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:18:23 BoogieIcfgContainer [2023-08-27 14:18:23,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 14:18:23,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 14:18:23,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 14:18:23,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 14:18:23,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 02:18:21" (1/3) ... [2023-08-27 14:18:23,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b701f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 02:18:23, skipping insertion in model container [2023-08-27 14:18:23,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:18:21" (2/3) ... [2023-08-27 14:18:23,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b701f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 02:18:23, skipping insertion in model container [2023-08-27 14:18:23,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:18:23" (3/3) ... [2023-08-27 14:18:23,829 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2023-08-27 14:18:23,845 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 14:18:23,845 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2023-08-27 14:18:23,846 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 14:18:24,195 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-27 14:18:24,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 242 transitions, 508 flow [2023-08-27 14:18:24,313 INFO L124 PetriNetUnfolderBase]: 16/239 cut-off events. [2023-08-27 14:18:24,314 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-27 14:18:24,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 239 events. 16/239 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 397 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 185. Up to 2 conditions per place. [2023-08-27 14:18:24,319 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 242 transitions, 508 flow [2023-08-27 14:18:24,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 228 transitions, 474 flow [2023-08-27 14:18:24,328 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 14:18:24,335 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 228 transitions, 474 flow [2023-08-27 14:18:24,338 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 228 transitions, 474 flow [2023-08-27 14:18:24,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 228 transitions, 474 flow [2023-08-27 14:18:24,401 INFO L124 PetriNetUnfolderBase]: 16/228 cut-off events. [2023-08-27 14:18:24,401 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-27 14:18:24,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 228 events. 16/228 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 394 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 185. Up to 2 conditions per place. [2023-08-27 14:18:24,407 INFO L119 LiptonReduction]: Number of co-enabled transitions 6318 [2023-08-27 14:19:06,325 INFO L134 LiptonReduction]: Checked pairs total: 8301 [2023-08-27 14:19:06,325 INFO L136 LiptonReduction]: Total number of compositions: 236 [2023-08-27 14:19:06,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 14:19:06,343 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;@32fd83b3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 14:19:06,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2023-08-27 14:19:06,345 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 14:19:06,345 INFO L124 PetriNetUnfolderBase]: 1/2 cut-off events. [2023-08-27 14:19:06,345 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 14:19:06,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:19:06,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-27 14:19:06,346 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:19:06,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:19:06,351 INFO L85 PathProgramCache]: Analyzing trace with hash 54061, now seen corresponding path program 1 times [2023-08-27 14:19:06,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:19:06,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541620213] [2023-08-27 14:19:06,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:06,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:19:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:06,670 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 14:19:06,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:19:06,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541620213] [2023-08-27 14:19:06,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541620213] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:19:06,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:19:06,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 14:19:06,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484749053] [2023-08-27 14:19:06,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:19:06,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 14:19:06,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:19:06,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 14:19:06,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 14:19:06,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 478 [2023-08-27 14:19:06,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:06,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:19:06,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 478 [2023-08-27 14:19:06,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:19:11,162 INFO L124 PetriNetUnfolderBase]: 13244/16445 cut-off events. [2023-08-27 14:19:11,163 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2023-08-27 14:19:11,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33161 conditions, 16445 events. 13244/16445 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 2050. Compared 80278 event pairs, 6487 based on Foata normal form. 0/3324 useless extension candidates. Maximal degree in co-relation 30621. Up to 16310 conditions per place. [2023-08-27 14:19:11,262 INFO L140 encePairwiseOnDemand]: 451/478 looper letters, 50 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2023-08-27 14:19:11,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 244 flow [2023-08-27 14:19:11,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:19:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:19:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2023-08-27 14:19:11,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4072524407252441 [2023-08-27 14:19:11,281 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 584 transitions. [2023-08-27 14:19:11,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 584 transitions. [2023-08-27 14:19:11,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:19:11,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 584 transitions. [2023-08-27 14:19:11,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:11,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 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 14:19:11,300 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 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 14:19:11,302 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 162 flow. Second operand 3 states and 584 transitions. [2023-08-27 14:19:11,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 244 flow [2023-08-27 14:19:11,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 232 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-27 14:19:11,361 INFO L231 Difference]: Finished difference. Result has 57 places, 58 transitions, 158 flow [2023-08-27 14:19:11,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=57, PETRI_TRANSITIONS=58} [2023-08-27 14:19:11,366 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -20 predicate places. [2023-08-27 14:19:11,366 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 58 transitions, 158 flow [2023-08-27 14:19:11,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:11,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:19:11,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 14:19:11,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 14:19:11,368 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:19:11,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:19:11,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1677498, now seen corresponding path program 1 times [2023-08-27 14:19:11,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:19:11,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184372674] [2023-08-27 14:19:11,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:11,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:19:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:11,482 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 14:19:11,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:19:11,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184372674] [2023-08-27 14:19:11,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184372674] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:19:11,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:19:11,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 14:19:11,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513205998] [2023-08-27 14:19:11,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:19:11,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 14:19:11,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:19:11,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 14:19:11,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 14:19:11,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 478 [2023-08-27 14:19:11,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 58 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:11,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:19:11,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 478 [2023-08-27 14:19:11,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:19:15,429 INFO L124 PetriNetUnfolderBase]: 13244/16443 cut-off events. [2023-08-27 14:19:15,430 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-27 14:19:15,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32906 conditions, 16443 events. 13244/16443 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 2050. Compared 80029 event pairs, 6487 based on Foata normal form. 0/3326 useless extension candidates. Maximal degree in co-relation 32864. Up to 16302 conditions per place. [2023-08-27 14:19:15,494 INFO L140 encePairwiseOnDemand]: 474/478 looper letters, 50 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2023-08-27 14:19:15,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 256 flow [2023-08-27 14:19:15,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:19:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:19:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2023-08-27 14:19:15,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3891213389121339 [2023-08-27 14:19:15,497 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 558 transitions. [2023-08-27 14:19:15,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 558 transitions. [2023-08-27 14:19:15,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:19:15,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 558 transitions. [2023-08-27 14:19:15,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:15,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 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 14:19:15,502 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 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 14:19:15,503 INFO L175 Difference]: Start difference. First operand has 57 places, 58 transitions, 158 flow. Second operand 3 states and 558 transitions. [2023-08-27 14:19:15,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 256 flow [2023-08-27 14:19:15,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 14:19:15,504 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 146 flow [2023-08-27 14:19:15,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2023-08-27 14:19:15,505 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -22 predicate places. [2023-08-27 14:19:15,505 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 146 flow [2023-08-27 14:19:15,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:15,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:19:15,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 14:19:15,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 14:19:15,507 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:19:15,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:19:15,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1677500, now seen corresponding path program 1 times [2023-08-27 14:19:15,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:19:15,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631450656] [2023-08-27 14:19:15,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:15,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:19:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:15,560 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 14:19:15,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:19:15,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631450656] [2023-08-27 14:19:15,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631450656] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:19:15,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734045760] [2023-08-27 14:19:15,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:15,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:19:15,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:19:15,565 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 14:19:15,611 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 14:19:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:15,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-27 14:19:15,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:19:16,020 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 14:19:16,020 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:19:16,039 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 14:19:16,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734045760] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:19:16,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:19:16,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2023-08-27 14:19:16,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350195571] [2023-08-27 14:19:16,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:19:16,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 14:19:16,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:19:16,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 14:19:16,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 14:19:16,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 478 [2023-08-27 14:19:16,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 146 flow. Second operand has 7 states, 7 states have (on average 170.14285714285714) internal successors, (1191), 7 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:16,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:19:16,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 478 [2023-08-27 14:19:16,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:19:19,895 INFO L124 PetriNetUnfolderBase]: 13250/16455 cut-off events. [2023-08-27 14:19:19,895 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-27 14:19:19,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32943 conditions, 16455 events. 13250/16455 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 2050. Compared 80169 event pairs, 6487 based on Foata normal form. 0/3335 useless extension candidates. Maximal degree in co-relation 32864. Up to 16311 conditions per place. [2023-08-27 14:19:19,967 INFO L140 encePairwiseOnDemand]: 471/478 looper letters, 48 selfloop transitions, 17 changer transitions 0/68 dead transitions. [2023-08-27 14:19:19,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 330 flow [2023-08-27 14:19:19,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 14:19:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 14:19:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1085 transitions. [2023-08-27 14:19:19,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3783124128312413 [2023-08-27 14:19:19,972 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1085 transitions. [2023-08-27 14:19:19,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1085 transitions. [2023-08-27 14:19:19,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:19:19,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1085 transitions. [2023-08-27 14:19:19,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:19,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:19,980 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:19,980 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 146 flow. Second operand 6 states and 1085 transitions. [2023-08-27 14:19:19,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 330 flow [2023-08-27 14:19:19,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 14:19:19,982 INFO L231 Difference]: Finished difference. Result has 61 places, 68 transitions, 258 flow [2023-08-27 14:19:19,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=61, PETRI_TRANSITIONS=68} [2023-08-27 14:19:19,983 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -16 predicate places. [2023-08-27 14:19:19,983 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 258 flow [2023-08-27 14:19:19,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 170.14285714285714) internal successors, (1191), 7 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:19,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:19:19,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 14:19:19,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-27 14:19:20,192 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 14:19:20,192 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:19:20,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:19:20,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1544821554, now seen corresponding path program 1 times [2023-08-27 14:19:20,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:19:20,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967651714] [2023-08-27 14:19:20,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:20,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:19:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:20,333 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 14:19:20,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:19:20,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967651714] [2023-08-27 14:19:20,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967651714] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:19:20,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:19:20,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 14:19:20,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424492917] [2023-08-27 14:19:20,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:19:20,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 14:19:20,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:19:20,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 14:19:20,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 14:19:20,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 478 [2023-08-27 14:19:20,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:20,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:19:20,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 478 [2023-08-27 14:19:20,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:19:24,513 INFO L124 PetriNetUnfolderBase]: 18775/23842 cut-off events. [2023-08-27 14:19:24,513 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-27 14:19:24,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47845 conditions, 23842 events. 18775/23842 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2890. Compared 131213 event pairs, 4616 based on Foata normal form. 0/5264 useless extension candidates. Maximal degree in co-relation 47780. Up to 14414 conditions per place. [2023-08-27 14:19:24,623 INFO L140 encePairwiseOnDemand]: 473/478 looper letters, 96 selfloop transitions, 3 changer transitions 0/101 dead transitions. [2023-08-27 14:19:24,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 101 transitions, 524 flow [2023-08-27 14:19:24,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:19:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:19:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2023-08-27 14:19:24,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43375174337517436 [2023-08-27 14:19:24,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 622 transitions. [2023-08-27 14:19:24,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 622 transitions. [2023-08-27 14:19:24,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:19:24,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 622 transitions. [2023-08-27 14:19:24,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:24,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 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 14:19:24,632 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 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 14:19:24,632 INFO L175 Difference]: Start difference. First operand has 61 places, 68 transitions, 258 flow. Second operand 3 states and 622 transitions. [2023-08-27 14:19:24,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 101 transitions, 524 flow [2023-08-27 14:19:24,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 101 transitions, 498 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-27 14:19:24,635 INFO L231 Difference]: Finished difference. Result has 63 places, 70 transitions, 253 flow [2023-08-27 14:19:24,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=63, PETRI_TRANSITIONS=70} [2023-08-27 14:19:24,636 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -14 predicate places. [2023-08-27 14:19:24,636 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 70 transitions, 253 flow [2023-08-27 14:19:24,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:24,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:19:24,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 14:19:24,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 14:19:24,637 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:19:24,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:19:24,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1544821683, now seen corresponding path program 1 times [2023-08-27 14:19:24,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:19:24,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564319057] [2023-08-27 14:19:24,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:24,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:19:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:24,807 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 14:19:24,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:19:24,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564319057] [2023-08-27 14:19:24,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564319057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:19:24,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:19:24,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 14:19:24,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523718473] [2023-08-27 14:19:24,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:19:24,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 14:19:24,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:19:24,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 14:19:24,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 14:19:24,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 478 [2023-08-27 14:19:24,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 70 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:24,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:19:24,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 478 [2023-08-27 14:19:24,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:19:28,566 INFO L124 PetriNetUnfolderBase]: 17637/22705 cut-off events. [2023-08-27 14:19:28,566 INFO L125 PetriNetUnfolderBase]: For 1282/1282 co-relation queries the response was YES. [2023-08-27 14:19:28,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47753 conditions, 22705 events. 17637/22705 cut-off events. For 1282/1282 co-relation queries the response was YES. Maximal size of possible extension queue 3180. Compared 129723 event pairs, 10487 based on Foata normal form. 3/5665 useless extension candidates. Maximal degree in co-relation 47693. Up to 22486 conditions per place. [2023-08-27 14:19:28,688 INFO L140 encePairwiseOnDemand]: 473/478 looper letters, 59 selfloop transitions, 7 changer transitions 1/69 dead transitions. [2023-08-27 14:19:28,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 69 transitions, 382 flow [2023-08-27 14:19:28,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 14:19:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 14:19:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 648 transitions. [2023-08-27 14:19:28,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3389121338912134 [2023-08-27 14:19:28,691 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 648 transitions. [2023-08-27 14:19:28,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 648 transitions. [2023-08-27 14:19:28,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:19:28,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 648 transitions. [2023-08-27 14:19:28,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:28,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:28,697 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:28,697 INFO L175 Difference]: Start difference. First operand has 63 places, 70 transitions, 253 flow. Second operand 4 states and 648 transitions. [2023-08-27 14:19:28,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 69 transitions, 382 flow [2023-08-27 14:19:28,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 14:19:28,700 INFO L231 Difference]: Finished difference. Result has 65 places, 68 transitions, 255 flow [2023-08-27 14:19:28,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=65, PETRI_TRANSITIONS=68} [2023-08-27 14:19:28,701 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -12 predicate places. [2023-08-27 14:19:28,701 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 255 flow [2023-08-27 14:19:28,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:28,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:19:28,702 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2023-08-27 14:19:28,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 14:19:28,702 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:19:28,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:19:28,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1563607315, now seen corresponding path program 2 times [2023-08-27 14:19:28,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:19:28,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450450756] [2023-08-27 14:19:28,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:28,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:19:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:28,784 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 14:19:28,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:19:28,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450450756] [2023-08-27 14:19:28,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450450756] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:19:28,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217870874] [2023-08-27 14:19:28,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 14:19:28,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:19:28,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:19:28,793 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 14:19:28,834 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 14:19:29,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-27 14:19:29,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 14:19:29,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-27 14:19:29,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:19:29,182 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 14:19:29,182 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 14:19:29,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217870874] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:19:29,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 14:19:29,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2023-08-27 14:19:29,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929128631] [2023-08-27 14:19:29,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:19:29,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 14:19:29,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:19:29,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 14:19:29,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-27 14:19:29,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 478 [2023-08-27 14:19:29,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:29,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:19:29,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 478 [2023-08-27 14:19:29,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:19:32,678 INFO L124 PetriNetUnfolderBase]: 16724/21525 cut-off events. [2023-08-27 14:19:32,678 INFO L125 PetriNetUnfolderBase]: For 526/779 co-relation queries the response was YES. [2023-08-27 14:19:32,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44633 conditions, 21525 events. 16724/21525 cut-off events. For 526/779 co-relation queries the response was YES. Maximal size of possible extension queue 3080. Compared 123167 event pairs, 9916 based on Foata normal form. 254/5439 useless extension candidates. Maximal degree in co-relation 44577. Up to 21317 conditions per place. [2023-08-27 14:19:32,769 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 59 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2023-08-27 14:19:32,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 67 transitions, 373 flow [2023-08-27 14:19:32,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:19:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:19:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2023-08-27 14:19:32,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39191073919107394 [2023-08-27 14:19:32,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2023-08-27 14:19:32,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2023-08-27 14:19:32,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:19:32,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2023-08-27 14:19:32,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:32,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 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 14:19:32,776 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 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 14:19:32,776 INFO L175 Difference]: Start difference. First operand has 65 places, 68 transitions, 255 flow. Second operand 3 states and 562 transitions. [2023-08-27 14:19:32,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 67 transitions, 373 flow [2023-08-27 14:19:32,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 67 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 14:19:32,778 INFO L231 Difference]: Finished difference. Result has 63 places, 67 transitions, 241 flow [2023-08-27 14:19:32,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=63, PETRI_TRANSITIONS=67} [2023-08-27 14:19:32,779 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -14 predicate places. [2023-08-27 14:19:32,779 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 67 transitions, 241 flow [2023-08-27 14:19:32,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:32,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:19:32,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:19:32,789 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 14:19:32,986 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,SelfDestructingSolverStorable5 [2023-08-27 14:19:32,986 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:19:32,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:19:32,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1198726420, now seen corresponding path program 1 times [2023-08-27 14:19:32,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:19:32,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809315878] [2023-08-27 14:19:32,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:32,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:19:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 14:19:33,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:19:33,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809315878] [2023-08-27 14:19:33,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809315878] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:19:33,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:19:33,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 14:19:33,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073776013] [2023-08-27 14:19:33,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:19:33,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 14:19:33,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:19:33,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 14:19:33,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 14:19:33,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 478 [2023-08-27 14:19:33,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 67 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:33,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:19:33,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 478 [2023-08-27 14:19:33,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:19:36,901 INFO L124 PetriNetUnfolderBase]: 17977/22778 cut-off events. [2023-08-27 14:19:36,901 INFO L125 PetriNetUnfolderBase]: For 282/535 co-relation queries the response was YES. [2023-08-27 14:19:36,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47303 conditions, 22778 events. 17977/22778 cut-off events. For 282/535 co-relation queries the response was YES. Maximal size of possible extension queue 3030. Compared 125955 event pairs, 3741 based on Foata normal form. 253/5737 useless extension candidates. Maximal degree in co-relation 47251. Up to 14751 conditions per place. [2023-08-27 14:19:37,031 INFO L140 encePairwiseOnDemand]: 474/478 looper letters, 97 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2023-08-27 14:19:37,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 514 flow [2023-08-27 14:19:37,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:19:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:19:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2023-08-27 14:19:37,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435146443514644 [2023-08-27 14:19:37,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 636 transitions. [2023-08-27 14:19:37,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 636 transitions. [2023-08-27 14:19:37,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:19:37,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 636 transitions. [2023-08-27 14:19:37,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:37,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 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 14:19:37,038 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 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 14:19:37,038 INFO L175 Difference]: Start difference. First operand has 63 places, 67 transitions, 241 flow. Second operand 3 states and 636 transitions. [2023-08-27 14:19:37,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 514 flow [2023-08-27 14:19:37,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 102 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 14:19:37,041 INFO L231 Difference]: Finished difference. Result has 64 places, 67 transitions, 241 flow [2023-08-27 14:19:37,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=64, PETRI_TRANSITIONS=67} [2023-08-27 14:19:37,042 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -13 predicate places. [2023-08-27 14:19:37,042 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 67 transitions, 241 flow [2023-08-27 14:19:37,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:19:37,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:19:37,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:19:37,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 14:19:37,043 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:19:37,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:19:37,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1198726413, now seen corresponding path program 1 times [2023-08-27 14:19:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:19:37,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839141135] [2023-08-27 14:19:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:37,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:19:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:19:37,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:19:37,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839141135] [2023-08-27 14:19:37,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839141135] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:19:37,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391713474] [2023-08-27 14:19:37,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:37,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:19:37,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:19:37,569 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 14:19:37,574 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 14:19:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:37,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-27 14:19:37,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:19:37,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:19:37,973 INFO L322 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2023-08-27 14:19:37,974 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 14:19:38,015 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 14:19:38,048 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 14:19:38,049 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 14:19:38,075 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 14:19:38,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:19:38,097 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 14:19:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:19:38,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:19:40,529 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:19:40,529 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 215 treesize of output 132 [2023-08-27 14:19:40,588 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:19:40,589 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 2015 treesize of output 1894 [2023-08-27 14:19:40,658 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:19:40,659 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 789 treesize of output 778 [2023-08-27 14:19:40,701 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:19:40,702 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 769 treesize of output 738 [2023-08-27 14:19:40,745 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:19:40,746 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 729 treesize of output 698 [2023-08-27 14:19:40,789 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:19:40,790 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 689 treesize of output 678 [2023-08-27 14:22:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:22:13,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391713474] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:22:13,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:22:13,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-08-27 14:22:13,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628094307] [2023-08-27 14:22:13,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:22:13,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 14:22:13,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:22:13,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 14:22:13,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=232, Unknown=12, NotChecked=0, Total=306 [2023-08-27 14:22:13,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 478 [2023-08-27 14:22:13,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 67 transitions, 241 flow. Second operand has 18 states, 18 states have (on average 137.16666666666666) internal successors, (2469), 18 states have internal predecessors, (2469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:22:13,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:22:13,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 478 [2023-08-27 14:22:13,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:22:15,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:17,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:19,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:21,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:23,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:26,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:28,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:30,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:32,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:34,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:36,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:38,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:40,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:42,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:44,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:46,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:48,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:50,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:52,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:54,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:56,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:58,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:23:02,340 INFO L124 PetriNetUnfolderBase]: 18977/24572 cut-off events. [2023-08-27 14:23:02,341 INFO L125 PetriNetUnfolderBase]: For 1796/1796 co-relation queries the response was YES. [2023-08-27 14:23:02,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52015 conditions, 24572 events. 18977/24572 cut-off events. For 1796/1796 co-relation queries the response was YES. Maximal size of possible extension queue 3450. Compared 144942 event pairs, 6579 based on Foata normal form. 0/6774 useless extension candidates. Maximal degree in co-relation 51960. Up to 21721 conditions per place. [2023-08-27 14:23:02,450 INFO L140 encePairwiseOnDemand]: 468/478 looper letters, 92 selfloop transitions, 15 changer transitions 0/109 dead transitions. [2023-08-27 14:23:02,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 109 transitions, 562 flow [2023-08-27 14:23:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 14:23:02,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 14:23:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1181 transitions. [2023-08-27 14:23:02,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3088389121338912 [2023-08-27 14:23:02,453 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1181 transitions. [2023-08-27 14:23:02,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1181 transitions. [2023-08-27 14:23:02,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:23:02,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1181 transitions. [2023-08-27 14:23:02,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 147.625) internal successors, (1181), 8 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:02,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 478.0) internal successors, (4302), 9 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:02,461 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 478.0) internal successors, (4302), 9 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:02,461 INFO L175 Difference]: Start difference. First operand has 64 places, 67 transitions, 241 flow. Second operand 8 states and 1181 transitions. [2023-08-27 14:23:02,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 109 transitions, 562 flow [2023-08-27 14:23:02,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 109 transitions, 556 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 14:23:02,464 INFO L231 Difference]: Finished difference. Result has 72 places, 75 transitions, 317 flow [2023-08-27 14:23:02,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=317, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2023-08-27 14:23:02,464 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -5 predicate places. [2023-08-27 14:23:02,464 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 317 flow [2023-08-27 14:23:02,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 137.16666666666666) internal successors, (2469), 18 states have internal predecessors, (2469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:02,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:23:02,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:23:02,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-27 14:23:02,666 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 14:23:02,666 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:23:02,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:23:02,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1198726410, now seen corresponding path program 1 times [2023-08-27 14:23:02,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:23:02,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208004102] [2023-08-27 14:23:02,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:23:02,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:23:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:23:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:23:02,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:23:02,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208004102] [2023-08-27 14:23:02,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208004102] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:23:02,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057347247] [2023-08-27 14:23:02,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:23:02,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:23:02,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:23:02,893 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 14:23:02,899 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 14:23:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:23:03,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 14:23:03,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:23:03,334 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 14:23:03,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:23:03,363 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 14:23:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:23:03,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:23:03,405 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_275 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2023-08-27 14:23:03,415 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:23:03,416 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 24 treesize of output 25 [2023-08-27 14:23:03,422 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:23:03,422 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 39 treesize of output 35 [2023-08-27 14:23:03,426 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 7 treesize of output 5 [2023-08-27 14:23:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-08-27 14:23:03,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057347247] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:23:03,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:23:03,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-08-27 14:23:03,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124704245] [2023-08-27 14:23:03,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:23:03,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-27 14:23:03,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:23:03,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-27 14:23:03,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=125, Unknown=1, NotChecked=22, Total=182 [2023-08-27 14:23:03,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 478 [2023-08-27 14:23:03,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 317 flow. Second operand has 14 states, 14 states have (on average 141.35714285714286) internal successors, (1979), 14 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:03,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:23:03,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 478 [2023-08-27 14:23:03,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:23:08,868 INFO L124 PetriNetUnfolderBase]: 25715/33417 cut-off events. [2023-08-27 14:23:08,868 INFO L125 PetriNetUnfolderBase]: For 4297/4297 co-relation queries the response was YES. [2023-08-27 14:23:08,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71692 conditions, 33417 events. 25715/33417 cut-off events. For 4297/4297 co-relation queries the response was YES. Maximal size of possible extension queue 4994. Compared 209764 event pairs, 6597 based on Foata normal form. 0/9362 useless extension candidates. Maximal degree in co-relation 71632. Up to 20126 conditions per place. [2023-08-27 14:23:09,033 INFO L140 encePairwiseOnDemand]: 460/478 looper letters, 74 selfloop transitions, 34 changer transitions 0/110 dead transitions. [2023-08-27 14:23:09,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 110 transitions, 624 flow [2023-08-27 14:23:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 14:23:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 14:23:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1353 transitions. [2023-08-27 14:23:09,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31450488145048816 [2023-08-27 14:23:09,038 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1353 transitions. [2023-08-27 14:23:09,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1353 transitions. [2023-08-27 14:23:09,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:23:09,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1353 transitions. [2023-08-27 14:23:09,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 150.33333333333334) internal successors, (1353), 9 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 14:23:09,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 478.0) internal successors, (4780), 10 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:09,047 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 478.0) internal successors, (4780), 10 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:09,047 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 317 flow. Second operand 9 states and 1353 transitions. [2023-08-27 14:23:09,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 110 transitions, 624 flow [2023-08-27 14:23:09,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 110 transitions, 622 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-27 14:23:09,051 INFO L231 Difference]: Finished difference. Result has 82 places, 84 transitions, 435 flow [2023-08-27 14:23:09,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=435, PETRI_PLACES=82, PETRI_TRANSITIONS=84} [2023-08-27 14:23:09,052 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2023-08-27 14:23:09,052 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 84 transitions, 435 flow [2023-08-27 14:23:09,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 141.35714285714286) internal successors, (1979), 14 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:09,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:23:09,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:23:09,061 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 14:23:09,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:23:09,260 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:23:09,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:23:09,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1198726411, now seen corresponding path program 1 times [2023-08-27 14:23:09,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:23:09,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535570068] [2023-08-27 14:23:09,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:23:09,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:23:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:23:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:23:09,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:23:09,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535570068] [2023-08-27 14:23:09,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535570068] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:23:09,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704027706] [2023-08-27 14:23:09,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:23:09,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:23:09,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:23:09,529 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 14:23:09,532 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 14:23:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:23:09,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 14:23:09,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:23:09,964 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 14:23:09,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:23:09,984 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 14:23:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:23:09,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:23:10,043 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:23:10,043 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 22 treesize of output 23 [2023-08-27 14:23:10,050 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:23:10,050 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 33 treesize of output 29 [2023-08-27 14:23:10,055 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 5 treesize of output 3 [2023-08-27 14:23:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:23:10,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704027706] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:23:10,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:23:10,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-08-27 14:23:10,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525285747] [2023-08-27 14:23:10,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:23:10,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-27 14:23:10,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:23:10,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-27 14:23:10,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=144, Unknown=2, NotChecked=0, Total=182 [2023-08-27 14:23:10,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 478 [2023-08-27 14:23:10,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 84 transitions, 435 flow. Second operand has 14 states, 14 states have (on average 141.35714285714286) internal successors, (1979), 14 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:10,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:23:10,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 478 [2023-08-27 14:23:10,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:23:15,818 INFO L124 PetriNetUnfolderBase]: 27022/35229 cut-off events. [2023-08-27 14:23:15,819 INFO L125 PetriNetUnfolderBase]: For 15287/15287 co-relation queries the response was YES. [2023-08-27 14:23:15,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78788 conditions, 35229 events. 27022/35229 cut-off events. For 15287/15287 co-relation queries the response was YES. Maximal size of possible extension queue 5374. Compared 224704 event pairs, 7467 based on Foata normal form. 1/10547 useless extension candidates. Maximal degree in co-relation 78721. Up to 21918 conditions per place. [2023-08-27 14:23:15,964 INFO L140 encePairwiseOnDemand]: 460/478 looper letters, 74 selfloop transitions, 37 changer transitions 0/113 dead transitions. [2023-08-27 14:23:15,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 113 transitions, 740 flow [2023-08-27 14:23:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 14:23:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 14:23:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1352 transitions. [2023-08-27 14:23:15,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31427243142724315 [2023-08-27 14:23:15,968 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1352 transitions. [2023-08-27 14:23:15,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1352 transitions. [2023-08-27 14:23:15,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:23:15,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1352 transitions. [2023-08-27 14:23:15,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 150.22222222222223) internal successors, (1352), 9 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:15,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 478.0) internal successors, (4780), 10 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:15,977 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 478.0) internal successors, (4780), 10 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:15,977 INFO L175 Difference]: Start difference. First operand has 82 places, 84 transitions, 435 flow. Second operand 9 states and 1352 transitions. [2023-08-27 14:23:15,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 113 transitions, 740 flow [2023-08-27 14:23:15,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 113 transitions, 713 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-27 14:23:15,995 INFO L231 Difference]: Finished difference. Result has 87 places, 88 transitions, 523 flow [2023-08-27 14:23:15,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=523, PETRI_PLACES=87, PETRI_TRANSITIONS=88} [2023-08-27 14:23:15,996 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 10 predicate places. [2023-08-27 14:23:15,996 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 88 transitions, 523 flow [2023-08-27 14:23:15,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 141.35714285714286) internal successors, (1979), 14 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:15,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:23:15,997 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2023-08-27 14:23:16,005 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 14:23:16,204 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,SelfDestructingSolverStorable9 [2023-08-27 14:23:16,205 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:23:16,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:23:16,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1198872948, now seen corresponding path program 1 times [2023-08-27 14:23:16,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:23:16,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061662572] [2023-08-27 14:23:16,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:23:16,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:23:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:23:16,341 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 14:23:16,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:23:16,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061662572] [2023-08-27 14:23:16,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061662572] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:23:16,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149283808] [2023-08-27 14:23:16,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:23:16,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:23:16,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:23:16,345 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 14:23:16,374 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 14:23:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:23:16,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-27 14:23:16,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:23:16,799 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 14:23:16,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:23:16,840 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 14:23:16,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149283808] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:23:16,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:23:16,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2023-08-27 14:23:16,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176247572] [2023-08-27 14:23:16,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:23:16,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-27 14:23:16,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:23:16,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-27 14:23:16,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-08-27 14:23:16,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 478 [2023-08-27 14:23:16,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 88 transitions, 523 flow. Second operand has 15 states, 15 states have (on average 153.26666666666668) internal successors, (2299), 15 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:16,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:23:16,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 478 [2023-08-27 14:23:16,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:23:28,326 INFO L124 PetriNetUnfolderBase]: 49953/66094 cut-off events. [2023-08-27 14:23:28,327 INFO L125 PetriNetUnfolderBase]: For 58091/58597 co-relation queries the response was YES. [2023-08-27 14:23:28,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152960 conditions, 66094 events. 49953/66094 cut-off events. For 58091/58597 co-relation queries the response was YES. Maximal size of possible extension queue 8770. Compared 458677 event pairs, 26334 based on Foata normal form. 507/20728 useless extension candidates. Maximal degree in co-relation 152891. Up to 32988 conditions per place. [2023-08-27 14:23:28,658 INFO L140 encePairwiseOnDemand]: 472/478 looper letters, 137 selfloop transitions, 13 changer transitions 0/154 dead transitions. [2023-08-27 14:23:28,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 154 transitions, 1175 flow [2023-08-27 14:23:28,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 14:23:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 14:23:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1315 transitions. [2023-08-27 14:23:28,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3438807531380753 [2023-08-27 14:23:28,662 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1315 transitions. [2023-08-27 14:23:28,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1315 transitions. [2023-08-27 14:23:28,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:23:28,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1315 transitions. [2023-08-27 14:23:28,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 164.375) internal successors, (1315), 8 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:28,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 478.0) internal successors, (4302), 9 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:28,670 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 478.0) internal successors, (4302), 9 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:28,670 INFO L175 Difference]: Start difference. First operand has 87 places, 88 transitions, 523 flow. Second operand 8 states and 1315 transitions. [2023-08-27 14:23:28,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 154 transitions, 1175 flow [2023-08-27 14:23:28,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 154 transitions, 1128 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-27 14:23:28,750 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 532 flow [2023-08-27 14:23:28,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=532, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2023-08-27 14:23:28,751 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 12 predicate places. [2023-08-27 14:23:28,751 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 532 flow [2023-08-27 14:23:28,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 153.26666666666668) internal successors, (2299), 15 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:23:28,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:23:28,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:23:28,761 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 14:23:28,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:23:28,961 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:23:28,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:23:28,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1198726414, now seen corresponding path program 1 times [2023-08-27 14:23:28,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:23:28,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141912912] [2023-08-27 14:23:28,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:23:28,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:23:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:23:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:23:29,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:23:29,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141912912] [2023-08-27 14:23:29,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141912912] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:23:29,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835430169] [2023-08-27 14:23:29,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:23:29,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:23:29,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:23:29,309 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 14:23:29,312 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 14:23:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:23:29,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-27 14:23:29,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:23:29,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:23:29,678 INFO L322 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2023-08-27 14:23:29,678 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 14:23:29,707 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 14:23:29,731 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 14:23:29,731 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 14:23:29,749 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 14:23:29,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:23:29,768 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 14:23:29,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:23:29,780 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:23:31,895 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((~B~0.offset Int) (v_ArrVal_430 (Array Int Int)) (~B~0.base Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_430))) (let ((.cse1 (select (select .cse0 ~B~0.base) ~B~0.offset))) (or (<= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) .cse1) 2147483647) (<= 0 .cse1) (< (+ 9223372039002259455 .cse1) 0))))) (forall ((~B~0.offset Int) (v_ArrVal_430 (Array Int Int)) (~B~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_430))) (let ((.cse3 (select (select .cse2 ~B~0.base) ~B~0.offset))) (or (<= (+ (select (select .cse2 c_~A~0.base) c_~A~0.offset) .cse3) 2147483647) (< 0 .cse3) (< .cse3 0)))))) is different from false [2023-08-27 14:23:31,919 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_429 (Array Int Int)) (~B~0.offset Int) (v_ArrVal_430 (Array Int Int)) (~B~0.base Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_430))) (let ((.cse1 (select (select .cse0 ~B~0.base) ~B~0.offset))) (or (<= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) .cse1) 2147483647) (< 0 .cse1) (< .cse1 0))))) (forall ((v_ArrVal_429 (Array Int Int)) (~B~0.offset Int) (v_ArrVal_430 (Array Int Int)) (~B~0.base Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_430))) (let ((.cse2 (select (select .cse3 ~B~0.base) ~B~0.offset))) (or (<= 0 .cse2) (<= (+ (select (select .cse3 c_~A~0.base) c_~A~0.offset) .cse2) 2147483647) (< (+ 9223372039002259455 .cse2) 0)))))) is different from false [2023-08-27 14:23:32,031 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:23:32,032 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 215 treesize of output 132 [2023-08-27 14:23:32,087 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:23:32,088 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 1949 treesize of output 1828 [2023-08-27 14:23:32,139 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:23:32,139 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 765 treesize of output 754 [2023-08-27 14:23:32,178 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:23:32,179 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 745 treesize of output 714 [2023-08-27 14:23:32,218 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:23:32,219 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 705 treesize of output 674 [2023-08-27 14:23:32,258 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:23:32,259 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 665 treesize of output 654 [2023-08-27 14:25:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 14:25:40,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835430169] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:25:40,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:25:40,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-08-27 14:25:40,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817100801] [2023-08-27 14:25:40,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:25:40,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 14:25:40,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:25:40,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 14:25:40,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=189, Unknown=3, NotChecked=58, Total=306 [2023-08-27 14:25:40,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 478 [2023-08-27 14:25:40,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 532 flow. Second operand has 18 states, 18 states have (on average 137.16666666666666) internal successors, (2469), 18 states have internal predecessors, (2469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:25:40,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:25:40,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 478 [2023-08-27 14:25:40,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:25:43,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:25:45,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:25:47,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:25:49,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:25:51,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:25:53,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:25:55,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:25:57,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:25:59,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:01,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:03,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:05,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:08,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:10,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:12,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:14,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:16,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:18,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:20,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:22,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:24,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:26,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:28,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:30,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:32,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:26:42,130 INFO L124 PetriNetUnfolderBase]: 51933/68312 cut-off events. [2023-08-27 14:26:42,130 INFO L125 PetriNetUnfolderBase]: For 55181/55181 co-relation queries the response was YES. [2023-08-27 14:26:42,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157426 conditions, 68312 events. 51933/68312 cut-off events. For 55181/55181 co-relation queries the response was YES. Maximal size of possible extension queue 8727. Compared 467818 event pairs, 23926 based on Foata normal form. 2/21000 useless extension candidates. Maximal degree in co-relation 157357. Up to 62449 conditions per place. [2023-08-27 14:26:42,484 INFO L140 encePairwiseOnDemand]: 468/478 looper letters, 95 selfloop transitions, 19 changer transitions 0/116 dead transitions. [2023-08-27 14:26:42,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 116 transitions, 830 flow [2023-08-27 14:26:42,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 14:26:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 14:26:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1178 transitions. [2023-08-27 14:26:42,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3080543933054393 [2023-08-27 14:26:42,487 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1178 transitions. [2023-08-27 14:26:42,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1178 transitions. [2023-08-27 14:26:42,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:26:42,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1178 transitions. [2023-08-27 14:26:42,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 147.25) internal successors, (1178), 8 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:26:42,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 478.0) internal successors, (4302), 9 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:26:42,493 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 478.0) internal successors, (4302), 9 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:26:42,494 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 532 flow. Second operand 8 states and 1178 transitions. [2023-08-27 14:26:42,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 116 transitions, 830 flow [2023-08-27 14:26:42,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 116 transitions, 800 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-27 14:26:42,540 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 558 flow [2023-08-27 14:26:42,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=558, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2023-08-27 14:26:42,541 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 17 predicate places. [2023-08-27 14:26:42,541 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 558 flow [2023-08-27 14:26:42,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 137.16666666666666) internal successors, (2469), 18 states have internal predecessors, (2469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:26:42,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:26:42,541 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1] [2023-08-27 14:26:42,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-27 14:26:42,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:26:42,742 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:26:42,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:26:42,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1916700733, now seen corresponding path program 2 times [2023-08-27 14:26:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:26:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932833099] [2023-08-27 14:26:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:26:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:26:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:26:42,873 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 14:26:42,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:26:42,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932833099] [2023-08-27 14:26:42,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932833099] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:26:42,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285583168] [2023-08-27 14:26:42,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 14:26:42,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:26:42,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:26:42,877 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 14:26:42,881 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 14:26:43,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-27 14:26:43,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 14:26:43,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-27 14:26:43,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:26:43,277 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 14:26:43,278 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 14:26:43,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285583168] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:26:43,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 14:26:43,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2023-08-27 14:26:43,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474465590] [2023-08-27 14:26:43,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:26:43,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 14:26:43,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:26:43,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 14:26:43,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-27 14:26:43,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 478 [2023-08-27 14:26:43,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 558 flow. Second operand has 4 states, 4 states have (on average 163.25) internal successors, (653), 4 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:26:43,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:26:43,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 478 [2023-08-27 14:26:43,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:26:51,969 INFO L124 PetriNetUnfolderBase]: 43329/57361 cut-off events. [2023-08-27 14:26:51,970 INFO L125 PetriNetUnfolderBase]: For 61008/61008 co-relation queries the response was YES. [2023-08-27 14:26:52,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132472 conditions, 57361 events. 43329/57361 cut-off events. For 61008/61008 co-relation queries the response was YES. Maximal size of possible extension queue 7274. Compared 391005 event pairs, 22544 based on Foata normal form. 1/18094 useless extension candidates. Maximal degree in co-relation 132409. Up to 56773 conditions per place. [2023-08-27 14:26:52,278 INFO L140 encePairwiseOnDemand]: 474/478 looper letters, 82 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2023-08-27 14:26:52,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 87 transitions, 694 flow [2023-08-27 14:26:52,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:26:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:26:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2023-08-27 14:26:52,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3723849372384937 [2023-08-27 14:26:52,280 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2023-08-27 14:26:52,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2023-08-27 14:26:52,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:26:52,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2023-08-27 14:26:52,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:26:52,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 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 14:26:52,283 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 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 14:26:52,283 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 558 flow. Second operand 3 states and 534 transitions. [2023-08-27 14:26:52,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 87 transitions, 694 flow [2023-08-27 14:26:52,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 87 transitions, 645 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-27 14:26:52,503 INFO L231 Difference]: Finished difference. Result has 85 places, 87 transitions, 481 flow [2023-08-27 14:26:52,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=481, PETRI_PLACES=85, PETRI_TRANSITIONS=87} [2023-08-27 14:26:52,504 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 8 predicate places. [2023-08-27 14:26:52,505 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 87 transitions, 481 flow [2023-08-27 14:26:52,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.25) internal successors, (653), 4 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:26:52,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:26:52,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:26:52,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-27 14:26:52,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-27 14:26:52,712 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:26:52,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:26:52,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1494179384, now seen corresponding path program 1 times [2023-08-27 14:26:52,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:26:52,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539093196] [2023-08-27 14:26:52,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:26:52,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:26:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:26:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-27 14:26:52,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:26:52,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539093196] [2023-08-27 14:26:52,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539093196] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:26:52,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:26:52,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 14:26:52,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643580674] [2023-08-27 14:26:52,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:26:52,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 14:26:52,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:26:52,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 14:26:52,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 14:26:52,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 478 [2023-08-27 14:26:52,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 87 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:26:52,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:26:52,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 478 [2023-08-27 14:26:52,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:27:00,704 INFO L124 PetriNetUnfolderBase]: 40255/53313 cut-off events. [2023-08-27 14:27:00,704 INFO L125 PetriNetUnfolderBase]: For 55998/55998 co-relation queries the response was YES. [2023-08-27 14:27:00,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123436 conditions, 53313 events. 40255/53313 cut-off events. For 55998/55998 co-relation queries the response was YES. Maximal size of possible extension queue 5200. Compared 357020 event pairs, 20426 based on Foata normal form. 464/17649 useless extension candidates. Maximal degree in co-relation 123418. Up to 42394 conditions per place. [2023-08-27 14:27:00,988 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 102 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2023-08-27 14:27:00,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 109 transitions, 738 flow [2023-08-27 14:27:00,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:27:00,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:27:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2023-08-27 14:27:00,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42329149232914925 [2023-08-27 14:27:00,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 607 transitions. [2023-08-27 14:27:00,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 607 transitions. [2023-08-27 14:27:00,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:27:00,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 607 transitions. [2023-08-27 14:27:00,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:27:00,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 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 14:27:00,992 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 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 14:27:00,992 INFO L175 Difference]: Start difference. First operand has 85 places, 87 transitions, 481 flow. Second operand 3 states and 607 transitions. [2023-08-27 14:27:00,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 109 transitions, 738 flow [2023-08-27 14:27:01,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 109 transitions, 737 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 14:27:01,036 INFO L231 Difference]: Finished difference. Result has 85 places, 85 transitions, 472 flow [2023-08-27 14:27:01,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=85, PETRI_TRANSITIONS=85} [2023-08-27 14:27:01,037 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 8 predicate places. [2023-08-27 14:27:01,037 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 85 transitions, 472 flow [2023-08-27 14:27:01,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:27:01,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:27:01,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:27:01,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 14:27:01,037 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:27:01,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:27:01,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1494179523, now seen corresponding path program 1 times [2023-08-27 14:27:01,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:27:01,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130579839] [2023-08-27 14:27:01,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:27:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:27:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:27:01,170 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 14:27:01,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:27:01,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130579839] [2023-08-27 14:27:01,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130579839] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:27:01,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196045230] [2023-08-27 14:27:01,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:27:01,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:27:01,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:27:01,172 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 14:27:01,174 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 14:27:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:27:01,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-27 14:27:01,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:27:01,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:27:01,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:27:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:27:01,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196045230] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:27:01,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:27:01,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-08-27 14:27:01,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143289487] [2023-08-27 14:27:01,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:27:01,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-27 14:27:01,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:27:01,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-27 14:27:01,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-08-27 14:27:01,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 478 [2023-08-27 14:27:01,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 85 transitions, 472 flow. Second operand has 14 states, 14 states have (on average 149.42857142857142) internal successors, (2092), 14 states have internal predecessors, (2092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:27:01,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:27:01,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 478 [2023-08-27 14:27:01,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:27:08,133 INFO L124 PetriNetUnfolderBase]: 32313/42449 cut-off events. [2023-08-27 14:27:08,133 INFO L125 PetriNetUnfolderBase]: For 47867/47867 co-relation queries the response was YES. [2023-08-27 14:27:08,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99294 conditions, 42449 events. 32313/42449 cut-off events. For 47867/47867 co-relation queries the response was YES. Maximal size of possible extension queue 4376. Compared 264899 event pairs, 15384 based on Foata normal form. 1464/15871 useless extension candidates. Maximal degree in co-relation 99276. Up to 26402 conditions per place. [2023-08-27 14:27:08,323 INFO L140 encePairwiseOnDemand]: 464/478 looper letters, 158 selfloop transitions, 19 changer transitions 0/179 dead transitions. [2023-08-27 14:27:08,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 179 transitions, 1155 flow [2023-08-27 14:27:08,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 14:27:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 14:27:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1479 transitions. [2023-08-27 14:27:08,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3437935843793584 [2023-08-27 14:27:08,326 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1479 transitions. [2023-08-27 14:27:08,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1479 transitions. [2023-08-27 14:27:08,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:27:08,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1479 transitions. [2023-08-27 14:27:08,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 164.33333333333334) internal successors, (1479), 9 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:27:08,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 478.0) internal successors, (4780), 10 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:27:08,332 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 478.0) internal successors, (4780), 10 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:27:08,333 INFO L175 Difference]: Start difference. First operand has 85 places, 85 transitions, 472 flow. Second operand 9 states and 1479 transitions. [2023-08-27 14:27:08,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 179 transitions, 1155 flow [2023-08-27 14:27:08,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 179 transitions, 1135 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 14:27:08,386 INFO L231 Difference]: Finished difference. Result has 94 places, 92 transitions, 611 flow [2023-08-27 14:27:08,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=611, PETRI_PLACES=94, PETRI_TRANSITIONS=92} [2023-08-27 14:27:08,386 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 17 predicate places. [2023-08-27 14:27:08,386 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 92 transitions, 611 flow [2023-08-27 14:27:08,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 149.42857142857142) internal successors, (2092), 14 states have internal predecessors, (2092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:27:08,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:27:08,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:27:08,392 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 14:27:08,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-27 14:27:08,587 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:27:08,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:27:08,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1493914159, now seen corresponding path program 1 times [2023-08-27 14:27:08,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:27:08,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919812395] [2023-08-27 14:27:08,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:27:08,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:27:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:27:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:27:08,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:27:08,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919812395] [2023-08-27 14:27:08,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919812395] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:27:08,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139362901] [2023-08-27 14:27:08,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:27:08,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:27:08,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:27:08,961 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 14:27:08,987 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 14:27:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:27:09,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-27 14:27:09,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:27:09,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:27:09,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:27:09,419 INFO L322 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2023-08-27 14:27:09,422 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 14:27:09,460 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 14:27:09,498 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 14:27:09,499 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 14:27:09,527 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 14:27:09,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:27:09,557 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 14:27:09,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:27:09,583 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 14:27:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:27:09,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:27:11,758 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_612) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_613))) (let ((.cse0 (select (select .cse1 ~B~0.base) ~B~0.offset))) (or (< (+ 9223372039002259455 .cse0) 0) (<= 0 .cse0) (<= (+ (select (select .cse1 c_~A~0.base) c_~A~0.offset) .cse0) 2147483647))))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_612) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_613))) (let ((.cse3 (select (select .cse2 ~B~0.base) ~B~0.offset))) (or (<= (+ (select (select .cse2 c_~A~0.base) c_~A~0.offset) .cse3) 2147483647) (< 0 .cse3) (< .cse3 0)))))) is different from false [2023-08-27 14:27:11,900 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:27:11,900 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 239 treesize of output 156 [2023-08-27 14:27:11,950 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:27:11,951 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 2961 treesize of output 2880 [2023-08-27 14:27:12,000 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:27:12,001 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 2805 treesize of output 2670 [2023-08-27 14:27:12,052 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:27:12,053 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 2661 treesize of output 2634 [2023-08-27 14:27:12,114 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:27:12,114 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 2625 treesize of output 2562 [2023-08-27 14:27:12,193 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:27:12,193 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 2553 treesize of output 2418 [2023-08-27 14:27:12,271 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:27:12,272 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 2409 treesize of output 2346 [2023-08-27 14:27:12,341 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:27:12,341 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 2337 treesize of output 2310 [2023-08-27 14:27:23,106 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-27 14:27:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 14:27:23,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139362901] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:27:23,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:27:23,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-27 14:27:23,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862146564] [2023-08-27 14:27:23,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:27:23,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-27 14:27:23,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:27:23,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-27 14:27:23,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=290, Unknown=13, NotChecked=36, Total=420 [2023-08-27 14:27:23,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 478 [2023-08-27 14:27:23,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 92 transitions, 611 flow. Second operand has 21 states, 21 states have (on average 136.1904761904762) internal successors, (2860), 21 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:27:23,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:27:23,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 478 [2023-08-27 14:27:23,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:27:25,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:27,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:29,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:31,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:33,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:35,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:37,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:39,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:41,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:43,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:45,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:47,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:49,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:51,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:53,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:55,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:57,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:27:59,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:01,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:03,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:05,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:11,829 INFO L124 PetriNetUnfolderBase]: 32220/41870 cut-off events. [2023-08-27 14:28:11,829 INFO L125 PetriNetUnfolderBase]: For 53950/53950 co-relation queries the response was YES. [2023-08-27 14:28:11,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102985 conditions, 41870 events. 32220/41870 cut-off events. For 53950/53950 co-relation queries the response was YES. Maximal size of possible extension queue 3887. Compared 258960 event pairs, 6894 based on Foata normal form. 24/13577 useless extension candidates. Maximal degree in co-relation 102963. Up to 37389 conditions per place. [2023-08-27 14:28:12,038 INFO L140 encePairwiseOnDemand]: 468/478 looper letters, 133 selfloop transitions, 32 changer transitions 0/167 dead transitions. [2023-08-27 14:28:12,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 167 transitions, 1248 flow [2023-08-27 14:28:12,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 14:28:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 14:28:12,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1198 transitions. [2023-08-27 14:28:12,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3132845188284519 [2023-08-27 14:28:12,041 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1198 transitions. [2023-08-27 14:28:12,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1198 transitions. [2023-08-27 14:28:12,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:28:12,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1198 transitions. [2023-08-27 14:28:12,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 149.75) internal successors, (1198), 8 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:28:12,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 478.0) internal successors, (4302), 9 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:28:12,046 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 478.0) internal successors, (4302), 9 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:28:12,046 INFO L175 Difference]: Start difference. First operand has 94 places, 92 transitions, 611 flow. Second operand 8 states and 1198 transitions. [2023-08-27 14:28:12,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 167 transitions, 1248 flow [2023-08-27 14:28:12,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 167 transitions, 1222 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-27 14:28:12,109 INFO L231 Difference]: Finished difference. Result has 98 places, 104 transitions, 821 flow [2023-08-27 14:28:12,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=821, PETRI_PLACES=98, PETRI_TRANSITIONS=104} [2023-08-27 14:28:12,109 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 21 predicate places. [2023-08-27 14:28:12,109 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 104 transitions, 821 flow [2023-08-27 14:28:12,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 136.1904761904762) internal successors, (2860), 21 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:28:12,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:28:12,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:28:12,119 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 14:28:12,317 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,SelfDestructingSolverStorable15 [2023-08-27 14:28:12,317 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:28:12,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:28:12,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1493914160, now seen corresponding path program 1 times [2023-08-27 14:28:12,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:28:12,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865047392] [2023-08-27 14:28:12,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:28:12,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:28:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:28:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:28:12,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:28:12,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865047392] [2023-08-27 14:28:12,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865047392] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:28:12,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004947103] [2023-08-27 14:28:12,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:28:12,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:28:12,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:28:12,644 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 14:28:12,646 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 14:28:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:28:12,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-27 14:28:12,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:28:13,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:28:13,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:28:13,029 INFO L322 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2023-08-27 14:28:13,029 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 14:28:13,053 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 14:28:13,085 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 14:28:13,086 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 14:28:13,106 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 14:28:13,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:28:13,131 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 14:28:13,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:28:13,152 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 14:28:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:28:13,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:28:15,248 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_670 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_670))) (let ((.cse0 (select (select .cse1 ~B~0.base) ~B~0.offset))) (or (<= .cse0 0) (<= 0 (+ (select (select .cse1 c_~A~0.base) c_~A~0.offset) 2147483648 .cse0)) (< 4294967295 .cse0))))) (forall ((v_ArrVal_670 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_670))) (let ((.cse2 (select (select .cse3 ~B~0.base) ~B~0.offset))) (or (< .cse2 0) (< 0 .cse2) (<= 0 (+ (select (select .cse3 c_~A~0.base) c_~A~0.offset) 2147483648 .cse2))))))) is different from false [2023-08-27 14:28:15,282 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_669) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_670))) (let ((.cse1 (select (select .cse0 ~B~0.base) ~B~0.offset))) (or (<= 0 (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) .cse1 2147483648)) (<= .cse1 0) (< 4294967295 .cse1))))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_669) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_670))) (let ((.cse2 (select (select .cse3 ~B~0.base) ~B~0.offset))) (or (< .cse2 0) (<= 0 (+ (select (select .cse3 c_~A~0.base) c_~A~0.offset) .cse2 2147483648)) (< 0 .cse2)))))) is different from false [2023-08-27 14:28:15,313 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_669) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_670))) (let ((.cse0 (select (select .cse1 ~B~0.base) ~B~0.offset))) (or (<= 0 (+ .cse0 (select (select .cse1 c_~A~0.base) c_~A~0.offset) 2147483648)) (< .cse0 0) (< 0 .cse0))))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_669) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_670))) (let ((.cse2 (select (select .cse3 ~B~0.base) ~B~0.offset))) (or (<= 0 (+ .cse2 (select (select .cse3 c_~A~0.base) c_~A~0.offset) 2147483648)) (<= .cse2 0) (< 4294967295 .cse2)))))) is different from false [2023-08-27 14:28:15,412 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:28:15,413 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 239 treesize of output 156 [2023-08-27 14:28:15,489 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:28:15,490 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 11923 treesize of output 11426 [2023-08-27 14:28:15,637 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:28:15,637 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 2917 treesize of output 2782 [2023-08-27 14:28:15,700 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:28:15,701 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 2773 treesize of output 2746 [2023-08-27 14:28:15,765 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:28:15,766 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 2737 treesize of output 2674 [2023-08-27 14:28:15,823 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:28:15,823 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 2665 treesize of output 2638 [2023-08-27 14:28:15,886 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:28:15,887 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 2629 treesize of output 2566 [2023-08-27 14:28:15,972 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:28:15,973 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 2557 treesize of output 2422 [2023-08-27 14:28:28,966 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-27 14:28:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 14:28:29,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004947103] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:28:29,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:28:29,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-27 14:28:29,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164207528] [2023-08-27 14:28:29,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:28:29,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-27 14:28:29,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:28:29,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-27 14:28:29,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=241, Unknown=4, NotChecked=102, Total=420 [2023-08-27 14:28:29,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 478 [2023-08-27 14:28:29,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 104 transitions, 821 flow. Second operand has 21 states, 21 states have (on average 136.1904761904762) internal successors, (2860), 21 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:28:29,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:28:29,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 478 [2023-08-27 14:28:29,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:28:31,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:33,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:35,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:37,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:39,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:41,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:43,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:45,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:47,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:49,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:51,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:53,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:55,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:57,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:28:59,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:29:01,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:29:03,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:29:06,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:29:08,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:29:10,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:29:12,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:29:14,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:29:16,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:29:18,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:29:20,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:29:26,191 INFO L124 PetriNetUnfolderBase]: 30838/40002 cut-off events. [2023-08-27 14:29:26,191 INFO L125 PetriNetUnfolderBase]: For 68043/68043 co-relation queries the response was YES. [2023-08-27 14:29:26,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102150 conditions, 40002 events. 30838/40002 cut-off events. For 68043/68043 co-relation queries the response was YES. Maximal size of possible extension queue 4244. Compared 247755 event pairs, 6703 based on Foata normal form. 24/13111 useless extension candidates. Maximal degree in co-relation 102126. Up to 35603 conditions per place. [2023-08-27 14:29:26,402 INFO L140 encePairwiseOnDemand]: 468/478 looper letters, 132 selfloop transitions, 31 changer transitions 0/165 dead transitions. [2023-08-27 14:29:26,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 165 transitions, 1311 flow [2023-08-27 14:29:26,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 14:29:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 14:29:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1197 transitions. [2023-08-27 14:29:26,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31302301255230125 [2023-08-27 14:29:26,405 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1197 transitions. [2023-08-27 14:29:26,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1197 transitions. [2023-08-27 14:29:26,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:29:26,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1197 transitions. [2023-08-27 14:29:26,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 149.625) internal successors, (1197), 8 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:26,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 478.0) internal successors, (4302), 9 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:26,410 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 478.0) internal successors, (4302), 9 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:26,410 INFO L175 Difference]: Start difference. First operand has 98 places, 104 transitions, 821 flow. Second operand 8 states and 1197 transitions. [2023-08-27 14:29:26,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 165 transitions, 1311 flow [2023-08-27 14:29:26,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 165 transitions, 1297 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-27 14:29:26,477 INFO L231 Difference]: Finished difference. Result has 102 places, 103 transitions, 854 flow [2023-08-27 14:29:26,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=854, PETRI_PLACES=102, PETRI_TRANSITIONS=103} [2023-08-27 14:29:26,477 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 25 predicate places. [2023-08-27 14:29:26,478 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 103 transitions, 854 flow [2023-08-27 14:29:26,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 136.1904761904762) internal successors, (2860), 21 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:26,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:29:26,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:29:26,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-27 14:29:26,685 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,SelfDestructingSolverStorable16 [2023-08-27 14:29:26,686 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:29:26,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:29:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1493914162, now seen corresponding path program 1 times [2023-08-27 14:29:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:29:26,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76979784] [2023-08-27 14:29:26,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:29:26,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:29:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:29:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:29:26,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:29:26,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76979784] [2023-08-27 14:29:26,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76979784] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:29:26,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017229186] [2023-08-27 14:29:26,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:29:26,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:29:26,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:29:26,943 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 14:29:26,944 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 14:29:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:29:27,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-27 14:29:27,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:29:27,358 INFO L322 Elim1Store]: treesize reduction 75, result has 31.2 percent of original size [2023-08-27 14:29:27,358 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 39 [2023-08-27 14:29:27,419 INFO L322 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-27 14:29:27,420 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 20 treesize of output 30 [2023-08-27 14:29:27,444 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 14:29:27,467 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 14:29:27,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:29:27,489 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 14:29:27,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:29:27,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:29:27,572 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:29:27,572 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 25 treesize of output 26 [2023-08-27 14:29:27,579 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:29:27,579 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 63 treesize of output 59 [2023-08-27 14:29:27,584 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 24 treesize of output 22 [2023-08-27 14:29:27,588 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 46 treesize of output 42 [2023-08-27 14:29:27,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:29:27,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017229186] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:29:27,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:29:27,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-08-27 14:29:27,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121496027] [2023-08-27 14:29:27,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:29:27,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 14:29:27,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:29:27,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 14:29:27,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=248, Unknown=6, NotChecked=0, Total=306 [2023-08-27 14:29:27,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 478 [2023-08-27 14:29:27,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 103 transitions, 854 flow. Second operand has 18 states, 18 states have (on average 135.38888888888889) internal successors, (2437), 18 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:27,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:29:27,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 478 [2023-08-27 14:29:27,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:29:33,967 INFO L124 PetriNetUnfolderBase]: 29600/38278 cut-off events. [2023-08-27 14:29:33,967 INFO L125 PetriNetUnfolderBase]: For 68157/68157 co-relation queries the response was YES. [2023-08-27 14:29:34,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99514 conditions, 38278 events. 29600/38278 cut-off events. For 68157/68157 co-relation queries the response was YES. Maximal size of possible extension queue 4074. Compared 233447 event pairs, 3949 based on Foata normal form. 24/12671 useless extension candidates. Maximal degree in co-relation 99490. Up to 24688 conditions per place. [2023-08-27 14:29:34,156 INFO L140 encePairwiseOnDemand]: 463/478 looper letters, 113 selfloop transitions, 49 changer transitions 0/164 dead transitions. [2023-08-27 14:29:34,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 164 transitions, 1349 flow [2023-08-27 14:29:34,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 14:29:34,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 14:29:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1323 transitions. [2023-08-27 14:29:34,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3075313807531381 [2023-08-27 14:29:34,160 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1323 transitions. [2023-08-27 14:29:34,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1323 transitions. [2023-08-27 14:29:34,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:29:34,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1323 transitions. [2023-08-27 14:29:34,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 147.0) internal successors, (1323), 9 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:34,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 478.0) internal successors, (4780), 10 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:34,165 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 478.0) internal successors, (4780), 10 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:34,165 INFO L175 Difference]: Start difference. First operand has 102 places, 103 transitions, 854 flow. Second operand 9 states and 1323 transitions. [2023-08-27 14:29:34,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 164 transitions, 1349 flow [2023-08-27 14:29:34,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 164 transitions, 1317 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-27 14:29:34,237 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 975 flow [2023-08-27 14:29:34,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=975, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2023-08-27 14:29:34,238 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 30 predicate places. [2023-08-27 14:29:34,238 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 975 flow [2023-08-27 14:29:34,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 135.38888888888889) internal successors, (2437), 18 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:34,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:29:34,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:29:34,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-27 14:29:34,439 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,SelfDestructingSolverStorable17 [2023-08-27 14:29:34,439 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:29:34,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:29:34,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1493914163, now seen corresponding path program 1 times [2023-08-27 14:29:34,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:29:34,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348388518] [2023-08-27 14:29:34,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:29:34,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:29:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:29:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:29:34,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:29:34,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348388518] [2023-08-27 14:29:34,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348388518] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:29:34,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821256783] [2023-08-27 14:29:34,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:29:34,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:29:34,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:29:34,709 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 14:29:34,736 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 14:29:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:29:35,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-27 14:29:35,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:29:35,147 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 14:29:35,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:29:35,172 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 14:29:35,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:29:35,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 16 treesize of output 18 [2023-08-27 14:29:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:29:35,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:29:35,284 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:29:35,285 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 27 treesize of output 28 [2023-08-27 14:29:35,292 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:29:35,292 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 73 treesize of output 69 [2023-08-27 14:29:35,296 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 56 treesize of output 52 [2023-08-27 14:29:35,300 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 26 treesize of output 24 [2023-08-27 14:29:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:29:35,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821256783] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:29:35,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:29:35,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-27 14:29:35,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575134320] [2023-08-27 14:29:35,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:29:35,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-27 14:29:35,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:29:35,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-27 14:29:35,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=219, Unknown=3, NotChecked=0, Total=272 [2023-08-27 14:29:35,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 478 [2023-08-27 14:29:35,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 975 flow. Second operand has 17 states, 17 states have (on average 139.35294117647058) internal successors, (2369), 17 states have internal predecessors, (2369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:35,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:29:35,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 478 [2023-08-27 14:29:35,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:29:41,163 INFO L124 PetriNetUnfolderBase]: 28362/36554 cut-off events. [2023-08-27 14:29:41,164 INFO L125 PetriNetUnfolderBase]: For 81005/81005 co-relation queries the response was YES. [2023-08-27 14:29:41,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99381 conditions, 36554 events. 28362/36554 cut-off events. For 81005/81005 co-relation queries the response was YES. Maximal size of possible extension queue 3376. Compared 216516 event pairs, 3771 based on Foata normal form. 24/12231 useless extension candidates. Maximal degree in co-relation 99356. Up to 23052 conditions per place. [2023-08-27 14:29:41,352 INFO L140 encePairwiseOnDemand]: 463/478 looper letters, 112 selfloop transitions, 50 changer transitions 0/164 dead transitions. [2023-08-27 14:29:41,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 164 transitions, 1440 flow [2023-08-27 14:29:41,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 14:29:41,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 14:29:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1358 transitions. [2023-08-27 14:29:41,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31566713156671317 [2023-08-27 14:29:41,354 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1358 transitions. [2023-08-27 14:29:41,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1358 transitions. [2023-08-27 14:29:41,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:29:41,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1358 transitions. [2023-08-27 14:29:41,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 150.88888888888889) internal successors, (1358), 9 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:41,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 478.0) internal successors, (4780), 10 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:41,359 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 478.0) internal successors, (4780), 10 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:41,359 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 975 flow. Second operand 9 states and 1358 transitions. [2023-08-27 14:29:41,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 164 transitions, 1440 flow [2023-08-27 14:29:41,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 164 transitions, 1370 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-27 14:29:41,411 INFO L231 Difference]: Finished difference. Result has 109 places, 108 transitions, 1019 flow [2023-08-27 14:29:41,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1019, PETRI_PLACES=109, PETRI_TRANSITIONS=108} [2023-08-27 14:29:41,411 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 32 predicate places. [2023-08-27 14:29:41,412 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 108 transitions, 1019 flow [2023-08-27 14:29:41,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 139.35294117647058) internal successors, (2369), 17 states have internal predecessors, (2369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:41,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:29:41,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:29:41,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-27 14:29:41,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:29:41,613 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:29:41,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:29:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash 933382652, now seen corresponding path program 1 times [2023-08-27 14:29:41,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:29:41,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272729260] [2023-08-27 14:29:41,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:29:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:29:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:29:41,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:29:41,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:29:41,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272729260] [2023-08-27 14:29:41,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272729260] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:29:41,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794759932] [2023-08-27 14:29:41,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:29:41,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:29:41,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:29:41,757 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 14:29:41,783 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 14:29:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:29:42,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-27 14:29:42,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:29:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:29:42,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:29:42,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:29:42,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794759932] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:29:42,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:29:42,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-27 14:29:42,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732468170] [2023-08-27 14:29:42,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:29:42,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-27 14:29:42,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:29:42,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-27 14:29:42,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-08-27 14:29:42,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 478 [2023-08-27 14:29:42,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 108 transitions, 1019 flow. Second operand has 15 states, 15 states have (on average 144.73333333333332) internal successors, (2171), 15 states have internal predecessors, (2171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:42,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:29:42,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 478 [2023-08-27 14:29:42,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:29:45,665 INFO L124 PetriNetUnfolderBase]: 13001/19321 cut-off events. [2023-08-27 14:29:45,665 INFO L125 PetriNetUnfolderBase]: For 70209/70209 co-relation queries the response was YES. [2023-08-27 14:29:45,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59636 conditions, 19321 events. 13001/19321 cut-off events. For 70209/70209 co-relation queries the response was YES. Maximal size of possible extension queue 1885. Compared 128666 event pairs, 10534 based on Foata normal form. 0/9480 useless extension candidates. Maximal degree in co-relation 59613. Up to 17195 conditions per place. [2023-08-27 14:29:45,766 INFO L140 encePairwiseOnDemand]: 462/478 looper letters, 143 selfloop transitions, 14 changer transitions 0/163 dead transitions. [2023-08-27 14:29:45,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 163 transitions, 1646 flow [2023-08-27 14:29:45,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 14:29:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 14:29:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1258 transitions. [2023-08-27 14:29:45,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32897489539748953 [2023-08-27 14:29:45,770 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1258 transitions. [2023-08-27 14:29:45,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1258 transitions. [2023-08-27 14:29:45,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:29:45,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1258 transitions. [2023-08-27 14:29:45,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 157.25) internal successors, (1258), 8 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:45,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 478.0) internal successors, (4302), 9 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:45,774 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 478.0) internal successors, (4302), 9 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:45,774 INFO L175 Difference]: Start difference. First operand has 109 places, 108 transitions, 1019 flow. Second operand 8 states and 1258 transitions. [2023-08-27 14:29:45,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 163 transitions, 1646 flow [2023-08-27 14:29:45,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 163 transitions, 1573 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-27 14:29:45,821 INFO L231 Difference]: Finished difference. Result has 113 places, 110 transitions, 1022 flow [2023-08-27 14:29:45,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1022, PETRI_PLACES=113, PETRI_TRANSITIONS=110} [2023-08-27 14:29:45,822 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 36 predicate places. [2023-08-27 14:29:45,822 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 110 transitions, 1022 flow [2023-08-27 14:29:45,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 144.73333333333332) internal successors, (2171), 15 states have internal predecessors, (2171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:29:45,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:29:45,822 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:29:45,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-27 14:29:46,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:29:46,025 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2023-08-27 14:29:46,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:29:46,025 INFO L85 PathProgramCache]: Analyzing trace with hash 587099272, now seen corresponding path program 1 times [2023-08-27 14:29:46,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:29:46,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609786638] [2023-08-27 14:29:46,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:29:46,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:29:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:29:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:29:46,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:29:46,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609786638] [2023-08-27 14:29:46,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609786638] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:29:46,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105022754] [2023-08-27 14:29:46,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:29:46,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:29:46,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:29:46,609 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 14:29:46,613 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 14:29:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:29:47,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 14:29:47,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:29:47,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:29:47,039 INFO L322 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2023-08-27 14:29:47,039 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 14:29:47,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-27 14:29:47,111 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 14:29:47,111 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 14:29:47,129 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 14:29:47,142 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 14:29:47,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:29:47,165 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 14:29:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:29:47,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:29:55,370 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_889 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_889))) (let ((.cse0 (select (select .cse1 ~B~0.base) (+ ~B~0.offset 4)))) (or (< .cse0 0) (< 0 .cse0) (<= (+ .cse0 (select (select .cse1 c_~A~0.base) .cse2)) 2147483647))))) (forall ((v_ArrVal_889 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_889))) (let ((.cse3 (select (select .cse4 ~B~0.base) (+ ~B~0.offset 4)))) (or (< (+ 9223372039002259455 .cse3) 0) (<= (+ .cse3 (select (select .cse4 c_~A~0.base) .cse2)) 2147483647) (<= 0 .cse3))))))) is different from false [2023-08-27 14:29:55,389 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_889 (Array Int Int)) (v_ArrVal_888 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_888) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_889))) (let ((.cse0 (select (select .cse1 ~B~0.base) (+ ~B~0.offset 4)))) (or (< 0 .cse0) (<= (+ (select (select .cse1 c_~A~0.base) .cse2) .cse0) 2147483647) (< .cse0 0))))) (forall ((v_ArrVal_889 (Array Int Int)) (v_ArrVal_888 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_888) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_889))) (let ((.cse4 (select (select .cse3 ~B~0.base) (+ ~B~0.offset 4)))) (or (<= (+ (select (select .cse3 c_~A~0.base) .cse2) .cse4) 2147483647) (<= 0 .cse4) (< (+ 9223372039002259455 .cse4) 0))))))) is different from false [2023-08-27 14:29:55,525 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:29:55,525 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 231 treesize of output 148 [2023-08-27 14:29:55,588 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:29:55,589 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 2693 treesize of output 2436 [2023-08-27 14:29:55,753 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:29:55,754 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 885 treesize of output 814 [2023-08-27 14:29:55,789 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:29:55,790 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 805 treesize of output 774 [2023-08-27 14:29:55,825 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:29:55,826 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 765 treesize of output 734 [2023-08-27 14:29:55,861 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:29:55,862 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 725 treesize of output 654 Received shutdown request... [2023-08-27 14:31:50,998 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 14:31:50,998 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 14:31:51,004 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 92 remaining) [2023-08-27 14:31:51,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-08-27 14:31:51,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:31:51,212 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. [2023-08-27 14:31:51,213 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 92 remaining) [2023-08-27 14:31:51,213 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 92 remaining) [2023-08-27 14:31:51,214 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 92 remaining) [2023-08-27 14:31:51,214 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 92 remaining) [2023-08-27 14:31:51,214 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 92 remaining) [2023-08-27 14:31:51,214 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 92 remaining) [2023-08-27 14:31:51,214 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 92 remaining) [2023-08-27 14:31:51,214 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 92 remaining) [2023-08-27 14:31:51,214 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 92 remaining) [2023-08-27 14:31:51,215 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 92 remaining) [2023-08-27 14:31:51,215 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 92 remaining) [2023-08-27 14:31:51,215 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 92 remaining) [2023-08-27 14:31:51,215 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 92 remaining) [2023-08-27 14:31:51,215 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 92 remaining) [2023-08-27 14:31:51,215 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 92 remaining) [2023-08-27 14:31:51,216 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 92 remaining) [2023-08-27 14:31:51,216 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 92 remaining) [2023-08-27 14:31:51,216 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 92 remaining) [2023-08-27 14:31:51,216 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 92 remaining) [2023-08-27 14:31:51,216 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 92 remaining) [2023-08-27 14:31:51,216 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 92 remaining) [2023-08-27 14:31:51,217 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 92 remaining) [2023-08-27 14:31:51,217 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 92 remaining) [2023-08-27 14:31:51,217 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 92 remaining) [2023-08-27 14:31:51,217 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 92 remaining) [2023-08-27 14:31:51,217 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 92 remaining) [2023-08-27 14:31:51,217 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 92 remaining) [2023-08-27 14:31:51,218 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 92 remaining) [2023-08-27 14:31:51,218 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 92 remaining) [2023-08-27 14:31:51,218 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 92 remaining) [2023-08-27 14:31:51,218 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 92 remaining) [2023-08-27 14:31:51,218 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 92 remaining) [2023-08-27 14:31:51,218 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 92 remaining) [2023-08-27 14:31:51,219 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 92 remaining) [2023-08-27 14:31:51,219 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 92 remaining) [2023-08-27 14:31:51,219 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 92 remaining) [2023-08-27 14:31:51,219 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 92 remaining) [2023-08-27 14:31:51,219 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 92 remaining) [2023-08-27 14:31:51,219 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 92 remaining) [2023-08-27 14:31:51,220 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 92 remaining) [2023-08-27 14:31:51,220 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 92 remaining) [2023-08-27 14:31:51,220 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 92 remaining) [2023-08-27 14:31:51,220 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 92 remaining) [2023-08-27 14:31:51,220 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 92 remaining) [2023-08-27 14:31:51,220 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 92 remaining) [2023-08-27 14:31:51,221 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 92 remaining) [2023-08-27 14:31:51,221 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONASSERT (44 of 92 remaining) [2023-08-27 14:31:51,221 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 92 remaining) [2023-08-27 14:31:51,221 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 92 remaining) [2023-08-27 14:31:51,221 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 92 remaining) [2023-08-27 14:31:51,221 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 92 remaining) [2023-08-27 14:31:51,222 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 92 remaining) [2023-08-27 14:31:51,222 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 92 remaining) [2023-08-27 14:31:51,222 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 92 remaining) [2023-08-27 14:31:51,222 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 92 remaining) [2023-08-27 14:31:51,222 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 92 remaining) [2023-08-27 14:31:51,222 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 92 remaining) [2023-08-27 14:31:51,223 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 92 remaining) [2023-08-27 14:31:51,223 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 92 remaining) [2023-08-27 14:31:51,223 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 92 remaining) [2023-08-27 14:31:51,223 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 92 remaining) [2023-08-27 14:31:51,223 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 92 remaining) [2023-08-27 14:31:51,223 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 92 remaining) [2023-08-27 14:31:51,223 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 92 remaining) [2023-08-27 14:31:51,224 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 92 remaining) [2023-08-27 14:31:51,224 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 92 remaining) [2023-08-27 14:31:51,224 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 92 remaining) [2023-08-27 14:31:51,224 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 92 remaining) [2023-08-27 14:31:51,224 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 92 remaining) [2023-08-27 14:31:51,224 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 92 remaining) [2023-08-27 14:31:51,225 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 92 remaining) [2023-08-27 14:31:51,225 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 92 remaining) [2023-08-27 14:31:51,225 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 92 remaining) [2023-08-27 14:31:51,225 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 92 remaining) [2023-08-27 14:31:51,225 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 92 remaining) [2023-08-27 14:31:51,226 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 92 remaining) [2023-08-27 14:31:51,226 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 92 remaining) [2023-08-27 14:31:51,226 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 92 remaining) [2023-08-27 14:31:51,226 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 92 remaining) [2023-08-27 14:31:51,226 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 92 remaining) [2023-08-27 14:31:51,226 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 92 remaining) [2023-08-27 14:31:51,227 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 92 remaining) [2023-08-27 14:31:51,227 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 92 remaining) [2023-08-27 14:31:51,227 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 92 remaining) [2023-08-27 14:31:51,227 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 92 remaining) [2023-08-27 14:31:51,227 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 92 remaining) [2023-08-27 14:31:51,227 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 92 remaining) [2023-08-27 14:31:51,228 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 92 remaining) [2023-08-27 14:31:51,228 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 92 remaining) [2023-08-27 14:31:51,228 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 92 remaining) [2023-08-27 14:31:51,228 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 92 remaining) [2023-08-27 14:31:51,229 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:31:51,235 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 14:31:51,235 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 14:31:51,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 02:31:51 BasicIcfg [2023-08-27 14:31:51,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 14:31:51,238 INFO L158 Benchmark]: Toolchain (without parser) took 809762.02ms. Allocated memory was 348.1MB in the beginning and 11.2GB in the end (delta: 10.8GB). Free memory was 323.7MB in the beginning and 8.2GB in the end (delta: -7.9GB). Peak memory consumption was 5.0GB. Max. memory is 16.0GB. [2023-08-27 14:31:51,238 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 348.1MB. Free memory was 325.6MB in the beginning and 325.5MB in the end (delta: 82.6kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 14:31:51,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.43ms. Allocated memory is still 348.1MB. Free memory was 323.7MB in the beginning and 310.5MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-27 14:31:51,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.90ms. Allocated memory is still 348.1MB. Free memory was 310.5MB in the beginning and 307.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 14:31:51,238 INFO L158 Benchmark]: Boogie Preprocessor took 45.08ms. Allocated memory is still 348.1MB. Free memory was 307.8MB in the beginning and 305.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 14:31:51,239 INFO L158 Benchmark]: RCFGBuilder took 1940.37ms. Allocated memory was 348.1MB in the beginning and 419.4MB in the end (delta: 71.3MB). Free memory was 305.7MB in the beginning and 377.5MB in the end (delta: -71.9MB). Peak memory consumption was 142.2MB. Max. memory is 16.0GB. [2023-08-27 14:31:51,239 INFO L158 Benchmark]: TraceAbstraction took 807414.62ms. Allocated memory was 419.4MB in the beginning and 11.2GB in the end (delta: 10.7GB). Free memory was 377.5MB in the beginning and 8.2GB in the end (delta: -7.8GB). Peak memory consumption was 5.0GB. Max. memory is 16.0GB. [2023-08-27 14:31:51,240 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 348.1MB. Free memory was 325.6MB in the beginning and 325.5MB in the end (delta: 82.6kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 286.43ms. Allocated memory is still 348.1MB. Free memory was 323.7MB in the beginning and 310.5MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 63.90ms. Allocated memory is still 348.1MB. Free memory was 310.5MB in the beginning and 307.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.08ms. Allocated memory is still 348.1MB. Free memory was 307.8MB in the beginning and 305.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1940.37ms. Allocated memory was 348.1MB in the beginning and 419.4MB in the end (delta: 71.3MB). Free memory was 305.7MB in the beginning and 377.5MB in the end (delta: -71.9MB). Peak memory consumption was 142.2MB. Max. memory is 16.0GB. * TraceAbstraction took 807414.62ms. Allocated memory was 419.4MB in the beginning and 11.2GB in the end (delta: 10.7GB). Free memory was 377.5MB in the beginning and 8.2GB in the end (delta: -7.8GB). Peak memory consumption was 5.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.0s, 222 PlacesBefore, 77 PlacesAfterwards, 228 TransitionsBefore, 72 TransitionsAfterwards, 6318 CoEnabledTransitionPairs, 7 FixpointIterations, 116 TrivialSequentialCompositions, 82 ConcurrentSequentialCompositions, 21 TrivialYvCompositions, 6 ConcurrentYvCompositions, 11 ChoiceCompositions, 236 TotalNumberOfCompositions, 8301 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7527, independent: 7499, independent conditional: 0, independent unconditional: 7499, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2801, independent: 2787, independent conditional: 0, independent unconditional: 2787, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7527, independent: 4712, independent conditional: 0, independent unconditional: 4712, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 2801, unknown conditional: 0, unknown unconditional: 2801] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 262, Positive conditional cache size: 0, Positive unconditional cache size: 262, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 91]: 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 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 89]: 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 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - TimeoutResultAtElement [Line: 90]: 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 12 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-21-5-3-8-3-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 308 locations, 92 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: 807.0s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 308.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 42.1s, HoareTripleCheckerStatistics: 93 mSolverCounterUnknown, 1890 SdHoareTripleChecker+Valid, 194.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1890 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 193.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 721 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 239 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6707 IncrementalHoareTripleChecker+Invalid, 7760 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 239 mSolverCounterUnsat, 13 mSDtfsCounter, 6707 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 78 SyntacticMatches, 13 SemanticMatches, 234 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1022occurred in iteration=20, InterpolantAutomatonStates: 124, 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.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 321.6s InterpolantComputationTime, 260 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 312 ConstructedInterpolants, 40 QuantifiedInterpolants, 5356 SizeOfPredicates, 77 NumberOfNonLiveVariables, 2493 ConjunctsInSsa, 261 ConjunctsInUnsatCore, 46 InterpolantComputations, 8 PerfectInterpolantSequences, 82/151 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