/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 -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 12:47:36,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 12:47:36,955 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-24 12:47:36,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 12:47:36,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 12:47:36,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 12:47:36,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 12:47:36,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 12:47:36,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 12:47:36,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 12:47:36,998 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 12:47:36,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 12:47:36,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 12:47:36,999 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 12:47:36,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 12:47:37,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 12:47:37,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 12:47:37,000 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 12:47:37,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 12:47:37,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 12:47:37,001 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 12:47:37,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 12:47:37,002 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 12:47:37,002 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 12:47:37,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 12:47:37,003 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 12:47:37,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 12:47:37,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 12:47:37,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 12:47:37,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 12:47:37,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 12:47:37,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 12:47:37,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 12:47:37,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 12:47:37,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 12:47:37,005 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 [2023-08-24 12:47:37,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 12:47:37,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 12:47:37,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 12:47:37,310 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 12:47:37,311 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 12:47:37,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2023-08-24 12:47:38,407 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 12:47:38,711 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 12:47:38,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2023-08-24 12:47:38,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47ebe602/f73bea3c87f14836a7923fbff4ac9545/FLAG964ade6f7 [2023-08-24 12:47:38,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47ebe602/f73bea3c87f14836a7923fbff4ac9545 [2023-08-24 12:47:38,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 12:47:38,740 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 12:47:38,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 12:47:38,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 12:47:38,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 12:47:38,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 12:47:38" (1/1) ... [2023-08-24 12:47:38,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef5a810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:38, skipping insertion in model container [2023-08-24 12:47:38,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 12:47:38" (1/1) ... [2023-08-24 12:47:38,790 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 12:47:39,234 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i[41323,41336] [2023-08-24 12:47:39,271 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 12:47:39,297 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 12:47:39,322 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-24 12:47:39,324 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-24 12:47:39,330 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-24 12:47:39,344 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i[41323,41336] [2023-08-24 12:47:39,366 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 12:47:39,432 INFO L206 MainTranslator]: Completed translation [2023-08-24 12:47:39,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:39 WrapperNode [2023-08-24 12:47:39,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 12:47:39,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 12:47:39,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 12:47:39,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 12:47:39,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:39" (1/1) ... [2023-08-24 12:47:39,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:39" (1/1) ... [2023-08-24 12:47:39,503 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 193 [2023-08-24 12:47:39,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 12:47:39,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 12:47:39,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 12:47:39,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 12:47:39,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:39" (1/1) ... [2023-08-24 12:47:39,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:39" (1/1) ... [2023-08-24 12:47:39,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:39" (1/1) ... [2023-08-24 12:47:39,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:39" (1/1) ... [2023-08-24 12:47:39,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:39" (1/1) ... [2023-08-24 12:47:39,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:39" (1/1) ... [2023-08-24 12:47:39,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:39" (1/1) ... [2023-08-24 12:47:39,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:39" (1/1) ... [2023-08-24 12:47:39,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 12:47:39,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 12:47:39,557 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 12:47:39,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 12:47:39,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:39" (1/1) ... [2023-08-24 12:47:39,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 12:47:39,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:39,589 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-24 12:47:39,597 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-24 12:47:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 12:47:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 12:47:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 12:47:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 12:47:39,628 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-24 12:47:39,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 12:47:39,628 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-24 12:47:39,628 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-24 12:47:39,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 12:47:39,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 12:47:39,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 12:47:39,629 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 12:47:39,754 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 12:47:39,755 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 12:47:40,043 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 12:47:40,051 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 12:47:40,051 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-24 12:47:40,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 12:47:40 BoogieIcfgContainer [2023-08-24 12:47:40,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 12:47:40,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 12:47:40,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 12:47:40,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 12:47:40,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 12:47:38" (1/3) ... [2023-08-24 12:47:40,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d185e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 12:47:40, skipping insertion in model container [2023-08-24 12:47:40,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:39" (2/3) ... [2023-08-24 12:47:40,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d185e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 12:47:40, skipping insertion in model container [2023-08-24 12:47:40,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 12:47:40" (3/3) ... [2023-08-24 12:47:40,060 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_74-tricky_address1_racefree.i [2023-08-24 12:47:40,076 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 12:47:40,076 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 12:47:40,076 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 12:47:40,137 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-24 12:47:40,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 193 transitions, 394 flow [2023-08-24 12:47:40,238 INFO L124 PetriNetUnfolderBase]: 45/265 cut-off events. [2023-08-24 12:47:40,238 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-24 12:47:40,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 265 events. 45/265 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 847 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 145. Up to 8 conditions per place. [2023-08-24 12:47:40,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 193 transitions, 394 flow [2023-08-24 12:47:40,257 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 188 transitions, 381 flow [2023-08-24 12:47:40,259 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 12:47:40,267 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-24 12:47:40,270 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-24 12:47:40,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 188 transitions, 381 flow [2023-08-24 12:47:40,313 INFO L124 PetriNetUnfolderBase]: 44/260 cut-off events. [2023-08-24 12:47:40,313 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:40,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 260 events. 44/260 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 811 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 145. Up to 8 conditions per place. [2023-08-24 12:47:40,325 INFO L119 LiptonReduction]: Number of co-enabled transitions 10608 [2023-08-24 12:47:43,066 INFO L134 LiptonReduction]: Checked pairs total: 16839 [2023-08-24 12:47:43,067 INFO L136 LiptonReduction]: Total number of compositions: 156 [2023-08-24 12:47:43,078 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 12:47:43,083 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;@64ee516b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 12:47:43,084 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-24 12:47:43,088 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 12:47:43,088 INFO L124 PetriNetUnfolderBase]: 8/31 cut-off events. [2023-08-24 12:47:43,088 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:43,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:43,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-24 12:47:43,089 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 12:47:43,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1124994599, now seen corresponding path program 1 times [2023-08-24 12:47:43,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:43,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434568286] [2023-08-24 12:47:43,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:43,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:43,308 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-24 12:47:43,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:43,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434568286] [2023-08-24 12:47:43,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434568286] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:47:43,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:47:43,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 12:47:43,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848372298] [2023-08-24 12:47:43,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:47:43,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:47:43,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:43,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:47:43,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 12:47:43,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 349 [2023-08-24 12:47:43,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:43,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:43,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 349 [2023-08-24 12:47:43,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:43,509 INFO L124 PetriNetUnfolderBase]: 300/656 cut-off events. [2023-08-24 12:47:43,509 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:43,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 656 events. 300/656 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3225 event pairs, 266 based on Foata normal form. 108/654 useless extension candidates. Maximal degree in co-relation 1194. Up to 588 conditions per place. [2023-08-24 12:47:43,517 INFO L140 encePairwiseOnDemand]: 325/349 looper letters, 36 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-24 12:47:43,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-08-24 12:47:43,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:47:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:47:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2023-08-24 12:47:43,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498567335243553 [2023-08-24 12:47:43,531 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2023-08-24 12:47:43,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2023-08-24 12:47:43,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:43,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2023-08-24 12:47:43,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:43,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:43,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:43,549 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 522 transitions. [2023-08-24 12:47:43,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-08-24 12:47:43,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:47:43,554 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 107 flow [2023-08-24 12:47:43,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2023-08-24 12:47:43,558 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-08-24 12:47:43,559 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 107 flow [2023-08-24 12:47:43,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:43,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:43,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:43,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 12:47:43,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 12:47:43,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:43,561 INFO L85 PathProgramCache]: Analyzing trace with hash -142754660, now seen corresponding path program 1 times [2023-08-24 12:47:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:43,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984978548] [2023-08-24 12:47:43,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:43,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:43,663 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-24 12:47:43,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:43,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984978548] [2023-08-24 12:47:43,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984978548] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:43,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842250520] [2023-08-24 12:47:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:43,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:43,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:43,671 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-24 12:47:43,733 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-24 12:47:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:43,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-24 12:47:43,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 12:47:43,830 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:47:43,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842250520] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:47:43,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:47:43,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-24 12:47:43,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56108207] [2023-08-24 12:47:43,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:47:43,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:47:43,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:43,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:47:43,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 12:47:43,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 349 [2023-08-24 12:47:43,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:43,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:43,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 349 [2023-08-24 12:47:43,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:43,947 INFO L124 PetriNetUnfolderBase]: 283/635 cut-off events. [2023-08-24 12:47:43,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:43,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 635 events. 283/635 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3578 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1221. Up to 555 conditions per place. [2023-08-24 12:47:43,951 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 51 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-24 12:47:43,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 243 flow [2023-08-24 12:47:43,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:47:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:47:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2023-08-24 12:47:43,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918815663801337 [2023-08-24 12:47:43,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2023-08-24 12:47:43,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2023-08-24 12:47:43,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:43,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2023-08-24 12:47:43,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:43,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:43,965 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:43,966 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 107 flow. Second operand 3 states and 515 transitions. [2023-08-24 12:47:43,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 243 flow [2023-08-24 12:47:43,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 239 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 12:47:43,968 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 111 flow [2023-08-24 12:47:43,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-08-24 12:47:43,969 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2023-08-24 12:47:43,970 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 111 flow [2023-08-24 12:47:43,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:43,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:43,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:43,977 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-24 12:47:44,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:44,177 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 12:47:44,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:44,178 INFO L85 PathProgramCache]: Analyzing trace with hash -42471440, now seen corresponding path program 1 times [2023-08-24 12:47:44,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:44,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676462667] [2023-08-24 12:47:44,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:44,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:44,291 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-24 12:47:44,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:44,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676462667] [2023-08-24 12:47:44,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676462667] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:44,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542120095] [2023-08-24 12:47:44,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:44,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:44,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:44,296 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-24 12:47:44,300 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-24 12:47:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:44,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 12:47:44,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:44,420 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-24 12:47:44,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:47:44,444 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-24 12:47:44,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542120095] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:47:44,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:47:44,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 12:47:44,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549730491] [2023-08-24 12:47:44,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:47:44,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:47:44,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:44,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:47:44,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-24 12:47:44,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 349 [2023-08-24 12:47:44,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 155.85714285714286) internal successors, (1091), 7 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:44,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:44,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 349 [2023-08-24 12:47:44,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:44,613 INFO L124 PetriNetUnfolderBase]: 301/637 cut-off events. [2023-08-24 12:47:44,614 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-24 12:47:44,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 637 events. 301/637 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3091 event pairs, 266 based on Foata normal form. 3/547 useless extension candidates. Maximal degree in co-relation 1245. Up to 571 conditions per place. [2023-08-24 12:47:44,616 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 36 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2023-08-24 12:47:44,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 205 flow [2023-08-24 12:47:44,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:47:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:47:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions. [2023-08-24 12:47:44,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46227316141356256 [2023-08-24 12:47:44,620 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 968 transitions. [2023-08-24 12:47:44,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 968 transitions. [2023-08-24 12:47:44,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:44,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 968 transitions. [2023-08-24 12:47:44,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.33333333333334) internal successors, (968), 6 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:44,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 349.0) internal successors, (2443), 7 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:44,629 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 349.0) internal successors, (2443), 7 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:44,629 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 111 flow. Second operand 6 states and 968 transitions. [2023-08-24 12:47:44,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 205 flow [2023-08-24 12:47:44,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 12:47:44,632 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 143 flow [2023-08-24 12:47:44,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2023-08-24 12:47:44,633 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2023-08-24 12:47:44,634 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 143 flow [2023-08-24 12:47:44,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.85714285714286) internal successors, (1091), 7 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:44,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:44,635 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:44,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-24 12:47:44,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-24 12:47:44,840 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 12:47:44,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:44,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2032414715, now seen corresponding path program 2 times [2023-08-24 12:47:44,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:44,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088599184] [2023-08-24 12:47:44,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:44,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:44,983 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-24 12:47:44,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:44,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088599184] [2023-08-24 12:47:44,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088599184] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:44,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208334939] [2023-08-24 12:47:44,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:47:44,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:44,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:44,986 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-24 12:47:44,988 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-24 12:47:45,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 12:47:45,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:47:45,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-24 12:47:45,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:45,090 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 7 treesize of output 6 [2023-08-24 12:47:45,155 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:47:45,155 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-24 12:47:45,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 12:47:45,227 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-24 12:47:45,227 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:47:45,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208334939] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:47:45,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:47:45,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-24 12:47:45,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226643135] [2023-08-24 12:47:45,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:47:45,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 12:47:45,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:45,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 12:47:45,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-24 12:47:45,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 349 [2023-08-24 12:47:45,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:45,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:45,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 349 [2023-08-24 12:47:45,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:45,466 INFO L124 PetriNetUnfolderBase]: 318/709 cut-off events. [2023-08-24 12:47:45,466 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-24 12:47:45,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1424 conditions, 709 events. 318/709 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3659 event pairs, 50 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 1389. Up to 433 conditions per place. [2023-08-24 12:47:45,469 INFO L140 encePairwiseOnDemand]: 341/349 looper letters, 45 selfloop transitions, 6 changer transitions 36/93 dead transitions. [2023-08-24 12:47:45,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 93 transitions, 409 flow [2023-08-24 12:47:45,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:47:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:47:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 842 transitions. [2023-08-24 12:47:45,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40210124164278893 [2023-08-24 12:47:45,475 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 842 transitions. [2023-08-24 12:47:45,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 842 transitions. [2023-08-24 12:47:45,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:45,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 842 transitions. [2023-08-24 12:47:45,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.33333333333334) internal successors, (842), 6 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:45,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 349.0) internal successors, (2443), 7 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:45,487 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 349.0) internal successors, (2443), 7 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:45,487 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 143 flow. Second operand 6 states and 842 transitions. [2023-08-24 12:47:45,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 93 transitions, 409 flow [2023-08-24 12:47:45,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 93 transitions, 395 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 12:47:45,491 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 157 flow [2023-08-24 12:47:45,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=157, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2023-08-24 12:47:45,493 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2023-08-24 12:47:45,493 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 157 flow [2023-08-24 12:47:45,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:45,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:45,494 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:45,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 12:47:45,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:45,700 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 12:47:45,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:45,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1773381433, now seen corresponding path program 1 times [2023-08-24 12:47:45,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:45,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885703643] [2023-08-24 12:47:45,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:45,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-24 12:47:45,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:45,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885703643] [2023-08-24 12:47:45,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885703643] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:45,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791479959] [2023-08-24 12:47:45,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:45,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:45,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:45,793 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-24 12:47:45,815 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-24 12:47:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:45,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 12:47:45,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 12:47:45,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:47:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 12:47:45,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791479959] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:47:45,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:47:45,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-24 12:47:45,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950276472] [2023-08-24 12:47:45,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:47:45,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-24 12:47:45,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:45,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-24 12:47:45,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-24 12:47:45,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 349 [2023-08-24 12:47:45,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 157 flow. Second operand has 14 states, 14 states have (on average 149.14285714285714) internal successors, (2088), 14 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:45,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:45,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 349 [2023-08-24 12:47:45,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:46,021 INFO L124 PetriNetUnfolderBase]: 23/76 cut-off events. [2023-08-24 12:47:46,021 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2023-08-24 12:47:46,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 76 events. 23/76 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 140 event pairs, 0 based on Foata normal form. 18/91 useless extension candidates. Maximal degree in co-relation 200. Up to 46 conditions per place. [2023-08-24 12:47:46,021 INFO L140 encePairwiseOnDemand]: 344/349 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2023-08-24 12:47:46,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 236 flow [2023-08-24 12:47:46,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 12:47:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-24 12:47:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2104 transitions. [2023-08-24 12:47:46,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43061809250921 [2023-08-24 12:47:46,027 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2104 transitions. [2023-08-24 12:47:46,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2104 transitions. [2023-08-24 12:47:46,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:46,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2104 transitions. [2023-08-24 12:47:46,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 150.28571428571428) internal successors, (2104), 14 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:46,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 349.0) internal successors, (5235), 15 states have internal predecessors, (5235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:46,041 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 349.0) internal successors, (5235), 15 states have internal predecessors, (5235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:46,041 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 157 flow. Second operand 14 states and 2104 transitions. [2023-08-24 12:47:46,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 236 flow [2023-08-24 12:47:46,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 213 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-24 12:47:46,042 INFO L231 Difference]: Finished difference. Result has 46 places, 0 transitions, 0 flow [2023-08-24 12:47:46,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=46, PETRI_TRANSITIONS=0} [2023-08-24 12:47:46,043 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-08-24 12:47:46,043 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 0 transitions, 0 flow [2023-08-24 12:47:46,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 149.14285714285714) internal successors, (2088), 14 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:46,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-24 12:47:46,047 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-24 12:47:46,047 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-24 12:47:46,053 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-24 12:47:46,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:46,253 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-08-24 12:47:46,255 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-24 12:47:46,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 193 transitions, 394 flow [2023-08-24 12:47:46,277 INFO L124 PetriNetUnfolderBase]: 45/265 cut-off events. [2023-08-24 12:47:46,278 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-24 12:47:46,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 265 events. 45/265 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 847 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 145. Up to 8 conditions per place. [2023-08-24 12:47:46,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 193 transitions, 394 flow [2023-08-24 12:47:46,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 188 transitions, 381 flow [2023-08-24 12:47:46,280 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 12:47:46,280 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-24 12:47:46,281 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-24 12:47:46,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 188 transitions, 381 flow [2023-08-24 12:47:46,297 INFO L124 PetriNetUnfolderBase]: 44/260 cut-off events. [2023-08-24 12:47:46,297 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:46,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 260 events. 44/260 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 811 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 145. Up to 8 conditions per place. [2023-08-24 12:47:46,302 INFO L119 LiptonReduction]: Number of co-enabled transitions 10608 [2023-08-24 12:47:48,720 INFO L134 LiptonReduction]: Checked pairs total: 16887 [2023-08-24 12:47:48,721 INFO L136 LiptonReduction]: Total number of compositions: 157 [2023-08-24 12:47:48,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-24 12:47:48,723 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;@64ee516b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 12:47:48,723 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-24 12:47:48,726 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 12:47:48,726 INFO L124 PetriNetUnfolderBase]: 12/42 cut-off events. [2023-08-24 12:47:48,726 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:48,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:48,726 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-24 12:47:48,727 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:47:48,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:48,727 INFO L85 PathProgramCache]: Analyzing trace with hash -655942262, now seen corresponding path program 1 times [2023-08-24 12:47:48,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:48,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051425485] [2023-08-24 12:47:48,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:48,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:48,763 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-24 12:47:48,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:48,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051425485] [2023-08-24 12:47:48,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051425485] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:47:48,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:47:48,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 12:47:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145211501] [2023-08-24 12:47:48,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:47:48,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:47:48,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:48,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:47:48,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 12:47:48,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 350 [2023-08-24 12:47:48,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:48,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:48,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 350 [2023-08-24 12:47:48,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:48,848 INFO L124 PetriNetUnfolderBase]: 301/651 cut-off events. [2023-08-24 12:47:48,849 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:48,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 651 events. 301/651 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3213 event pairs, 266 based on Foata normal form. 107/643 useless extension candidates. Maximal degree in co-relation 1189. Up to 588 conditions per place. [2023-08-24 12:47:48,850 INFO L140 encePairwiseOnDemand]: 326/350 looper letters, 20 selfloop transitions, 2 changer transitions 19/46 dead transitions. [2023-08-24 12:47:48,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-08-24 12:47:48,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:47:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:47:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2023-08-24 12:47:48,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2023-08-24 12:47:48,853 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2023-08-24 12:47:48,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2023-08-24 12:47:48,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:48,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2023-08-24 12:47:48,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:48,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:48,856 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:48,856 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 522 transitions. [2023-08-24 12:47:48,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-08-24 12:47:48,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:47:48,857 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 69 flow [2023-08-24 12:47:48,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-08-24 12:47:48,858 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-08-24 12:47:48,858 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 69 flow [2023-08-24 12:47:48,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:48,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:48,859 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:48,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 12:47:48,859 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:47:48,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:48,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1702841322, now seen corresponding path program 1 times [2023-08-24 12:47:48,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:48,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115260470] [2023-08-24 12:47:48,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:48,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:47:48,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:48,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115260470] [2023-08-24 12:47:48,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115260470] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:48,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970184583] [2023-08-24 12:47:48,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:48,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:48,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:48,891 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-24 12:47:48,903 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-24 12:47:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:48,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 12:47:48,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:47:48,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:47:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:47:48,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970184583] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:47:48,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:47:48,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 12:47:48,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844179959] [2023-08-24 12:47:48,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:47:48,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:47:48,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:48,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:47:48,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-24 12:47:48,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 350 [2023-08-24 12:47:48,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 69 flow. Second operand has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:48,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:48,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 350 [2023-08-24 12:47:48,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:49,056 INFO L124 PetriNetUnfolderBase]: 47/128 cut-off events. [2023-08-24 12:47:49,056 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:49,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 128 events. 47/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 360 event pairs, 42 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 243. Up to 108 conditions per place. [2023-08-24 12:47:49,057 INFO L140 encePairwiseOnDemand]: 347/350 looper letters, 20 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-24 12:47:49,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 131 flow [2023-08-24 12:47:49,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:47:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:47:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 952 transitions. [2023-08-24 12:47:49,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2023-08-24 12:47:49,060 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 952 transitions. [2023-08-24 12:47:49,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 952 transitions. [2023-08-24 12:47:49,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:49,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 952 transitions. [2023-08-24 12:47:49,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.66666666666666) internal successors, (952), 6 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:49,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:49,066 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:49,066 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 69 flow. Second operand 6 states and 952 transitions. [2023-08-24 12:47:49,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 131 flow [2023-08-24 12:47:49,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 127 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 12:47:49,067 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2023-08-24 12:47:49,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-08-24 12:47:49,069 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-08-24 12:47:49,069 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2023-08-24 12:47:49,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:49,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:49,070 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-24 12:47:49,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-24 12:47:49,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:49,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:47:49,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:49,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1037983882, now seen corresponding path program 2 times [2023-08-24 12:47:49,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:49,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528196022] [2023-08-24 12:47:49,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:49,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:47:49,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:49,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528196022] [2023-08-24 12:47:49,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528196022] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:49,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388671928] [2023-08-24 12:47:49,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:47:49,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:49,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:49,364 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-24 12:47:49,387 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-24 12:47:49,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:47:49,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:47:49,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 12:47:49,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:47:49,455 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:47:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:47:49,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388671928] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:47:49,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:47:49,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-24 12:47:49,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789820246] [2023-08-24 12:47:49,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:47:49,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 12:47:49,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:49,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 12:47:49,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-24 12:47:49,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 350 [2023-08-24 12:47:49,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 101 flow. Second operand has 13 states, 13 states have (on average 155.30769230769232) internal successors, (2019), 13 states have internal predecessors, (2019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:49,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:49,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 350 [2023-08-24 12:47:49,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:49,560 INFO L124 PetriNetUnfolderBase]: 47/134 cut-off events. [2023-08-24 12:47:49,560 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-24 12:47:49,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 134 events. 47/134 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 360 event pairs, 42 based on Foata normal form. 6/116 useless extension candidates. Maximal degree in co-relation 234. Up to 108 conditions per place. [2023-08-24 12:47:49,561 INFO L140 encePairwiseOnDemand]: 347/350 looper letters, 20 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2023-08-24 12:47:49,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 199 flow [2023-08-24 12:47:49,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 12:47:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 12:47:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1885 transitions. [2023-08-24 12:47:49,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4488095238095238 [2023-08-24 12:47:49,566 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1885 transitions. [2023-08-24 12:47:49,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1885 transitions. [2023-08-24 12:47:49,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:49,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1885 transitions. [2023-08-24 12:47:49,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 157.08333333333334) internal successors, (1885), 12 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:49,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 350.0) internal successors, (4550), 13 states have internal predecessors, (4550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:49,605 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 350.0) internal successors, (4550), 13 states have internal predecessors, (4550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:49,605 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 12 states and 1885 transitions. [2023-08-24 12:47:49,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 199 flow [2023-08-24 12:47:49,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 185 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 12:47:49,609 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 171 flow [2023-08-24 12:47:49,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=171, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2023-08-24 12:47:49,611 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-08-24 12:47:49,611 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 171 flow [2023-08-24 12:47:49,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 155.30769230769232) internal successors, (2019), 13 states have internal predecessors, (2019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:49,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:49,612 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-24 12:47:49,623 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-24 12:47:49,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:49,818 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:47:49,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:49,819 INFO L85 PathProgramCache]: Analyzing trace with hash -511347446, now seen corresponding path program 3 times [2023-08-24 12:47:49,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:49,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508719568] [2023-08-24 12:47:49,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:49,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 12:47:49,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 12:47:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 12:47:49,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 12:47:49,878 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 12:47:49,878 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-24 12:47:49,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 12:47:49,878 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-24 12:47:49,879 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-24 12:47:49,879 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 12:47:49,879 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-24 12:47:49,914 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-24 12:47:49,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 263 transitions, 544 flow [2023-08-24 12:47:49,962 INFO L124 PetriNetUnfolderBase]: 75/432 cut-off events. [2023-08-24 12:47:49,962 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-24 12:47:49,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 432 events. 75/432 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1744 event pairs, 0 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 267. Up to 12 conditions per place. [2023-08-24 12:47:49,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 263 transitions, 544 flow [2023-08-24 12:47:49,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 263 transitions, 544 flow [2023-08-24 12:47:49,969 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 12:47:49,970 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 263 transitions, 544 flow [2023-08-24 12:47:49,970 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 263 transitions, 544 flow [2023-08-24 12:47:49,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 263 transitions, 544 flow [2023-08-24 12:47:50,019 INFO L124 PetriNetUnfolderBase]: 75/432 cut-off events. [2023-08-24 12:47:50,019 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-24 12:47:50,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 432 events. 75/432 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1744 event pairs, 0 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 267. Up to 12 conditions per place. [2023-08-24 12:47:50,043 INFO L119 LiptonReduction]: Number of co-enabled transitions 31960 [2023-08-24 12:47:52,975 INFO L134 LiptonReduction]: Checked pairs total: 50430 [2023-08-24 12:47:52,976 INFO L136 LiptonReduction]: Total number of compositions: 217 [2023-08-24 12:47:52,977 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 12:47:52,978 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;@64ee516b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 12:47:52,978 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 12:47:52,980 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 12:47:52,980 INFO L124 PetriNetUnfolderBase]: 8/30 cut-off events. [2023-08-24 12:47:52,980 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:52,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:52,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-24 12:47:52,981 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:47:52,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:52,981 INFO L85 PathProgramCache]: Analyzing trace with hash 531885796, now seen corresponding path program 1 times [2023-08-24 12:47:52,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:52,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608944900] [2023-08-24 12:47:52,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:52,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:53,004 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-24 12:47:53,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:53,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608944900] [2023-08-24 12:47:53,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608944900] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:47:53,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:47:53,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 12:47:53,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144351459] [2023-08-24 12:47:53,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:47:53,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:47:53,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:53,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:47:53,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 12:47:53,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 480 [2023-08-24 12:47:53,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:53,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:53,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 480 [2023-08-24 12:47:53,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:54,202 INFO L124 PetriNetUnfolderBase]: 9872/15757 cut-off events. [2023-08-24 12:47:54,202 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-08-24 12:47:54,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30205 conditions, 15757 events. 9872/15757 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 104457 event pairs, 9112 based on Foata normal form. 2730/16056 useless extension candidates. Maximal degree in co-relation 12164. Up to 14349 conditions per place. [2023-08-24 12:47:54,273 INFO L140 encePairwiseOnDemand]: 446/480 looper letters, 55 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-24 12:47:54,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 272 flow [2023-08-24 12:47:54,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:47:54,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:47:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2023-08-24 12:47:54,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49722222222222223 [2023-08-24 12:47:54,276 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 716 transitions. [2023-08-24 12:47:54,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 716 transitions. [2023-08-24 12:47:54,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:54,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 716 transitions. [2023-08-24 12:47:54,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:54,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 480.0) internal successors, (1920), 4 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:54,280 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 480.0) internal successors, (1920), 4 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:54,280 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 218 flow. Second operand 3 states and 716 transitions. [2023-08-24 12:47:54,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 272 flow [2023-08-24 12:47:54,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:47:54,283 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-08-24 12:47:54,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2023-08-24 12:47:54,284 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-24 12:47:54,284 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-08-24 12:47:54,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:54,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:54,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:54,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 12:47:54,285 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:47:54,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:54,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1538410554, now seen corresponding path program 1 times [2023-08-24 12:47:54,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:54,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156993582] [2023-08-24 12:47:54,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:54,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:54,317 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-24 12:47:54,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:54,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156993582] [2023-08-24 12:47:54,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156993582] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:54,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954187574] [2023-08-24 12:47:54,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:54,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:54,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:54,321 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-24 12:47:54,345 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-24 12:47:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:54,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-24 12:47:54,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 12:47:54,408 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:47:54,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954187574] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:47:54,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:47:54,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-24 12:47:54,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785560041] [2023-08-24 12:47:54,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:47:54,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:47:54,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:54,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:47:54,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 12:47:54,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 480 [2023-08-24 12:47:54,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:54,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:54,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 480 [2023-08-24 12:47:54,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:55,507 INFO L124 PetriNetUnfolderBase]: 9940/15657 cut-off events. [2023-08-24 12:47:55,508 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2023-08-24 12:47:55,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30105 conditions, 15657 events. 9940/15657 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 102129 event pairs, 6545 based on Foata normal form. 0/13223 useless extension candidates. Maximal degree in co-relation 30092. Up to 14317 conditions per place. [2023-08-24 12:47:55,572 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 72 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-24 12:47:55,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 350 flow [2023-08-24 12:47:55,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:47:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:47:55,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2023-08-24 12:47:55,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48680555555555555 [2023-08-24 12:47:55,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 701 transitions. [2023-08-24 12:47:55,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 701 transitions. [2023-08-24 12:47:55,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:55,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 701 transitions. [2023-08-24 12:47:55,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:55,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 480.0) internal successors, (1920), 4 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:55,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 480.0) internal successors, (1920), 4 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:55,580 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 701 transitions. [2023-08-24 12:47:55,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 350 flow [2023-08-24 12:47:55,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 87 transitions, 346 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 12:47:55,583 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-08-24 12:47:55,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2023-08-24 12:47:55,585 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-24 12:47:55,585 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-08-24 12:47:55,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:55,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:55,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:55,593 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-24 12:47:55,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:55,791 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:47:55,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:55,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1159828577, now seen corresponding path program 1 times [2023-08-24 12:47:55,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:55,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267219024] [2023-08-24 12:47:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:55,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:55,832 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-24 12:47:55,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:55,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267219024] [2023-08-24 12:47:55,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267219024] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:55,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872770267] [2023-08-24 12:47:55,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:55,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:55,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:55,834 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-24 12:47:55,843 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-24 12:47:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:55,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 12:47:55,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:55,928 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-24 12:47:55,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:47:55,941 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-24 12:47:55,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872770267] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:47:55,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:47:55,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 12:47:55,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771623389] [2023-08-24 12:47:55,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:47:55,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:47:55,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:55,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:47:55,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-24 12:47:55,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 480 [2023-08-24 12:47:55,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:55,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:55,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 480 [2023-08-24 12:47:55,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:56,901 INFO L124 PetriNetUnfolderBase]: 9912/15619 cut-off events. [2023-08-24 12:47:56,902 INFO L125 PetriNetUnfolderBase]: For 612/612 co-relation queries the response was YES. [2023-08-24 12:47:56,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30593 conditions, 15619 events. 9912/15619 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 101730 event pairs, 9112 based on Foata normal form. 3/13422 useless extension candidates. Maximal degree in co-relation 30565. Up to 14334 conditions per place. [2023-08-24 12:47:56,960 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 56 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-24 12:47:56,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 310 flow [2023-08-24 12:47:56,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:47:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:47:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1317 transitions. [2023-08-24 12:47:56,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45729166666666665 [2023-08-24 12:47:56,964 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1317 transitions. [2023-08-24 12:47:56,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1317 transitions. [2023-08-24 12:47:56,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:56,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1317 transitions. [2023-08-24 12:47:56,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 219.5) internal successors, (1317), 6 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:56,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 480.0) internal successors, (3360), 7 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:56,972 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 480.0) internal successors, (3360), 7 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:56,972 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1317 transitions. [2023-08-24 12:47:56,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 310 flow [2023-08-24 12:47:56,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 12:47:56,974 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-08-24 12:47:56,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2023-08-24 12:47:56,975 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-08-24 12:47:56,975 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-08-24 12:47:56,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:56,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:56,976 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:56,989 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-24 12:47:57,182 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,SelfDestructingSolverStorable11 [2023-08-24 12:47:57,183 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:47:57,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:57,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2076662717, now seen corresponding path program 2 times [2023-08-24 12:47:57,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:57,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753750172] [2023-08-24 12:47:57,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:57,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:57,249 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-24 12:47:57,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:57,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753750172] [2023-08-24 12:47:57,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753750172] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:57,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945787335] [2023-08-24 12:47:57,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:47:57,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:57,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:57,251 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-24 12:47:57,253 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-24 12:47:57,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 12:47:57,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:47:57,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-24 12:47:57,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:57,341 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 7 treesize of output 6 [2023-08-24 12:47:57,384 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:47:57,384 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-24 12:47:57,402 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 13 treesize of output 15 [2023-08-24 12:47:57,440 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-24 12:47:57,440 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:47:57,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945787335] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:47:57,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:47:57,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-24 12:47:57,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234364940] [2023-08-24 12:47:57,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:47:57,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 12:47:57,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:57,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 12:47:57,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-24 12:47:57,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 480 [2023-08-24 12:47:57,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 176.5) internal successors, (1059), 6 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:57,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:57,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 480 [2023-08-24 12:47:57,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:58,758 INFO L124 PetriNetUnfolderBase]: 10756/17467 cut-off events. [2023-08-24 12:47:58,758 INFO L125 PetriNetUnfolderBase]: For 598/598 co-relation queries the response was YES. [2023-08-24 12:47:58,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34326 conditions, 17467 events. 10756/17467 cut-off events. For 598/598 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 122654 event pairs, 2066 based on Foata normal form. 0/15317 useless extension candidates. Maximal degree in co-relation 34290. Up to 12420 conditions per place. [2023-08-24 12:47:58,811 INFO L140 encePairwiseOnDemand]: 471/480 looper letters, 134 selfloop transitions, 14 changer transitions 9/169 dead transitions. [2023-08-24 12:47:58,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 169 transitions, 745 flow [2023-08-24 12:47:58,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:47:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:47:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1204 transitions. [2023-08-24 12:47:58,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41805555555555557 [2023-08-24 12:47:58,815 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1204 transitions. [2023-08-24 12:47:58,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1204 transitions. [2023-08-24 12:47:58,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:58,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1204 transitions. [2023-08-24 12:47:58,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 200.66666666666666) internal successors, (1204), 6 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:58,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 480.0) internal successors, (3360), 7 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:58,822 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 480.0) internal successors, (3360), 7 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:58,822 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1204 transitions. [2023-08-24 12:47:58,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 169 transitions, 745 flow [2023-08-24 12:47:58,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 169 transitions, 731 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 12:47:58,826 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 280 flow [2023-08-24 12:47:58,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=280, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2023-08-24 12:47:58,826 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-08-24 12:47:58,827 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 280 flow [2023-08-24 12:47:58,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 176.5) internal successors, (1059), 6 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:58,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:58,827 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:58,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-24 12:47:59,032 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,SelfDestructingSolverStorable12 [2023-08-24 12:47:59,033 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:47:59,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash 76949432, now seen corresponding path program 1 times [2023-08-24 12:47:59,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:59,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878097898] [2023-08-24 12:47:59,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:59,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:47:59,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:59,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878097898] [2023-08-24 12:47:59,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878097898] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:59,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497655608] [2023-08-24 12:47:59,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:59,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:59,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:59,187 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-24 12:47:59,190 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-24 12:47:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:59,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 12:47:59,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:47:59,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:47:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:47:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497655608] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:47:59,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:47:59,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-24 12:47:59,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130508777] [2023-08-24 12:47:59,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:47:59,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 12:47:59,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:59,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 12:47:59,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-24 12:47:59,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 480 [2023-08-24 12:47:59,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 280 flow. Second operand has 13 states, 13 states have (on average 210.69230769230768) internal successors, (2739), 13 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:59,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:59,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 480 [2023-08-24 12:47:59,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:48:00,480 INFO L124 PetriNetUnfolderBase]: 10260/16620 cut-off events. [2023-08-24 12:48:00,481 INFO L125 PetriNetUnfolderBase]: For 3438/3443 co-relation queries the response was YES. [2023-08-24 12:48:00,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35801 conditions, 16620 events. 10260/16620 cut-off events. For 3438/3443 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 114517 event pairs, 9037 based on Foata normal form. 6/15234 useless extension candidates. Maximal degree in co-relation 35743. Up to 15446 conditions per place. [2023-08-24 12:48:00,534 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 68 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2023-08-24 12:48:00,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 474 flow [2023-08-24 12:48:00,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 12:48:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 12:48:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2580 transitions. [2023-08-24 12:48:00,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2023-08-24 12:48:00,541 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2580 transitions. [2023-08-24 12:48:00,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2580 transitions. [2023-08-24 12:48:00,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:48:00,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2580 transitions. [2023-08-24 12:48:00,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 215.0) internal successors, (2580), 12 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:00,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 480.0) internal successors, (6240), 13 states have internal predecessors, (6240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:00,556 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 480.0) internal successors, (6240), 13 states have internal predecessors, (6240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:00,556 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 280 flow. Second operand 12 states and 2580 transitions. [2023-08-24 12:48:00,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 474 flow [2023-08-24 12:48:00,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:48:00,564 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 364 flow [2023-08-24 12:48:00,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=364, PETRI_PLACES=104, PETRI_TRANSITIONS=92} [2023-08-24 12:48:00,565 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 36 predicate places. [2023-08-24 12:48:00,565 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 364 flow [2023-08-24 12:48:00,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 210.69230769230768) internal successors, (2739), 13 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:00,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:48:00,566 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:48:00,574 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-24 12:48:00,771 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,SelfDestructingSolverStorable13 [2023-08-24 12:48:00,771 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:48:00,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:48:00,772 INFO L85 PathProgramCache]: Analyzing trace with hash -831759240, now seen corresponding path program 2 times [2023-08-24 12:48:00,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:48:00,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011380705] [2023-08-24 12:48:00,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:00,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:48:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:48:01,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:48:01,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011380705] [2023-08-24 12:48:01,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011380705] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:48:01,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681348950] [2023-08-24 12:48:01,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:48:01,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:48:01,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:48:01,646 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-24 12:48:01,649 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-24 12:48:01,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:48:01,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:48:01,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-24 12:48:01,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:48:01,767 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 7 treesize of output 6 [2023-08-24 12:48:01,831 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:48:01,832 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-24 12:48:01,848 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 13 treesize of output 15 [2023-08-24 12:48:01,868 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 13 treesize of output 15 [2023-08-24 12:48:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:48:01,913 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:48:08,003 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_397 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_397) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:48:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-24 12:48:08,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681348950] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:48:08,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:48:08,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2023-08-24 12:48:08,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952381497] [2023-08-24 12:48:08,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:48:08,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 12:48:08,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:48:08,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 12:48:08,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=132, Unknown=2, NotChecked=24, Total=210 [2023-08-24 12:48:08,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 480 [2023-08-24 12:48:08,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 364 flow. Second operand has 15 states, 15 states have (on average 152.4) internal successors, (2286), 15 states have internal predecessors, (2286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:08,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:48:08,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 480 [2023-08-24 12:48:08,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:48:32,152 WARN L234 SmtUtils]: Spent 24.04s on a formula simplification. DAG size of input: 31 DAG size of output: 22 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:48:34,168 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-24 12:48:36,169 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-24 12:48:38,177 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-24 12:48:40,232 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-24 12:48:42,241 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-24 12:48:44,250 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-24 12:48:46,143 INFO L124 PetriNetUnfolderBase]: 13798/21945 cut-off events. [2023-08-24 12:48:46,143 INFO L125 PetriNetUnfolderBase]: For 4314/4314 co-relation queries the response was YES. [2023-08-24 12:48:46,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47574 conditions, 21945 events. 13798/21945 cut-off events. For 4314/4314 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 151535 event pairs, 2507 based on Foata normal form. 0/20541 useless extension candidates. Maximal degree in co-relation 47491. Up to 14712 conditions per place. [2023-08-24 12:48:46,214 INFO L140 encePairwiseOnDemand]: 465/480 looper letters, 166 selfloop transitions, 26 changer transitions 26/227 dead transitions. [2023-08-24 12:48:46,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 227 transitions, 1159 flow [2023-08-24 12:48:46,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 12:48:46,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 12:48:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1402 transitions. [2023-08-24 12:48:46,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3651041666666667 [2023-08-24 12:48:46,219 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1402 transitions. [2023-08-24 12:48:46,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1402 transitions. [2023-08-24 12:48:46,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:48:46,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1402 transitions. [2023-08-24 12:48:46,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 175.25) internal successors, (1402), 8 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:46,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 480.0) internal successors, (4320), 9 states have internal predecessors, (4320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:46,226 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 480.0) internal successors, (4320), 9 states have internal predecessors, (4320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:46,226 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 364 flow. Second operand 8 states and 1402 transitions. [2023-08-24 12:48:46,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 227 transitions, 1159 flow [2023-08-24 12:48:46,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 227 transitions, 1111 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-24 12:48:46,238 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 487 flow [2023-08-24 12:48:46,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=487, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2023-08-24 12:48:46,238 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 43 predicate places. [2023-08-24 12:48:46,238 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 487 flow [2023-08-24 12:48:46,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 152.4) internal successors, (2286), 15 states have internal predecessors, (2286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:46,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:48:46,239 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:48:46,247 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-24 12:48:46,444 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,SelfDestructingSolverStorable14 [2023-08-24 12:48:46,445 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:48:46,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:48:46,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1298247569, now seen corresponding path program 1 times [2023-08-24 12:48:46,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:48:46,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075650327] [2023-08-24 12:48:46,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:46,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:48:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:48:46,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:48:46,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075650327] [2023-08-24 12:48:46,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075650327] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:48:46,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852411001] [2023-08-24 12:48:46,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:46,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:48:46,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:48:46,505 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-24 12:48:46,509 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-24 12:48:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:46,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 12:48:46,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:48:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:48:46,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:48:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:48:46,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852411001] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:48:46,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:48:46,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-24 12:48:46,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317296895] [2023-08-24 12:48:46,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:48:46,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:48:46,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:48:46,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:48:46,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-24 12:48:46,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 480 [2023-08-24 12:48:46,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 487 flow. Second operand has 7 states, 7 states have (on average 212.57142857142858) internal successors, (1488), 7 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:46,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:48:46,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 480 [2023-08-24 12:48:46,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:48:46,960 INFO L124 PetriNetUnfolderBase]: 1246/2346 cut-off events. [2023-08-24 12:48:46,960 INFO L125 PetriNetUnfolderBase]: For 1867/1867 co-relation queries the response was YES. [2023-08-24 12:48:46,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6006 conditions, 2346 events. 1246/2346 cut-off events. For 1867/1867 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 14200 event pairs, 238 based on Foata normal form. 277/2525 useless extension candidates. Maximal degree in co-relation 5941. Up to 1474 conditions per place. [2023-08-24 12:48:46,967 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 89 selfloop transitions, 3 changer transitions 18/119 dead transitions. [2023-08-24 12:48:46,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 119 transitions, 703 flow [2023-08-24 12:48:46,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 12:48:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 12:48:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1129 transitions. [2023-08-24 12:48:46,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47041666666666665 [2023-08-24 12:48:46,969 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1129 transitions. [2023-08-24 12:48:46,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1129 transitions. [2023-08-24 12:48:46,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:48:46,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1129 transitions. [2023-08-24 12:48:46,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 225.8) internal successors, (1129), 5 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:46,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 480.0) internal successors, (2880), 6 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:46,974 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 480.0) internal successors, (2880), 6 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:46,974 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 487 flow. Second operand 5 states and 1129 transitions. [2023-08-24 12:48:46,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 119 transitions, 703 flow [2023-08-24 12:48:46,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 119 transitions, 682 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-24 12:48:46,980 INFO L231 Difference]: Finished difference. Result has 87 places, 58 transitions, 252 flow [2023-08-24 12:48:46,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=87, PETRI_TRANSITIONS=58} [2023-08-24 12:48:46,980 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-08-24 12:48:46,980 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 58 transitions, 252 flow [2023-08-24 12:48:46,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.57142857142858) internal successors, (1488), 7 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:46,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:48:46,981 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:48:46,989 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-24 12:48:47,186 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,SelfDestructingSolverStorable15 [2023-08-24 12:48:47,186 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:48:47,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:48:47,186 INFO L85 PathProgramCache]: Analyzing trace with hash -869509723, now seen corresponding path program 1 times [2023-08-24 12:48:47,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:48:47,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387006623] [2023-08-24 12:48:47,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:47,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:48:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:48:47,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:48:47,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387006623] [2023-08-24 12:48:47,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387006623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:48:47,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:48:47,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 12:48:47,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646406813] [2023-08-24 12:48:47,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:48:47,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 12:48:47,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:48:47,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 12:48:47,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 12:48:47,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 480 [2023-08-24 12:48:47,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 58 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 180.4) internal successors, (902), 5 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:47,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:48:47,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 480 [2023-08-24 12:48:47,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:48:47,502 INFO L124 PetriNetUnfolderBase]: 513/1008 cut-off events. [2023-08-24 12:48:47,503 INFO L125 PetriNetUnfolderBase]: For 1028/1028 co-relation queries the response was YES. [2023-08-24 12:48:47,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2754 conditions, 1008 events. 513/1008 cut-off events. For 1028/1028 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5135 event pairs, 163 based on Foata normal form. 108/1028 useless extension candidates. Maximal degree in co-relation 2693. Up to 568 conditions per place. [2023-08-24 12:48:47,507 INFO L140 encePairwiseOnDemand]: 467/480 looper letters, 53 selfloop transitions, 13 changer transitions 4/76 dead transitions. [2023-08-24 12:48:47,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 76 transitions, 461 flow [2023-08-24 12:48:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 12:48:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 12:48:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 764 transitions. [2023-08-24 12:48:47,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39791666666666664 [2023-08-24 12:48:47,510 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 764 transitions. [2023-08-24 12:48:47,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 764 transitions. [2023-08-24 12:48:47,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:48:47,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 764 transitions. [2023-08-24 12:48:47,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:47,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 480.0) internal successors, (2400), 5 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:47,515 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 480.0) internal successors, (2400), 5 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:47,515 INFO L175 Difference]: Start difference. First operand has 87 places, 58 transitions, 252 flow. Second operand 4 states and 764 transitions. [2023-08-24 12:48:47,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 76 transitions, 461 flow [2023-08-24 12:48:47,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 76 transitions, 445 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-24 12:48:47,518 INFO L231 Difference]: Finished difference. Result has 84 places, 60 transitions, 286 flow [2023-08-24 12:48:47,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=84, PETRI_TRANSITIONS=60} [2023-08-24 12:48:47,519 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 16 predicate places. [2023-08-24 12:48:47,519 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 60 transitions, 286 flow [2023-08-24 12:48:47,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 180.4) internal successors, (902), 5 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:47,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:48:47,519 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:48:47,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-24 12:48:47,519 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:48:47,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:48:47,520 INFO L85 PathProgramCache]: Analyzing trace with hash -781237080, now seen corresponding path program 1 times [2023-08-24 12:48:47,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:48:47,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482762798] [2023-08-24 12:48:47,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:47,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:48:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:48:48,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:48:48,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482762798] [2023-08-24 12:48:48,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482762798] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:48:48,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500841182] [2023-08-24 12:48:48,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:48,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:48:48,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:48:48,085 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-24 12:48:48,088 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-24 12:48:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:48,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-24 12:48:48,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:48:48,214 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 7 treesize of output 6 [2023-08-24 12:48:48,272 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:48:48,273 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-24 12:48:48,288 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 13 treesize of output 15 [2023-08-24 12:48:48,324 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 13 treesize of output 15 [2023-08-24 12:48:48,343 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 13 treesize of output 9 [2023-08-24 12:48:48,392 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:48:48,393 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 19 treesize of output 11 [2023-08-24 12:48:48,433 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-24 12:48:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:48:48,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:48:48,559 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-24 12:48:48,564 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-24 12:48:56,606 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_65| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_61| Int) (v_ArrVal_585 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_61| |v_t_funThread2of2ForFork0_~p~0#1.offset_65|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_585) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_61| v_ArrVal_588) |v_t_funThread2of2ForFork0_~p~0#1.offset_65|) 0))) is different from false [2023-08-24 12:48:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-24 12:48:56,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500841182] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:48:56,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:48:56,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-08-24 12:48:56,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836519276] [2023-08-24 12:48:56,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:48:56,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-24 12:48:56,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:48:56,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-24 12:48:56,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=4, NotChecked=34, Total=380 [2023-08-24 12:48:56,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 480 [2023-08-24 12:48:56,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 60 transitions, 286 flow. Second operand has 20 states, 20 states have (on average 156.65) internal successors, (3133), 20 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:48:56,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:48:56,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 480 [2023-08-24 12:48:56,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:49:06,830 WARN L234 SmtUtils]: Spent 10.05s on a formula simplification. DAG size of input: 34 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:49:08,832 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-24 12:49:10,836 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-24 12:49:13,216 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-24 12:49:15,220 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-24 12:49:29,423 WARN L234 SmtUtils]: Spent 14.02s on a formula simplification. DAG size of input: 30 DAG size of output: 21 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:49:31,425 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-24 12:49:33,428 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-24 12:49:35,433 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 [0, 1] [2023-08-24 12:49:37,448 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-24 12:49:39,451 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-24 12:49:41,455 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-24 12:49:43,469 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-24 12:49:45,474 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-24 12:49:47,476 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-24 12:49:49,569 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-24 12:49:51,578 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-24 12:49:54,393 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-24 12:49:56,403 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-24 12:49:58,404 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-24 12:50:01,057 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-24 12:50:03,074 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-24 12:50:03,767 INFO L124 PetriNetUnfolderBase]: 852/1703 cut-off events. [2023-08-24 12:50:03,767 INFO L125 PetriNetUnfolderBase]: For 1303/1309 co-relation queries the response was YES. [2023-08-24 12:50:03,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4775 conditions, 1703 events. 852/1703 cut-off events. For 1303/1309 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10327 event pairs, 91 based on Foata normal form. 24/1553 useless extension candidates. Maximal degree in co-relation 4714. Up to 697 conditions per place. [2023-08-24 12:50:03,773 INFO L140 encePairwiseOnDemand]: 469/480 looper letters, 104 selfloop transitions, 26 changer transitions 24/160 dead transitions. [2023-08-24 12:50:03,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 160 transitions, 973 flow [2023-08-24 12:50:03,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-24 12:50:03,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-24 12:50:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2604 transitions. [2023-08-24 12:50:03,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3390625 [2023-08-24 12:50:03,777 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2604 transitions. [2023-08-24 12:50:03,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2604 transitions. [2023-08-24 12:50:03,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:50:03,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2604 transitions. [2023-08-24 12:50:03,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 162.75) internal successors, (2604), 16 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:03,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 480.0) internal successors, (8160), 17 states have internal predecessors, (8160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:03,787 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 480.0) internal successors, (8160), 17 states have internal predecessors, (8160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:03,787 INFO L175 Difference]: Start difference. First operand has 84 places, 60 transitions, 286 flow. Second operand 16 states and 2604 transitions. [2023-08-24 12:50:03,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 160 transitions, 973 flow [2023-08-24 12:50:03,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 160 transitions, 972 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 12:50:03,793 INFO L231 Difference]: Finished difference. Result has 105 places, 76 transitions, 462 flow [2023-08-24 12:50:03,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=462, PETRI_PLACES=105, PETRI_TRANSITIONS=76} [2023-08-24 12:50:03,793 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 37 predicate places. [2023-08-24 12:50:03,793 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 76 transitions, 462 flow [2023-08-24 12:50:03,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 156.65) internal successors, (3133), 20 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:03,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:50:03,794 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:50:03,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-24 12:50:04,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-24 12:50:04,000 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:50:04,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:50:04,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1329977314, now seen corresponding path program 2 times [2023-08-24 12:50:04,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:50:04,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346625584] [2023-08-24 12:50:04,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:50:04,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:50:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:50:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:50:07,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:50:07,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346625584] [2023-08-24 12:50:07,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346625584] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:50:07,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436948573] [2023-08-24 12:50:07,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:50:07,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:50:07,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:50:07,761 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-24 12:50:07,765 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-24 12:50:07,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:50:07,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:50:07,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-24 12:50:07,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:50:07,952 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 7 treesize of output 6 [2023-08-24 12:50:08,057 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:08,058 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-24 12:50:08,099 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 13 treesize of output 15 [2023-08-24 12:50:08,117 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 13 treesize of output 9 [2023-08-24 12:50:08,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:50:08,178 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-24 12:50:08,226 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 13 treesize of output 15 [2023-08-24 12:50:08,282 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-24 12:50:08,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:50:08,332 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-24 12:50:08,390 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:08,390 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 19 treesize of output 11 [2023-08-24 12:50:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:50:08,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:50:08,508 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_67| Int) (v_ArrVal_676 (Array Int Int))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_67|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_676) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_67|)) 0)))) is different from false [2023-08-24 12:50:08,517 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_67| Int) (v_ArrVal_676 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_674)) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_67|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_676) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_67|)) 0)))) is different from false [2023-08-24 12:50:08,537 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_67| Int) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_673))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_674))) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_67|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_676) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_67|)) 0)))) is different from false [2023-08-24 12:50:08,577 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:50:08,578 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 23 treesize of output 24 [2023-08-24 12:50:08,590 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:50:08,591 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-24 12:50:08,596 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 22 treesize of output 18 [2023-08-24 12:50:08,618 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_674 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_67| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_63| Int) (v_ArrVal_673 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_673) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_63| v_ArrVal_674) |v_t_funThread2of2ForFork0_~p~0#1.offset_67|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_63| |v_t_funThread2of2ForFork0_~p~0#1.offset_67|))) (or (forall ((v_ArrVal_674 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_67| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_63| Int) (v_ArrVal_673 (Array Int Int))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_673) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_63| v_ArrVal_674) |v_t_funThread2of2ForFork0_~p~0#1.offset_67|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-24 12:50:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-24 12:50:10,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436948573] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:50:10,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:50:10,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 31 [2023-08-24 12:50:10,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498369965] [2023-08-24 12:50:10,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:50:10,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 12:50:10,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:50:10,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 12:50:10,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=664, Unknown=4, NotChecked=228, Total=1056 [2023-08-24 12:50:10,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 480 [2023-08-24 12:50:10,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 76 transitions, 462 flow. Second operand has 33 states, 33 states have (on average 149.87878787878788) internal successors, (4946), 33 states have internal predecessors, (4946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:10,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:50:10,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 480 [2023-08-24 12:50:10,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:50:12,212 INFO L124 PetriNetUnfolderBase]: 956/1917 cut-off events. [2023-08-24 12:50:12,212 INFO L125 PetriNetUnfolderBase]: For 8760/8766 co-relation queries the response was YES. [2023-08-24 12:50:12,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7165 conditions, 1917 events. 956/1917 cut-off events. For 8760/8766 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11982 event pairs, 85 based on Foata normal form. 3/1728 useless extension candidates. Maximal degree in co-relation 7096. Up to 911 conditions per place. [2023-08-24 12:50:12,219 INFO L140 encePairwiseOnDemand]: 470/480 looper letters, 75 selfloop transitions, 35 changer transitions 16/132 dead transitions. [2023-08-24 12:50:12,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 132 transitions, 1021 flow [2023-08-24 12:50:12,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-24 12:50:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-24 12:50:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2919 transitions. [2023-08-24 12:50:12,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3200657894736842 [2023-08-24 12:50:12,223 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2919 transitions. [2023-08-24 12:50:12,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2919 transitions. [2023-08-24 12:50:12,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:50:12,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2919 transitions. [2023-08-24 12:50:12,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 153.6315789473684) internal successors, (2919), 19 states have internal predecessors, (2919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:12,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 480.0) internal successors, (9600), 20 states have internal predecessors, (9600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:12,234 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 480.0) internal successors, (9600), 20 states have internal predecessors, (9600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:12,235 INFO L175 Difference]: Start difference. First operand has 105 places, 76 transitions, 462 flow. Second operand 19 states and 2919 transitions. [2023-08-24 12:50:12,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 132 transitions, 1021 flow [2023-08-24 12:50:12,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 132 transitions, 971 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-08-24 12:50:12,248 INFO L231 Difference]: Finished difference. Result has 119 places, 82 transitions, 572 flow [2023-08-24 12:50:12,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=572, PETRI_PLACES=119, PETRI_TRANSITIONS=82} [2023-08-24 12:50:12,249 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 51 predicate places. [2023-08-24 12:50:12,249 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 82 transitions, 572 flow [2023-08-24 12:50:12,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 149.87878787878788) internal successors, (4946), 33 states have internal predecessors, (4946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:12,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:50:12,250 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:50:12,256 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-24 12:50:12,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:50:12,456 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:50:12,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:50:12,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1877786730, now seen corresponding path program 3 times [2023-08-24 12:50:12,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:50:12,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917176261] [2023-08-24 12:50:12,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:50:12,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:50:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:50:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:50:18,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:50:18,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917176261] [2023-08-24 12:50:18,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917176261] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:50:18,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115346231] [2023-08-24 12:50:18,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 12:50:18,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:50:18,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:50:18,498 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-24 12:50:18,501 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-24 12:50:18,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 12:50:18,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:50:18,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-24 12:50:18,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:50:18,638 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 7 treesize of output 6 [2023-08-24 12:50:18,732 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:18,732 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-24 12:50:18,772 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 13 treesize of output 15 [2023-08-24 12:50:18,808 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 13 treesize of output 9 [2023-08-24 12:50:18,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:50:18,876 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-24 12:50:18,899 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-24 12:50:18,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:50:18,953 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-24 12:50:19,005 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-24 12:50:19,068 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:19,069 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 19 treesize of output 11 [2023-08-24 12:50:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:50:19,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:50:19,299 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_761 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (or (= 0 (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_763) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|)) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_762) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_69|)) 0)))) is different from false [2023-08-24 12:50:19,330 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:50:19,331 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 23 treesize of output 24 [2023-08-24 12:50:19,339 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:50:19,339 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-24 12:50:19,344 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 22 treesize of output 18 [2023-08-24 12:50:19,467 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_761 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_65| Int) (v_ArrVal_763 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_65| v_ArrVal_761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_763) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_65| |v_t_funThread2of2ForFork0_~p~0#1.offset_69|))) (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_761 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_65| Int) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_65| v_ArrVal_761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_763) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-08-24 12:50:19,519 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_761 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_65| Int) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_756))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_65| v_ArrVal_761))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_763) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_761 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_65| Int) (v_ArrVal_763 (Array Int Int))) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_756))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_65| v_ArrVal_761))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_763) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_65| |v_t_funThread2of2ForFork0_~p~0#1.offset_69|)))) is different from false [2023-08-24 12:50:27,618 WARN L234 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:50:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-24 12:50:27,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115346231] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:50:27,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:50:27,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 8] total 31 [2023-08-24 12:50:27,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798855632] [2023-08-24 12:50:27,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:50:27,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 12:50:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:50:27,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 12:50:27,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=721, Unknown=4, NotChecked=174, Total=1056 [2023-08-24 12:50:27,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 480 [2023-08-24 12:50:27,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 82 transitions, 572 flow. Second operand has 33 states, 33 states have (on average 149.8181818181818) internal successors, (4944), 33 states have internal predecessors, (4944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:27,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:50:27,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 480 [2023-08-24 12:50:27,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:50:29,013 INFO L124 PetriNetUnfolderBase]: 962/1931 cut-off events. [2023-08-24 12:50:29,013 INFO L125 PetriNetUnfolderBase]: For 12088/12094 co-relation queries the response was YES. [2023-08-24 12:50:29,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7809 conditions, 1931 events. 962/1931 cut-off events. For 12088/12094 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12300 event pairs, 77 based on Foata normal form. 3/1744 useless extension candidates. Maximal degree in co-relation 7727. Up to 717 conditions per place. [2023-08-24 12:50:29,020 INFO L140 encePairwiseOnDemand]: 471/480 looper letters, 81 selfloop transitions, 31 changer transitions 17/135 dead transitions. [2023-08-24 12:50:29,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 135 transitions, 1154 flow [2023-08-24 12:50:29,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-24 12:50:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-24 12:50:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2915 transitions. [2023-08-24 12:50:29,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3196271929824561 [2023-08-24 12:50:29,024 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2915 transitions. [2023-08-24 12:50:29,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2915 transitions. [2023-08-24 12:50:29,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:50:29,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2915 transitions. [2023-08-24 12:50:29,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 153.42105263157896) internal successors, (2915), 19 states have internal predecessors, (2915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:29,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 480.0) internal successors, (9600), 20 states have internal predecessors, (9600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:29,031 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 480.0) internal successors, (9600), 20 states have internal predecessors, (9600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:29,031 INFO L175 Difference]: Start difference. First operand has 119 places, 82 transitions, 572 flow. Second operand 19 states and 2915 transitions. [2023-08-24 12:50:29,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 135 transitions, 1154 flow [2023-08-24 12:50:29,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 135 transitions, 1053 flow, removed 23 selfloop flow, removed 23 redundant places. [2023-08-24 12:50:29,044 INFO L231 Difference]: Finished difference. Result has 116 places, 84 transitions, 567 flow [2023-08-24 12:50:29,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=567, PETRI_PLACES=116, PETRI_TRANSITIONS=84} [2023-08-24 12:50:29,045 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 48 predicate places. [2023-08-24 12:50:29,045 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 84 transitions, 567 flow [2023-08-24 12:50:29,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 149.8181818181818) internal successors, (4944), 33 states have internal predecessors, (4944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:29,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:50:29,046 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:50:29,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-24 12:50:29,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:50:29,246 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:50:29,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:50:29,247 INFO L85 PathProgramCache]: Analyzing trace with hash -803627067, now seen corresponding path program 1 times [2023-08-24 12:50:29,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:50:29,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438475220] [2023-08-24 12:50:29,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:50:29,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:50:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:50:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:50:29,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:50:29,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438475220] [2023-08-24 12:50:29,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438475220] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:50:29,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138230318] [2023-08-24 12:50:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:50:29,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:50:29,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:50:29,637 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:50:29,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-24 12:50:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:50:29,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-24 12:50:29,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:50:29,784 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 7 treesize of output 6 [2023-08-24 12:50:29,843 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:29,844 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-24 12:50:29,874 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 13 treesize of output 15 [2023-08-24 12:50:29,895 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 13 treesize of output 15 [2023-08-24 12:50:29,912 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 13 treesize of output 9 [2023-08-24 12:50:29,964 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:29,964 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 19 treesize of output 11 [2023-08-24 12:50:30,024 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-24 12:50:30,062 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:50:30,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:50:30,146 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-24 12:50:30,155 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-24 12:50:42,207 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_67| Int) (v_ArrVal_844 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_71| Int) (v_ArrVal_848 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_67| |v_t_funThread2of2ForFork0_~p~0#1.offset_71|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_844) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_71| v_ArrVal_848) |v_t_funThread1of2ForFork0_~p~0#1.offset_67|) 0))) is different from false [2023-08-24 12:50:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-24 12:50:42,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138230318] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:50:42,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:50:42,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-08-24 12:50:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803969735] [2023-08-24 12:50:42,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:50:42,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-24 12:50:42,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:50:42,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-24 12:50:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=4, NotChecked=34, Total=380 [2023-08-24 12:50:42,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 480 [2023-08-24 12:50:42,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 84 transitions, 567 flow. Second operand has 20 states, 20 states have (on average 156.65) internal successors, (3133), 20 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:42,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:50:42,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 480 [2023-08-24 12:50:42,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:50:42,947 INFO L124 PetriNetUnfolderBase]: 1064/2141 cut-off events. [2023-08-24 12:50:42,947 INFO L125 PetriNetUnfolderBase]: For 13354/13360 co-relation queries the response was YES. [2023-08-24 12:50:42,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8683 conditions, 2141 events. 1064/2141 cut-off events. For 13354/13360 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14091 event pairs, 161 based on Foata normal form. 12/1942 useless extension candidates. Maximal degree in co-relation 8615. Up to 1306 conditions per place. [2023-08-24 12:50:42,955 INFO L140 encePairwiseOnDemand]: 470/480 looper letters, 101 selfloop transitions, 17 changer transitions 19/143 dead transitions. [2023-08-24 12:50:42,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 143 transitions, 1158 flow [2023-08-24 12:50:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 12:50:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 12:50:42,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1486 transitions. [2023-08-24 12:50:42,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3439814814814815 [2023-08-24 12:50:42,957 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1486 transitions. [2023-08-24 12:50:42,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1486 transitions. [2023-08-24 12:50:42,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:50:42,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1486 transitions. [2023-08-24 12:50:42,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 165.11111111111111) internal successors, (1486), 9 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:42,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 480.0) internal successors, (4800), 10 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:42,961 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 480.0) internal successors, (4800), 10 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:42,961 INFO L175 Difference]: Start difference. First operand has 116 places, 84 transitions, 567 flow. Second operand 9 states and 1486 transitions. [2023-08-24 12:50:42,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 143 transitions, 1158 flow [2023-08-24 12:50:42,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 143 transitions, 1060 flow, removed 25 selfloop flow, removed 16 redundant places. [2023-08-24 12:50:42,973 INFO L231 Difference]: Finished difference. Result has 111 places, 89 transitions, 616 flow [2023-08-24 12:50:42,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=616, PETRI_PLACES=111, PETRI_TRANSITIONS=89} [2023-08-24 12:50:42,974 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 43 predicate places. [2023-08-24 12:50:42,974 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 89 transitions, 616 flow [2023-08-24 12:50:42,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 156.65) internal successors, (3133), 20 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:42,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:50:42,974 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:50:42,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-24 12:50:43,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:50:43,175 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:50:43,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:50:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash -373675912, now seen corresponding path program 4 times [2023-08-24 12:50:43,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:50:43,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692941871] [2023-08-24 12:50:43,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:50:43,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:50:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:50:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:50:43,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:50:43,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692941871] [2023-08-24 12:50:43,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692941871] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:50:43,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090677700] [2023-08-24 12:50:43,569 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 12:50:43,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:50:43,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:50:43,573 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:50:43,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-24 12:50:43,716 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 12:50:43,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:50:43,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-24 12:50:43,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:50:43,725 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 7 treesize of output 6 [2023-08-24 12:50:43,788 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:43,788 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-24 12:50:43,807 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 13 treesize of output 15 [2023-08-24 12:50:43,878 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 13 treesize of output 15 [2023-08-24 12:50:43,901 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 13 treesize of output 9 [2023-08-24 12:50:43,946 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:43,947 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 19 treesize of output 11 [2023-08-24 12:50:44,003 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-24 12:50:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:50:44,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:50:44,114 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-24 12:50:44,118 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-24 12:50:52,281 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_69| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_929 (Array Int Int)) (v_ArrVal_933 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_929) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_69| v_ArrVal_933) |v_t_funThread2of2ForFork0_~p~0#1.offset_73|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_69| |v_t_funThread2of2ForFork0_~p~0#1.offset_73|))) is different from false [2023-08-24 12:50:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-24 12:50:52,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090677700] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:50:52,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:50:52,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 19 [2023-08-24 12:50:52,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546672738] [2023-08-24 12:50:52,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:50:52,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-24 12:50:52,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:50:52,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-24 12:50:52,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=4, NotChecked=36, Total=420 [2023-08-24 12:50:52,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 480 [2023-08-24 12:50:52,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 89 transitions, 616 flow. Second operand has 21 states, 21 states have (on average 154.52380952380952) internal successors, (3245), 21 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:52,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:50:52,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 480 [2023-08-24 12:50:52,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:50:53,246 INFO L124 PetriNetUnfolderBase]: 1110/2246 cut-off events. [2023-08-24 12:50:53,247 INFO L125 PetriNetUnfolderBase]: For 13619/13631 co-relation queries the response was YES. [2023-08-24 12:50:53,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9070 conditions, 2246 events. 1110/2246 cut-off events. For 13619/13631 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14895 event pairs, 164 based on Foata normal form. 12/2037 useless extension candidates. Maximal degree in co-relation 9009. Up to 1403 conditions per place. [2023-08-24 12:50:53,254 INFO L140 encePairwiseOnDemand]: 469/480 looper letters, 108 selfloop transitions, 17 changer transitions 20/151 dead transitions. [2023-08-24 12:50:53,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 151 transitions, 1238 flow [2023-08-24 12:50:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 12:50:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 12:50:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1623 transitions. [2023-08-24 12:50:53,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.338125 [2023-08-24 12:50:53,256 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1623 transitions. [2023-08-24 12:50:53,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1623 transitions. [2023-08-24 12:50:53,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:50:53,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1623 transitions. [2023-08-24 12:50:53,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 162.3) internal successors, (1623), 10 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:53,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 480.0) internal successors, (5280), 11 states have internal predecessors, (5280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:53,260 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 480.0) internal successors, (5280), 11 states have internal predecessors, (5280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:53,261 INFO L175 Difference]: Start difference. First operand has 111 places, 89 transitions, 616 flow. Second operand 10 states and 1623 transitions. [2023-08-24 12:50:53,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 151 transitions, 1238 flow [2023-08-24 12:50:53,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 151 transitions, 1146 flow, removed 33 selfloop flow, removed 6 redundant places. [2023-08-24 12:50:53,275 INFO L231 Difference]: Finished difference. Result has 118 places, 95 transitions, 657 flow [2023-08-24 12:50:53,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=657, PETRI_PLACES=118, PETRI_TRANSITIONS=95} [2023-08-24 12:50:53,275 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 50 predicate places. [2023-08-24 12:50:53,275 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 95 transitions, 657 flow [2023-08-24 12:50:53,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 154.52380952380952) internal successors, (3245), 21 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:53,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:50:53,276 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:50:53,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-24 12:50:53,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:50:53,477 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:50:53,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:50:53,477 INFO L85 PathProgramCache]: Analyzing trace with hash 875176261, now seen corresponding path program 2 times [2023-08-24 12:50:53,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:50:53,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374884786] [2023-08-24 12:50:53,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:50:53,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:50:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:50:56,083 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 12:50:56,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:50:56,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374884786] [2023-08-24 12:50:56,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374884786] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:50:56,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471987401] [2023-08-24 12:50:56,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:50:56,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:50:56,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:50:56,085 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:50:56,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-24 12:50:56,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:50:56,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:50:56,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-24 12:50:56,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:50:56,232 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 7 treesize of output 6 [2023-08-24 12:50:56,343 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:56,343 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-24 12:50:56,378 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 13 treesize of output 15 [2023-08-24 12:50:56,405 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 13 treesize of output 15 [2023-08-24 12:50:56,443 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 13 treesize of output 9 [2023-08-24 12:50:56,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:50:56,507 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-24 12:50:56,562 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:56,562 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 19 treesize of output 11 [2023-08-24 12:50:56,618 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-24 12:50:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:50:56,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:50:56,848 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:50:56,849 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 23 treesize of output 24 [2023-08-24 12:50:56,858 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:50:56,858 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-24 12:50:56,862 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 22 treesize of output 18 [2023-08-24 12:51:13,022 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1014 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int) (v_ArrVal_1019 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1014) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_75| v_ArrVal_1019) |v_t_funThread1of2ForFork0_~p~0#1.offset_71|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_71| |v_t_funThread2of2ForFork0_~p~0#1.offset_75|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-24 12:51:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-24 12:51:15,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471987401] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:51:15,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:51:15,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7, 7] total 29 [2023-08-24 12:51:15,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215497351] [2023-08-24 12:51:15,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:51:15,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-24 12:51:15,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:51:15,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-24 12:51:15,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=739, Unknown=5, NotChecked=56, Total=930 [2023-08-24 12:51:15,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 480 [2023-08-24 12:51:15,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 95 transitions, 657 flow. Second operand has 31 states, 31 states have (on average 149.93548387096774) internal successors, (4648), 31 states have internal predecessors, (4648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:15,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:51:15,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 480 [2023-08-24 12:51:15,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:51:18,928 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-24 12:51:20,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:22,993 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-24 12:51:25,220 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-24 12:51:26,307 INFO L124 PetriNetUnfolderBase]: 1315/2707 cut-off events. [2023-08-24 12:51:26,308 INFO L125 PetriNetUnfolderBase]: For 16085/16091 co-relation queries the response was YES. [2023-08-24 12:51:26,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10786 conditions, 2707 events. 1315/2707 cut-off events. For 16085/16091 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 19169 event pairs, 206 based on Foata normal form. 27/2468 useless extension candidates. Maximal degree in co-relation 10722. Up to 1429 conditions per place. [2023-08-24 12:51:26,320 INFO L140 encePairwiseOnDemand]: 466/480 looper letters, 127 selfloop transitions, 46 changer transitions 32/211 dead transitions. [2023-08-24 12:51:26,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 211 transitions, 1741 flow [2023-08-24 12:51:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-24 12:51:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-24 12:51:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4017 transitions. [2023-08-24 12:51:26,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.321875 [2023-08-24 12:51:26,324 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4017 transitions. [2023-08-24 12:51:26,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4017 transitions. [2023-08-24 12:51:26,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:51:26,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4017 transitions. [2023-08-24 12:51:26,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 154.5) internal successors, (4017), 26 states have internal predecessors, (4017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:26,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 480.0) internal successors, (12960), 27 states have internal predecessors, (12960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:26,339 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 480.0) internal successors, (12960), 27 states have internal predecessors, (12960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:26,339 INFO L175 Difference]: Start difference. First operand has 118 places, 95 transitions, 657 flow. Second operand 26 states and 4017 transitions. [2023-08-24 12:51:26,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 211 transitions, 1741 flow [2023-08-24 12:51:26,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 211 transitions, 1691 flow, removed 13 selfloop flow, removed 5 redundant places. [2023-08-24 12:51:26,371 INFO L231 Difference]: Finished difference. Result has 145 places, 120 transitions, 1077 flow [2023-08-24 12:51:26,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1077, PETRI_PLACES=145, PETRI_TRANSITIONS=120} [2023-08-24 12:51:26,371 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 77 predicate places. [2023-08-24 12:51:26,371 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 120 transitions, 1077 flow [2023-08-24 12:51:26,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 149.93548387096774) internal successors, (4648), 31 states have internal predecessors, (4648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:26,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:51:26,372 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:51:26,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-24 12:51:26,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:51:26,579 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:51:26,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:51:26,579 INFO L85 PathProgramCache]: Analyzing trace with hash -380956410, now seen corresponding path program 5 times [2023-08-24 12:51:26,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:51:26,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650370305] [2023-08-24 12:51:26,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:51:26,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:51:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:51:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:51:26,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:51:26,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650370305] [2023-08-24 12:51:26,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650370305] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:51:26,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219723368] [2023-08-24 12:51:26,909 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 12:51:26,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:51:26,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:51:26,911 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:51:26,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-24 12:51:27,182 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-24 12:51:27,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:51:27,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-24 12:51:27,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:51:27,190 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 7 treesize of output 6 [2023-08-24 12:51:27,266 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:51:27,266 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 12:51:27,285 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 13 treesize of output 15 [2023-08-24 12:51:27,310 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 13 treesize of output 15 [2023-08-24 12:51:27,323 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 13 treesize of output 9 [2023-08-24 12:51:27,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:51:27,372 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-24 12:51:27,432 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:51:27,432 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 19 treesize of output 11 [2023-08-24 12:51:27,459 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-24 12:51:27,488 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-24 12:51:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:51:27,517 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:51:27,526 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1110 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1110) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:51:27,648 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:51:27,648 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 23 treesize of output 24 [2023-08-24 12:51:27,657 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:51:27,657 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-24 12:51:27,661 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-24 12:51:27,689 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_1110 (Array Int Int)) (v_ArrVal_1108 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_73| |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1108)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1110) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) 0))) (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_1110 (Array Int Int)) (v_ArrVal_1108 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1108)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1110) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-08-24 12:51:27,722 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1104 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_1110 (Array Int Int)) (v_ArrVal_1108 Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1104))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1108))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1110) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1104 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_1110 (Array Int Int)) (v_ArrVal_1108 Int)) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1104))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1108))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1110) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_73| |v_t_funThread2of2ForFork0_~p~0#1.offset_77|)))) is different from false [2023-08-24 12:51:35,832 WARN L234 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:51:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-24 12:51:36,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219723368] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:51:36,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:51:36,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 20 [2023-08-24 12:51:36,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809021980] [2023-08-24 12:51:36,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:51:36,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 12:51:36,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:51:36,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 12:51:36,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=275, Unknown=9, NotChecked=108, Total=462 [2023-08-24 12:51:36,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 480 [2023-08-24 12:51:36,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 120 transitions, 1077 flow. Second operand has 22 states, 22 states have (on average 156.5) internal successors, (3443), 22 states have internal predecessors, (3443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:36,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:51:36,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 480 [2023-08-24 12:51:36,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:51:36,390 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (= (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1110 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1110) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (exists ((|t_funThread1of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1108 Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1108) (select |c_#memory_int| 4)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |t_funThread1of2ForFork0_~p~0#1.offset|)))) (= |c_t_funThread2of2ForFork0_~p~0#1.base| 4) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_ArrVal_1108 Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1107) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_77|)) 0)) (= 0 (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1108)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1110) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|)))) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1110 (Array Int Int)) (v_ArrVal_1108 Int)) (or (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_77|)) 0)) (= 0 (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1108)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1110) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|)))))) is different from false [2023-08-24 12:51:36,469 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_ArrVal_1108 Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1107) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_77|)) 0)) (= 0 (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1108)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1110) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|)))) (forall ((v_ArrVal_1110 (Array Int Int)) (v_ArrVal_1108 Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1108)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1110) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)))) is different from false [2023-08-24 12:51:37,000 INFO L124 PetriNetUnfolderBase]: 1368/2938 cut-off events. [2023-08-24 12:51:37,000 INFO L125 PetriNetUnfolderBase]: For 14976/14996 co-relation queries the response was YES. [2023-08-24 12:51:37,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11692 conditions, 2938 events. 1368/2938 cut-off events. For 14976/14996 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 22197 event pairs, 230 based on Foata normal form. 8/2661 useless extension candidates. Maximal degree in co-relation 11611. Up to 1925 conditions per place. [2023-08-24 12:51:37,010 INFO L140 encePairwiseOnDemand]: 467/480 looper letters, 135 selfloop transitions, 32 changer transitions 55/228 dead transitions. [2023-08-24 12:51:37,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 228 transitions, 2048 flow [2023-08-24 12:51:37,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-24 12:51:37,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-24 12:51:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2611 transitions. [2023-08-24 12:51:37,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3399739583333333 [2023-08-24 12:51:37,013 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2611 transitions. [2023-08-24 12:51:37,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2611 transitions. [2023-08-24 12:51:37,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:51:37,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2611 transitions. [2023-08-24 12:51:37,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 163.1875) internal successors, (2611), 16 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:37,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 480.0) internal successors, (8160), 17 states have internal predecessors, (8160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:37,021 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 480.0) internal successors, (8160), 17 states have internal predecessors, (8160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:37,021 INFO L175 Difference]: Start difference. First operand has 145 places, 120 transitions, 1077 flow. Second operand 16 states and 2611 transitions. [2023-08-24 12:51:37,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 228 transitions, 2048 flow [2023-08-24 12:51:37,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 228 transitions, 1790 flow, removed 108 selfloop flow, removed 16 redundant places. [2023-08-24 12:51:37,073 INFO L231 Difference]: Finished difference. Result has 150 places, 132 transitions, 1027 flow [2023-08-24 12:51:37,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1027, PETRI_PLACES=150, PETRI_TRANSITIONS=132} [2023-08-24 12:51:37,074 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 82 predicate places. [2023-08-24 12:51:37,074 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 132 transitions, 1027 flow [2023-08-24 12:51:37,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 156.5) internal successors, (3443), 22 states have internal predecessors, (3443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:37,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:51:37,075 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:51:37,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-08-24 12:51:37,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:51:37,281 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:51:37,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:51:37,282 INFO L85 PathProgramCache]: Analyzing trace with hash -381888270, now seen corresponding path program 6 times [2023-08-24 12:51:37,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:51:37,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612415744] [2023-08-24 12:51:37,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:51:37,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:51:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:51:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:51:37,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:51:37,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612415744] [2023-08-24 12:51:37,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612415744] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:51:37,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889202021] [2023-08-24 12:51:37,778 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 12:51:37,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:51:37,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:51:37,781 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:51:37,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-24 12:51:37,990 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-24 12:51:37,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:51:37,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2023-08-24 12:51:37,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:51:38,005 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 7 treesize of output 6 [2023-08-24 12:51:38,140 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-24 12:51:38,140 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-24 12:51:38,171 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 12:51:38,218 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 12:51:38,240 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 13 treesize of output 9 [2023-08-24 12:51:38,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:51:38,312 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-24 12:51:38,406 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:51:38,407 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 19 treesize of output 11 [2023-08-24 12:51:38,460 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-24 12:51:38,520 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 12:51:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:51:38,543 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:51:38,548 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1201 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1201) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:51:38,678 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:51:38,678 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 23 treesize of output 24 [2023-08-24 12:51:38,685 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:51:38,685 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-24 12:51:38,689 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 22 treesize of output 18 [2023-08-24 12:51:38,746 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1199 Int) (v_ArrVal_1201 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_75| |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1199)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1201) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1199 Int) (v_ArrVal_1201 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1199)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1201) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0))))) is different from false [2023-08-24 12:51:38,763 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1199 Int) (v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1195))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1199))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1201) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1199 Int) (v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_75| |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1195))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1199))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1201) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0)))) is different from false [2023-08-24 12:51:46,861 WARN L234 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:51:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-24 12:51:47,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889202021] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:51:47,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:51:47,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2023-08-24 12:51:47,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084929994] [2023-08-24 12:51:47,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:51:47,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-24 12:51:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:51:47,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-24 12:51:47,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=346, Unknown=11, NotChecked=120, Total=552 [2023-08-24 12:51:47,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 480 [2023-08-24 12:51:47,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 132 transitions, 1027 flow. Second operand has 24 states, 24 states have (on average 153.375) internal successors, (3681), 24 states have internal predecessors, (3681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:47,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:51:47,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 480 [2023-08-24 12:51:47,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:51:49,668 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-24 12:51:51,679 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-24 12:51:52,253 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (= (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0) (exists ((v_ArrVal_1199 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (and (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |t_funThread1of2ForFork0_~p~0#1.offset|)) (= (store ((as const (Array Int Int)) 0) |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1199) (select |c_#memory_int| 4)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1199 Int) (v_ArrVal_1201 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1199)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1201) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_79|)) 0)))) (= |c_t_funThread2of2ForFork0_~p~0#1.base| 4) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1199 Int) (v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1198 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1198) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_79|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1199)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1201) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_~#__global_lock~0.offset| 0) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) is different from false [2023-08-24 12:51:53,229 INFO L124 PetriNetUnfolderBase]: 1379/2994 cut-off events. [2023-08-24 12:51:53,229 INFO L125 PetriNetUnfolderBase]: For 10878/10898 co-relation queries the response was YES. [2023-08-24 12:51:53,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12367 conditions, 2994 events. 1379/2994 cut-off events. For 10878/10898 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 22718 event pairs, 291 based on Foata normal form. 10/2704 useless extension candidates. Maximal degree in co-relation 12290. Up to 1626 conditions per place. [2023-08-24 12:51:53,242 INFO L140 encePairwiseOnDemand]: 465/480 looper letters, 130 selfloop transitions, 30 changer transitions 91/257 dead transitions. [2023-08-24 12:51:53,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 257 transitions, 2276 flow [2023-08-24 12:51:53,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-24 12:51:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-24 12:51:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3191 transitions. [2023-08-24 12:51:53,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33239583333333333 [2023-08-24 12:51:53,246 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3191 transitions. [2023-08-24 12:51:53,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3191 transitions. [2023-08-24 12:51:53,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:51:53,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3191 transitions. [2023-08-24 12:51:53,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 159.55) internal successors, (3191), 20 states have internal predecessors, (3191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:53,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 480.0) internal successors, (10080), 21 states have internal predecessors, (10080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:53,256 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 480.0) internal successors, (10080), 21 states have internal predecessors, (10080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:53,256 INFO L175 Difference]: Start difference. First operand has 150 places, 132 transitions, 1027 flow. Second operand 20 states and 3191 transitions. [2023-08-24 12:51:53,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 257 transitions, 2276 flow [2023-08-24 12:51:53,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 257 transitions, 2210 flow, removed 3 selfloop flow, removed 11 redundant places. [2023-08-24 12:51:53,292 INFO L231 Difference]: Finished difference. Result has 163 places, 123 transitions, 956 flow [2023-08-24 12:51:53,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=956, PETRI_PLACES=163, PETRI_TRANSITIONS=123} [2023-08-24 12:51:53,293 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 95 predicate places. [2023-08-24 12:51:53,293 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 123 transitions, 956 flow [2023-08-24 12:51:53,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 153.375) internal successors, (3681), 24 states have internal predecessors, (3681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:53,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:51:53,294 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:51:53,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-24 12:51:53,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-24 12:51:53,501 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:51:53,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:51:53,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1711764237, now seen corresponding path program 3 times [2023-08-24 12:51:53,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:51:53,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600892694] [2023-08-24 12:51:53,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:51:53,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:51:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:51:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:51:55,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:51:55,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600892694] [2023-08-24 12:51:55,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600892694] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:51:55,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371799293] [2023-08-24 12:51:55,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 12:51:55,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:51:55,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:51:55,780 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:51:55,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-24 12:51:55,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 12:51:55,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:51:55,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-24 12:51:55,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:51:55,930 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 7 treesize of output 6 [2023-08-24 12:51:55,994 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:51:55,994 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-24 12:51:56,020 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 13 treesize of output 15 [2023-08-24 12:51:56,030 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 13 treesize of output 9 [2023-08-24 12:51:56,088 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 13 treesize of output 15 [2023-08-24 12:51:56,121 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:51:56,121 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 19 treesize of output 11 [2023-08-24 12:51:56,185 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-24 12:51:56,224 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-24 12:51:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-24 12:51:56,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:51:56,479 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-24 12:51:56,484 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-24 12:51:56,489 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1291 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1289 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_77| |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1288))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81| v_ArrVal_1289))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1291) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_77|) 0))) is different from false [2023-08-24 12:51:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-24 12:51:56,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371799293] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:51:56,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:51:56,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 7] total 28 [2023-08-24 12:51:56,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896200510] [2023-08-24 12:51:56,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:51:56,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-24 12:51:56,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:51:56,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-24 12:51:56,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=677, Unknown=16, NotChecked=54, Total=870 [2023-08-24 12:51:56,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 480 [2023-08-24 12:51:56,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 123 transitions, 956 flow. Second operand has 30 states, 30 states have (on average 150.13333333333333) internal successors, (4504), 30 states have internal predecessors, (4504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:56,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:51:56,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 480 [2023-08-24 12:51:56,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:51:57,855 INFO L124 PetriNetUnfolderBase]: 1081/2355 cut-off events. [2023-08-24 12:51:57,855 INFO L125 PetriNetUnfolderBase]: For 9711/9725 co-relation queries the response was YES. [2023-08-24 12:51:57,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10031 conditions, 2355 events. 1081/2355 cut-off events. For 9711/9725 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17075 event pairs, 204 based on Foata normal form. 4/2111 useless extension candidates. Maximal degree in co-relation 9949. Up to 1454 conditions per place. [2023-08-24 12:51:57,867 INFO L140 encePairwiseOnDemand]: 470/480 looper letters, 101 selfloop transitions, 22 changer transitions 45/174 dead transitions. [2023-08-24 12:51:57,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 174 transitions, 1576 flow [2023-08-24 12:51:57,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-24 12:51:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-24 12:51:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2918 transitions. [2023-08-24 12:51:57,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3199561403508772 [2023-08-24 12:51:57,871 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2918 transitions. [2023-08-24 12:51:57,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2918 transitions. [2023-08-24 12:51:57,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:51:57,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2918 transitions. [2023-08-24 12:51:57,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 153.57894736842104) internal successors, (2918), 19 states have internal predecessors, (2918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:57,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 480.0) internal successors, (9600), 20 states have internal predecessors, (9600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:57,881 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 480.0) internal successors, (9600), 20 states have internal predecessors, (9600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:57,881 INFO L175 Difference]: Start difference. First operand has 163 places, 123 transitions, 956 flow. Second operand 19 states and 2918 transitions. [2023-08-24 12:51:57,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 174 transitions, 1576 flow [2023-08-24 12:51:57,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 174 transitions, 1474 flow, removed 33 selfloop flow, removed 17 redundant places. [2023-08-24 12:51:57,910 INFO L231 Difference]: Finished difference. Result has 159 places, 114 transitions, 859 flow [2023-08-24 12:51:57,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=859, PETRI_PLACES=159, PETRI_TRANSITIONS=114} [2023-08-24 12:51:57,911 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 91 predicate places. [2023-08-24 12:51:57,911 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 114 transitions, 859 flow [2023-08-24 12:51:57,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 150.13333333333333) internal successors, (4504), 30 states have internal predecessors, (4504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:57,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:51:57,912 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:51:57,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-24 12:51:58,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-24 12:51:58,117 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:51:58,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:51:58,118 INFO L85 PathProgramCache]: Analyzing trace with hash 730800754, now seen corresponding path program 7 times [2023-08-24 12:51:58,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:51:58,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665250076] [2023-08-24 12:51:58,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:51:58,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:51:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:51:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-24 12:51:58,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:51:58,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665250076] [2023-08-24 12:51:58,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665250076] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:51:58,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378152462] [2023-08-24 12:51:58,587 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 12:51:58,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:51:58,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:51:58,588 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:51:58,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-24 12:51:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:51:58,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-24 12:51:58,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:51:58,722 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 7 treesize of output 6 [2023-08-24 12:51:58,777 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:51:58,777 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-24 12:51:58,798 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 13 treesize of output 15 [2023-08-24 12:51:58,816 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 13 treesize of output 15 [2023-08-24 12:51:58,835 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 13 treesize of output 9 [2023-08-24 12:51:58,877 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:51:58,878 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 19 treesize of output 11 [2023-08-24 12:51:58,928 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-24 12:51:58,956 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-24 12:51:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-24 12:51:58,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:51:59,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-24 12:51:59,085 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-24 12:51:59,091 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1380 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_79| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1381 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_79| v_ArrVal_1380)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1381) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_83|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_79| |v_t_funThread2of2ForFork0_~p~0#1.offset_83|))) is different from false [2023-08-24 12:51:59,115 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1380 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1376 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1381 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1376))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_79| v_ArrVal_1380))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1381) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_83|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_79| |v_t_funThread2of2ForFork0_~p~0#1.offset_83|))) is different from false [2023-08-24 12:51:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-24 12:51:59,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378152462] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:51:59,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:51:59,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 20 [2023-08-24 12:51:59,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883738702] [2023-08-24 12:51:59,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:51:59,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 12:51:59,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:51:59,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 12:51:59,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=291, Unknown=12, NotChecked=74, Total=462 [2023-08-24 12:51:59,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 480 [2023-08-24 12:51:59,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 114 transitions, 859 flow. Second operand has 22 states, 22 states have (on average 154.5) internal successors, (3399), 22 states have internal predecessors, (3399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:59,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:51:59,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 480 [2023-08-24 12:51:59,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:52:00,234 INFO L124 PetriNetUnfolderBase]: 974/2142 cut-off events. [2023-08-24 12:52:00,234 INFO L125 PetriNetUnfolderBase]: For 7387/7399 co-relation queries the response was YES. [2023-08-24 12:52:00,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8543 conditions, 2142 events. 974/2142 cut-off events. For 7387/7399 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15118 event pairs, 193 based on Foata normal form. 4/1922 useless extension candidates. Maximal degree in co-relation 8455. Up to 1223 conditions per place. [2023-08-24 12:52:00,244 INFO L140 encePairwiseOnDemand]: 469/480 looper letters, 118 selfloop transitions, 16 changer transitions 41/181 dead transitions. [2023-08-24 12:52:00,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 181 transitions, 1553 flow [2023-08-24 12:52:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 12:52:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 12:52:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1940 transitions. [2023-08-24 12:52:00,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2023-08-24 12:52:00,247 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1940 transitions. [2023-08-24 12:52:00,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1940 transitions. [2023-08-24 12:52:00,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:52:00,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1940 transitions. [2023-08-24 12:52:00,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 161.66666666666666) internal successors, (1940), 12 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:00,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 480.0) internal successors, (6240), 13 states have internal predecessors, (6240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:00,254 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 480.0) internal successors, (6240), 13 states have internal predecessors, (6240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:00,254 INFO L175 Difference]: Start difference. First operand has 159 places, 114 transitions, 859 flow. Second operand 12 states and 1940 transitions. [2023-08-24 12:52:00,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 181 transitions, 1553 flow [2023-08-24 12:52:00,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 181 transitions, 1489 flow, removed 8 selfloop flow, removed 20 redundant places. [2023-08-24 12:52:00,278 INFO L231 Difference]: Finished difference. Result has 146 places, 113 transitions, 833 flow [2023-08-24 12:52:00,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=833, PETRI_PLACES=146, PETRI_TRANSITIONS=113} [2023-08-24 12:52:00,279 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 78 predicate places. [2023-08-24 12:52:00,279 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 113 transitions, 833 flow [2023-08-24 12:52:00,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 154.5) internal successors, (3399), 22 states have internal predecessors, (3399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:00,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:52:00,280 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:52:00,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-24 12:52:00,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-24 12:52:00,486 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:52:00,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:52:00,486 INFO L85 PathProgramCache]: Analyzing trace with hash 789684393, now seen corresponding path program 4 times [2023-08-24 12:52:00,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:52:00,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541390416] [2023-08-24 12:52:00,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:00,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:52:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-24 12:52:01,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:52:01,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541390416] [2023-08-24 12:52:01,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541390416] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:52:01,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849673431] [2023-08-24 12:52:01,014 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 12:52:01,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:52:01,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:52:01,015 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:52:01,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-24 12:52:01,185 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 12:52:01,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:52:01,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-24 12:52:01,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:52:01,193 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 7 treesize of output 6 [2023-08-24 12:52:01,281 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:52:01,281 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-24 12:52:01,301 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 13 treesize of output 15 [2023-08-24 12:52:01,325 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 13 treesize of output 15 [2023-08-24 12:52:01,349 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 13 treesize of output 9 [2023-08-24 12:52:01,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:52:01,396 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-24 12:52:01,442 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:52:01,442 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 19 treesize of output 11 [2023-08-24 12:52:01,486 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-24 12:52:01,530 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-24 12:52:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-24 12:52:01,563 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:52:01,570 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1472 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1472) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) is different from false [2023-08-24 12:52:01,698 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:52:01,698 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 23 treesize of output 24 [2023-08-24 12:52:01,707 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:52:01,707 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-24 12:52:01,712 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 22 treesize of output 18 [2023-08-24 12:52:01,737 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((v_ArrVal_1471 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1472 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_85| v_ArrVal_1471)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1472) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_81| |v_t_funThread2of2ForFork0_~p~0#1.offset_85|))) (or (forall ((v_ArrVal_1471 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1472 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_85| v_ArrVal_1471)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1472) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-08-24 12:52:01,770 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1471 Int) (v_ArrVal_1466 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1472 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1466))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85| v_ArrVal_1471))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1472) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_81| |v_t_funThread2of2ForFork0_~p~0#1.offset_85|))) (or (forall ((v_ArrVal_1471 Int) (v_ArrVal_1466 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1472 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1466))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85| v_ArrVal_1471))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1472) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-24 12:52:09,851 WARN L234 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:52:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-24 12:52:09,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849673431] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:52:09,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:52:09,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2023-08-24 12:52:09,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396429551] [2023-08-24 12:52:09,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:52:09,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-24 12:52:09,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:52:09,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-24 12:52:09,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=341, Unknown=19, NotChecked=120, Total=552 [2023-08-24 12:52:09,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 480 [2023-08-24 12:52:09,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 113 transitions, 833 flow. Second operand has 24 states, 24 states have (on average 154.29166666666666) internal successors, (3703), 24 states have internal predecessors, (3703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:09,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:52:09,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 480 [2023-08-24 12:52:09,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:52:10,612 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (forall ((v_ArrVal_1471 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1472 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1471)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1472) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_81| 4)) 0)))) (forall ((v_ArrVal_1471 Int) (v_ArrVal_1469 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1472 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1469) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_81| 4)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1471)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1472) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) 0))))) is different from false [2023-08-24 12:52:10,664 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (forall ((v_ArrVal_1471 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1472 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1471)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1472) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_81| 4)) 0)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= (select (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1472 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1472) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (= 4 |c_t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_1471 Int) (v_ArrVal_1472 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1471)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1472) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (exists ((v_ArrVal_1471 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1471) (select |c_#memory_int| 4)) (not (= |t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (forall ((v_ArrVal_1471 Int) (v_ArrVal_1469 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1472 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1469) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_81| 4)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1471)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1472) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) 0))) (= |c_~#__global_lock~0.offset| 0))) is different from false [2023-08-24 12:52:11,377 INFO L124 PetriNetUnfolderBase]: 1040/2308 cut-off events. [2023-08-24 12:52:11,377 INFO L125 PetriNetUnfolderBase]: For 6966/6992 co-relation queries the response was YES. [2023-08-24 12:52:11,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9049 conditions, 2308 events. 1040/2308 cut-off events. For 6966/6992 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 16766 event pairs, 236 based on Foata normal form. 6/2072 useless extension candidates. Maximal degree in co-relation 8974. Up to 1237 conditions per place. [2023-08-24 12:52:11,388 INFO L140 encePairwiseOnDemand]: 466/480 looper letters, 126 selfloop transitions, 25 changer transitions 54/211 dead transitions. [2023-08-24 12:52:11,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 211 transitions, 1775 flow [2023-08-24 12:52:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-24 12:52:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-24 12:52:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2563 transitions. [2023-08-24 12:52:11,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33372395833333335 [2023-08-24 12:52:11,391 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2563 transitions. [2023-08-24 12:52:11,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2563 transitions. [2023-08-24 12:52:11,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:52:11,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2563 transitions. [2023-08-24 12:52:11,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 160.1875) internal successors, (2563), 16 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:11,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 480.0) internal successors, (8160), 17 states have internal predecessors, (8160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:11,400 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 480.0) internal successors, (8160), 17 states have internal predecessors, (8160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:11,400 INFO L175 Difference]: Start difference. First operand has 146 places, 113 transitions, 833 flow. Second operand 16 states and 2563 transitions. [2023-08-24 12:52:11,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 211 transitions, 1775 flow [2023-08-24 12:52:11,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 211 transitions, 1730 flow, removed 7 selfloop flow, removed 10 redundant places. [2023-08-24 12:52:11,424 INFO L231 Difference]: Finished difference. Result has 153 places, 124 transitions, 949 flow [2023-08-24 12:52:11,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=949, PETRI_PLACES=153, PETRI_TRANSITIONS=124} [2023-08-24 12:52:11,424 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 85 predicate places. [2023-08-24 12:52:11,425 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 124 transitions, 949 flow [2023-08-24 12:52:11,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 154.29166666666666) internal successors, (3703), 24 states have internal predecessors, (3703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:11,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:52:11,425 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:52:11,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-24 12:52:11,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:52:11,629 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:52:11,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:52:11,629 INFO L85 PathProgramCache]: Analyzing trace with hash -135065815, now seen corresponding path program 5 times [2023-08-24 12:52:11,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:52:11,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384974599] [2023-08-24 12:52:11,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:11,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:52:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:52:14,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:52:14,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384974599] [2023-08-24 12:52:14,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384974599] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:52:14,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068951796] [2023-08-24 12:52:14,945 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 12:52:14,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:52:14,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:52:14,946 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:52:14,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-24 12:52:15,322 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-24 12:52:15,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:52:15,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-24 12:52:15,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:52:15,333 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 7 treesize of output 6 [2023-08-24 12:52:15,411 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:52:15,411 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-24 12:52:15,442 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 13 treesize of output 15 [2023-08-24 12:52:15,471 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 13 treesize of output 15 [2023-08-24 12:52:15,500 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 13 treesize of output 9 [2023-08-24 12:52:15,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:52:15,560 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-24 12:52:15,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-24 12:52:15,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:52:15,625 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-24 12:52:15,671 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:52:15,672 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 19 treesize of output 11 [2023-08-24 12:52:15,717 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-24 12:52:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-24 12:52:15,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:52:16,055 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:52:16,055 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 23 treesize of output 24 [2023-08-24 12:52:16,063 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:52:16,063 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-24 12:52:16,066 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 22 treesize of output 18 [2023-08-24 12:52:16,088 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1562 Int) (v_ArrVal_1564 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_87| v_ArrVal_1562)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1564) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_83| |v_t_funThread2of2ForFork0_~p~0#1.offset_87|))) (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1562 Int) (v_ArrVal_1564 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_87| v_ArrVal_1562)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1564) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-08-24 12:52:16,131 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1557 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1562 Int) (v_ArrVal_1564 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1557))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_87| v_ArrVal_1562))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1564) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1557 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1562 Int) (v_ArrVal_1564 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int)) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1557))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_87| v_ArrVal_1562))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1564) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_83| |v_t_funThread2of2ForFork0_~p~0#1.offset_87|)))) is different from false [2023-08-24 12:52:24,247 WARN L234 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:52:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-24 12:52:24,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068951796] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:52:24,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:52:24,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 8] total 33 [2023-08-24 12:52:24,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490822758] [2023-08-24 12:52:24,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:52:24,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-24 12:52:24,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:52:24,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-24 12:52:24,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=909, Unknown=11, NotChecked=126, Total=1190 [2023-08-24 12:52:24,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 480 [2023-08-24 12:52:24,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 124 transitions, 949 flow. Second operand has 35 states, 35 states have (on average 141.85714285714286) internal successors, (4965), 35 states have internal predecessors, (4965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:24,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:52:24,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 480 [2023-08-24 12:52:24,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:52:26,066 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1562 Int) (v_ArrVal_1564 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1563 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1562)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1564) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1563) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_83| 4)) 0)))) (forall ((v_ArrVal_1564 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1563 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1564) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1563) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_83| 4)) 0))))) is different from false [2023-08-24 12:52:26,403 INFO L124 PetriNetUnfolderBase]: 947/2118 cut-off events. [2023-08-24 12:52:26,403 INFO L125 PetriNetUnfolderBase]: For 7906/7906 co-relation queries the response was YES. [2023-08-24 12:52:26,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9149 conditions, 2118 events. 947/2118 cut-off events. For 7906/7906 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15093 event pairs, 147 based on Foata normal form. 4/1900 useless extension candidates. Maximal degree in co-relation 9071. Up to 985 conditions per place. [2023-08-24 12:52:26,412 INFO L140 encePairwiseOnDemand]: 465/480 looper letters, 117 selfloop transitions, 50 changer transitions 31/204 dead transitions. [2023-08-24 12:52:26,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 204 transitions, 1876 flow [2023-08-24 12:52:26,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-24 12:52:26,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-24 12:52:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3628 transitions. [2023-08-24 12:52:26,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30233333333333334 [2023-08-24 12:52:26,418 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3628 transitions. [2023-08-24 12:52:26,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3628 transitions. [2023-08-24 12:52:26,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:52:26,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3628 transitions. [2023-08-24 12:52:26,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 145.12) internal successors, (3628), 25 states have internal predecessors, (3628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:26,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 480.0) internal successors, (12480), 26 states have internal predecessors, (12480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:26,432 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 480.0) internal successors, (12480), 26 states have internal predecessors, (12480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:26,432 INFO L175 Difference]: Start difference. First operand has 153 places, 124 transitions, 949 flow. Second operand 25 states and 3628 transitions. [2023-08-24 12:52:26,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 204 transitions, 1876 flow [2023-08-24 12:52:26,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 204 transitions, 1829 flow, removed 13 selfloop flow, removed 6 redundant places. [2023-08-24 12:52:26,457 INFO L231 Difference]: Finished difference. Result has 173 places, 142 transitions, 1198 flow [2023-08-24 12:52:26,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1198, PETRI_PLACES=173, PETRI_TRANSITIONS=142} [2023-08-24 12:52:26,457 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 105 predicate places. [2023-08-24 12:52:26,458 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 142 transitions, 1198 flow [2023-08-24 12:52:26,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 141.85714285714286) internal successors, (4965), 35 states have internal predecessors, (4965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:26,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:52:26,459 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:52:26,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-24 12:52:26,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-24 12:52:26,665 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:52:26,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:52:26,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1966055179, now seen corresponding path program 6 times [2023-08-24 12:52:26,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:52:26,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632872952] [2023-08-24 12:52:26,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:26,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:52:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-24 12:52:26,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:52:26,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632872952] [2023-08-24 12:52:26,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632872952] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:52:26,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302392498] [2023-08-24 12:52:26,939 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 12:52:26,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:52:26,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:52:26,940 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:52:26,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-24 12:52:27,260 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-24 12:52:27,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:52:27,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-24 12:52:27,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:52:27,273 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 7 treesize of output 6 [2023-08-24 12:52:27,394 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-24 12:52:27,394 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-24 12:52:27,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 12:52:27,462 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 12:52:27,482 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 13 treesize of output 9 [2023-08-24 12:52:27,539 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:52:27,539 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 19 treesize of output 11 [2023-08-24 12:52:27,626 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-24 12:52:27,694 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 12:52:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-24 12:52:27,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:52:27,736 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1654 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1654) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:52:27,822 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-24 12:52:27,825 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-24 12:52:27,830 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (v_ArrVal_1654 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1652 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_85| |v_t_funThread2of2ForFork0_~p~0#1.offset_89|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_89| v_ArrVal_1652)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1654) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0))) is different from false [2023-08-24 12:52:27,840 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (v_ArrVal_1654 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1652 Int) (v_ArrVal_1649 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_85| |v_t_funThread2of2ForFork0_~p~0#1.offset_89|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1649))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_89| v_ArrVal_1652))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1654) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0))) is different from false [2023-08-24 12:52:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-24 12:52:27,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302392498] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:52:27,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:52:27,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 19 [2023-08-24 12:52:27,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072611118] [2023-08-24 12:52:27,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:52:27,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-24 12:52:27,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:52:27,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-24 12:52:27,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=252, Unknown=8, NotChecked=102, Total=420 [2023-08-24 12:52:27,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 480 [2023-08-24 12:52:27,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 142 transitions, 1198 flow. Second operand has 21 states, 21 states have (on average 155.71428571428572) internal successors, (3270), 21 states have internal predecessors, (3270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:27,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:52:27,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 480 [2023-08-24 12:52:27,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:52:29,185 INFO L124 PetriNetUnfolderBase]: 902/2030 cut-off events. [2023-08-24 12:52:29,185 INFO L125 PetriNetUnfolderBase]: For 9170/9178 co-relation queries the response was YES. [2023-08-24 12:52:29,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9581 conditions, 2030 events. 902/2030 cut-off events. For 9170/9178 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14384 event pairs, 188 based on Foata normal form. 6/1824 useless extension candidates. Maximal degree in co-relation 9489. Up to 1008 conditions per place. [2023-08-24 12:52:29,196 INFO L140 encePairwiseOnDemand]: 470/480 looper letters, 120 selfloop transitions, 22 changer transitions 63/211 dead transitions. [2023-08-24 12:52:29,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 211 transitions, 2136 flow [2023-08-24 12:52:29,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 12:52:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-24 12:52:29,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2261 transitions. [2023-08-24 12:52:29,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33645833333333336 [2023-08-24 12:52:29,199 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2261 transitions. [2023-08-24 12:52:29,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2261 transitions. [2023-08-24 12:52:29,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:52:29,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2261 transitions. [2023-08-24 12:52:29,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 161.5) internal successors, (2261), 14 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:29,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 480.0) internal successors, (7200), 15 states have internal predecessors, (7200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:29,207 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 480.0) internal successors, (7200), 15 states have internal predecessors, (7200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:29,208 INFO L175 Difference]: Start difference. First operand has 173 places, 142 transitions, 1198 flow. Second operand 14 states and 2261 transitions. [2023-08-24 12:52:29,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 211 transitions, 2136 flow [2023-08-24 12:52:29,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 211 transitions, 2067 flow, removed 16 selfloop flow, removed 16 redundant places. [2023-08-24 12:52:29,239 INFO L231 Difference]: Finished difference. Result has 174 places, 129 transitions, 1114 flow [2023-08-24 12:52:29,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1114, PETRI_PLACES=174, PETRI_TRANSITIONS=129} [2023-08-24 12:52:29,240 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 106 predicate places. [2023-08-24 12:52:29,240 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 129 transitions, 1114 flow [2023-08-24 12:52:29,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 155.71428571428572) internal successors, (3270), 21 states have internal predecessors, (3270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:29,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:52:29,241 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:52:29,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-24 12:52:29,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:52:29,448 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:52:29,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:52:29,448 INFO L85 PathProgramCache]: Analyzing trace with hash 70584881, now seen corresponding path program 1 times [2023-08-24 12:52:29,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:52:29,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928127374] [2023-08-24 12:52:29,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:29,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:52:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:52:30,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:52:30,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928127374] [2023-08-24 12:52:30,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928127374] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:52:30,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789448648] [2023-08-24 12:52:30,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:30,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:52:30,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:52:30,265 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:52:30,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-24 12:52:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:30,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-24 12:52:30,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:52:30,453 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 7 treesize of output 6 [2023-08-24 12:52:30,536 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:52:30,536 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-24 12:52:30,562 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 13 treesize of output 15 [2023-08-24 12:52:30,581 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 13 treesize of output 9 [2023-08-24 12:52:30,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:52:30,637 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-24 12:52:30,671 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 13 treesize of output 15 [2023-08-24 12:52:30,720 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-24 12:52:30,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:52:30,780 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-24 12:52:30,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:52:30,788 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-24 12:52:30,809 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-24 12:52:30,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:52:30,849 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-24 12:52:30,898 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:52:30,898 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 19 treesize of output 11 [2023-08-24 12:52:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:52:30,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:52:30,983 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1757 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int)) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_91|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1757) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_91|)) 0)))) is different from false [2023-08-24 12:52:30,991 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1757 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int) (v_ArrVal_1755 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1755)) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_91|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1757) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_91|)) 0)))) is different from false [2023-08-24 12:52:31,044 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1750 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int) (v_ArrVal_1755 Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1757) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_91|)) 0)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1750))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1755))) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_91|) 0))) is different from false [2023-08-24 12:52:31,087 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:52:31,088 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 23 treesize of output 24 [2023-08-24 12:52:31,097 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:52:31,097 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-24 12:52:31,101 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 22 treesize of output 18 [2023-08-24 12:52:31,126 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1750 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int) (v_ArrVal_1755 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_87| |v_t_funThread2of2ForFork0_~p~0#1.offset_91|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1750) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_87| v_ArrVal_1755) |v_t_funThread2of2ForFork0_~p~0#1.offset_91|) 0))) (or (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1750 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int) (v_ArrVal_1755 Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1750) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_87| v_ArrVal_1755) |v_t_funThread2of2ForFork0_~p~0#1.offset_91|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-24 12:52:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-24 12:52:35,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789448648] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:52:35,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:52:35,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 26 [2023-08-24 12:52:35,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323649048] [2023-08-24 12:52:35,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:52:35,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-24 12:52:35,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:52:35,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-24 12:52:35,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=453, Unknown=4, NotChecked=188, Total=756 [2023-08-24 12:52:35,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 480 [2023-08-24 12:52:35,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 129 transitions, 1114 flow. Second operand has 28 states, 28 states have (on average 156.32142857142858) internal successors, (4377), 28 states have internal predecessors, (4377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:35,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:52:35,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 480 [2023-08-24 12:52:35,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:52:36,654 INFO L124 PetriNetUnfolderBase]: 835/1867 cut-off events. [2023-08-24 12:52:36,654 INFO L125 PetriNetUnfolderBase]: For 10225/10233 co-relation queries the response was YES. [2023-08-24 12:52:36,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8934 conditions, 1867 events. 835/1867 cut-off events. For 10225/10233 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12988 event pairs, 101 based on Foata normal form. 11/1682 useless extension candidates. Maximal degree in co-relation 8847. Up to 883 conditions per place. [2023-08-24 12:52:36,665 INFO L140 encePairwiseOnDemand]: 463/480 looper letters, 127 selfloop transitions, 54 changer transitions 23/210 dead transitions. [2023-08-24 12:52:36,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 210 transitions, 2156 flow [2023-08-24 12:52:36,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 12:52:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-24 12:52:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2277 transitions. [2023-08-24 12:52:36,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33883928571428573 [2023-08-24 12:52:36,667 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2277 transitions. [2023-08-24 12:52:36,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2277 transitions. [2023-08-24 12:52:36,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:52:36,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2277 transitions. [2023-08-24 12:52:36,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 162.64285714285714) internal successors, (2277), 14 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:36,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 480.0) internal successors, (7200), 15 states have internal predecessors, (7200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:36,673 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 480.0) internal successors, (7200), 15 states have internal predecessors, (7200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:36,673 INFO L175 Difference]: Start difference. First operand has 174 places, 129 transitions, 1114 flow. Second operand 14 states and 2277 transitions. [2023-08-24 12:52:36,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 210 transitions, 2156 flow [2023-08-24 12:52:36,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 210 transitions, 2072 flow, removed 21 selfloop flow, removed 16 redundant places. [2023-08-24 12:52:36,693 INFO L231 Difference]: Finished difference. Result has 166 places, 155 transitions, 1441 flow [2023-08-24 12:52:36,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1441, PETRI_PLACES=166, PETRI_TRANSITIONS=155} [2023-08-24 12:52:36,694 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 98 predicate places. [2023-08-24 12:52:36,694 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 155 transitions, 1441 flow [2023-08-24 12:52:36,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 156.32142857142858) internal successors, (4377), 28 states have internal predecessors, (4377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:36,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:52:36,695 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:52:36,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-08-24 12:52:36,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-08-24 12:52:36,905 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:52:36,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:52:36,905 INFO L85 PathProgramCache]: Analyzing trace with hash -653904987, now seen corresponding path program 2 times [2023-08-24 12:52:36,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:52:36,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416627855] [2023-08-24 12:52:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:36,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:52:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:52:37,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:52:37,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416627855] [2023-08-24 12:52:37,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416627855] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:52:37,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967762516] [2023-08-24 12:52:37,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:52:37,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:52:37,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:52:37,235 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:52:37,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-24 12:52:37,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:52:37,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:52:37,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-24 12:52:37,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:52:37,402 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 7 treesize of output 6 [2023-08-24 12:52:37,456 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:52:37,457 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-24 12:52:37,476 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 12:52:37,538 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 13 treesize of output 15 [2023-08-24 12:52:37,599 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-08-24 12:52:37,690 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-24 12:52:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:52:37,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:52:51,751 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:52:53,757 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:52:55,766 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:52:57,775 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_#t~mem35#1|)) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:53:07,812 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1850 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1850))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:53:07,824 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1850 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1850) |c_~#a~0.base|))) (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|))) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:53:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-24 12:53:07,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967762516] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:53:07,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:53:07,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2023-08-24 12:53:07,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163280699] [2023-08-24 12:53:07,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:53:07,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-24 12:53:07,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:53:07,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-24 12:53:07,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=386, Unknown=16, NotChecked=270, Total=756 [2023-08-24 12:53:07,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 480 [2023-08-24 12:53:07,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 155 transitions, 1441 flow. Second operand has 28 states, 28 states have (on average 171.17857142857142) internal successors, (4793), 28 states have internal predecessors, (4793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:07,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:53:07,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 480 [2023-08-24 12:53:07,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:53:16,073 WARN L234 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:53:26,460 WARN L234 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 31 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:53:26,782 INFO L124 PetriNetUnfolderBase]: 756/1765 cut-off events. [2023-08-24 12:53:26,782 INFO L125 PetriNetUnfolderBase]: For 11598/11608 co-relation queries the response was YES. [2023-08-24 12:53:26,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9192 conditions, 1765 events. 756/1765 cut-off events. For 11598/11608 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12462 event pairs, 103 based on Foata normal form. 9/1587 useless extension candidates. Maximal degree in co-relation 9107. Up to 766 conditions per place. [2023-08-24 12:53:26,791 INFO L140 encePairwiseOnDemand]: 464/480 looper letters, 140 selfloop transitions, 73 changer transitions 16/240 dead transitions. [2023-08-24 12:53:26,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 240 transitions, 2707 flow [2023-08-24 12:53:26,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-24 12:53:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-24 12:53:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3165 transitions. [2023-08-24 12:53:26,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3663194444444444 [2023-08-24 12:53:26,794 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3165 transitions. [2023-08-24 12:53:26,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3165 transitions. [2023-08-24 12:53:26,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:53:26,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3165 transitions. [2023-08-24 12:53:26,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 175.83333333333334) internal successors, (3165), 18 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:26,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 480.0) internal successors, (9120), 19 states have internal predecessors, (9120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:26,801 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 480.0) internal successors, (9120), 19 states have internal predecessors, (9120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:26,801 INFO L175 Difference]: Start difference. First operand has 166 places, 155 transitions, 1441 flow. Second operand 18 states and 3165 transitions. [2023-08-24 12:53:26,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 240 transitions, 2707 flow [2023-08-24 12:53:26,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 240 transitions, 2547 flow, removed 64 selfloop flow, removed 7 redundant places. [2023-08-24 12:53:26,831 INFO L231 Difference]: Finished difference. Result has 182 places, 183 transitions, 1840 flow [2023-08-24 12:53:26,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1840, PETRI_PLACES=182, PETRI_TRANSITIONS=183} [2023-08-24 12:53:26,831 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 114 predicate places. [2023-08-24 12:53:26,831 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 183 transitions, 1840 flow [2023-08-24 12:53:26,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 171.17857142857142) internal successors, (4793), 28 states have internal predecessors, (4793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:26,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:53:26,832 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:53:26,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-08-24 12:53:27,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:53:27,033 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:53:27,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:53:27,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1844774955, now seen corresponding path program 3 times [2023-08-24 12:53:27,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:53:27,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928322194] [2023-08-24 12:53:27,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:53:27,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:53:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:53:28,707 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:53:28,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:53:28,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928322194] [2023-08-24 12:53:28,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928322194] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:53:28,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965674339] [2023-08-24 12:53:28,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 12:53:28,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:53:28,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:53:28,708 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:53:28,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-08-24 12:53:28,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 12:53:28,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:53:28,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-24 12:53:28,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:53:28,873 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 7 treesize of output 6 [2023-08-24 12:53:28,936 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:53:28,937 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-24 12:53:28,960 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 13 treesize of output 15 [2023-08-24 12:53:29,008 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 13 treesize of output 15 [2023-08-24 12:53:29,070 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-08-24 12:53:29,166 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-24 12:53:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:53:29,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:53:49,241 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:53:51,246 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:53:53,253 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:53:55,271 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_#t~mem35#1|)) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:54:05,325 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1947 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1947))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:54:07,332 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1947 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1947) |c_~#a~0.base|))) (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|))) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:54:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-24 12:54:07,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965674339] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:54:07,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:54:07,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2023-08-24 12:54:07,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488125325] [2023-08-24 12:54:07,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:54:07,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-24 12:54:07,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:54:07,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-24 12:54:07,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=518, Unknown=19, NotChecked=306, Total=930 [2023-08-24 12:54:07,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 480 [2023-08-24 12:54:07,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 183 transitions, 1840 flow. Second operand has 31 states, 31 states have (on average 146.1290322580645) internal successors, (4530), 31 states have internal predecessors, (4530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:07,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:54:07,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 480 [2023-08-24 12:54:07,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:54:45,562 WARN L234 SmtUtils]: Spent 38.08s on a formula simplification. DAG size of input: 39 DAG size of output: 34 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:54:47,564 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-24 12:54:49,566 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-24 12:54:51,568 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-24 12:54:53,572 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-24 12:54:55,578 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-24 12:54:57,581 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-24 12:54:59,589 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-24 12:55:01,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-24 12:55:03,601 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-24 12:55:05,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-24 12:55:07,622 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-24 12:55:09,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:11,671 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-24 12:55:13,683 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-24 12:56:05,822 WARN L234 SmtUtils]: Spent 52.10s on a formula simplification. DAG size of input: 52 DAG size of output: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:56:07,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-24 12:56:09,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:56:11,850 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-24 12:56:13,899 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-24 12:56:15,903 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-24 12:56:17,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-24 12:56:19,914 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-24 12:56:21,916 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-24 12:56:23,927 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-24 12:56:25,984 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-24 12:56:28,020 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-24 12:56:30,044 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-24 12:56:32,210 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-24 12:56:34,212 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-24 12:56:36,214 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-24 12:56:44,388 WARN L234 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 67 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:57:16,649 WARN L234 SmtUtils]: Spent 32.08s on a formula simplification. DAG size of input: 61 DAG size of output: 24 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:57:24,917 WARN L234 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 54 DAG size of output: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:57:26,921 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-24 12:57:28,924 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-24 12:57:30,937 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-24 12:57:32,945 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-24 12:57:34,948 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-24 12:57:36,951 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-24 12:57:38,954 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-24 12:57:40,959 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 [0, 1] [2023-08-24 12:57:42,962 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-24 12:57:44,965 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-24 12:57:46,971 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-24 12:57:48,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-24 12:57:50,978 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-24 12:57:52,987 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-24 12:57:54,989 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-24 12:57:56,991 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-24 12:57:58,996 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-24 12:58:00,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-24 12:58:03,001 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-24 12:58:05,007 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-24 12:58:07,023 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-24 12:58:09,026 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-24 12:58:11,030 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-24 12:58:13,036 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 [0, 1] [2023-08-24 12:58:15,039 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-24 12:58:17,043 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-24 12:58:19,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:58:21,069 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-24 12:58:23,074 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-24 12:58:25,077 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-24 12:58:27,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:58:29,097 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-24 12:58:31,265 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-24 12:58:33,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:58:35,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:58:37,289 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-24 12:58:39,291 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-24 12:58:41,294 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-24 12:58:43,297 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-24 12:58:45,300 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-24 12:58:47,307 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 [0, 1] [2023-08-24 12:58:49,310 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-24 12:58:51,313 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-24 12:58:53,317 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-24 12:58:55,319 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-24 12:58:57,322 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-24 12:58:59,324 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-24 12:59:01,327 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-24 12:59:03,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:59:05,348 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-24 12:59:07,366 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-24 12:59:09,369 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-24 12:59:11,373 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-24 12:59:13,375 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-24 12:59:15,390 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-24 12:59:16,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:59:18,515 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-24 12:59:23,066 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-24 12:59:25,073 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-24 12:59:27,077 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-24 12:59:29,081 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-24 12:59:31,084 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-24 12:59:33,087 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-24 12:59:35,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-24 12:59:37,909 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-24 12:59:39,913 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-24 12:59:41,918 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-24 12:59:43,922 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-24 12:59:45,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-24 12:59:47,930 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-24 12:59:49,936 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 [0, 1] [2023-08-24 12:59:51,939 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-24 12:59:53,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:59:55,993 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-24 12:59:57,996 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-24 13:00:00,000 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-24 13:00:02,004 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-24 13:00:04,008 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-24 13:00:06,011 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-24 13:00:08,157 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-24 13:00:10,159 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-24 13:00:12,162 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-24 13:00:14,169 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-24 13:00:16,183 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-24 13:00:18,185 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-24 13:00:20,189 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-24 13:00:22,194 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 [0, 1] [2023-08-24 13:00:24,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:00:26,209 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-24 13:00:28,212 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-24 13:00:30,215 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-24 13:00:32,218 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-24 13:00:34,221 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-24 13:00:36,227 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-24 13:00:38,229 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-24 13:00:46,330 WARN L234 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 60 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:01:22,530 WARN L234 SmtUtils]: Spent 36.08s on a formula simplification. DAG size of input: 72 DAG size of output: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:01:24,583 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-24 13:01:26,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-24 13:01:28,590 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-24 13:01:30,593 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-24 13:01:32,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-24 13:01:34,599 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-24 13:01:36,612 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 [0, 1] Received shutdown request... [2023-08-24 13:01:37,596 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 13:01:37,596 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-24 13:01:38,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-08-24 13:01:38,616 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-24 13:01:38,618 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 13:01:38,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-24 13:01:38,618 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-24 13:01:38,618 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-24 13:01:38,618 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-24 13:01:38,618 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-24 13:01:38,618 INFO L445 BasicCegarLoop]: Path program histogram: [7, 6, 3, 2, 2, 1, 1, 1, 1] [2023-08-24 13:01:38,619 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-24 13:01:38,619 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-24 13:01:38,619 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 13:01:38,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 01:01:38 BasicIcfg [2023-08-24 13:01:38,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 13:01:38,622 INFO L158 Benchmark]: Toolchain (without parser) took 839882.47ms. Allocated memory was 350.2MB in the beginning and 2.2GB in the end (delta: 1.8GB). Free memory was 325.0MB in the beginning and 428.2MB in the end (delta: -103.3MB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2023-08-24 13:01:38,622 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 350.2MB. Free memory is still 327.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 13:01:38,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 692.02ms. Allocated memory is still 350.2MB. Free memory was 324.7MB in the beginning and 295.1MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-24 13:01:38,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.49ms. Allocated memory is still 350.2MB. Free memory was 295.1MB in the beginning and 292.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 13:01:38,623 INFO L158 Benchmark]: Boogie Preprocessor took 51.72ms. Allocated memory is still 350.2MB. Free memory was 292.4MB in the beginning and 290.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 13:01:38,623 INFO L158 Benchmark]: RCFGBuilder took 496.08ms. Allocated memory was 350.2MB in the beginning and 438.3MB in the end (delta: 88.1MB). Free memory was 290.2MB in the beginning and 404.8MB in the end (delta: -114.6MB). Peak memory consumption was 16.3MB. Max. memory is 16.0GB. [2023-08-24 13:01:38,623 INFO L158 Benchmark]: TraceAbstraction took 838566.71ms. Allocated memory was 438.3MB in the beginning and 2.2GB in the end (delta: 1.7GB). Free memory was 404.8MB in the beginning and 428.2MB in the end (delta: -23.4MB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2023-08-24 13:01:38,624 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 350.2MB. Free memory is still 327.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 692.02ms. Allocated memory is still 350.2MB. Free memory was 324.7MB in the beginning and 295.1MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 70.49ms. Allocated memory is still 350.2MB. Free memory was 295.1MB in the beginning and 292.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 51.72ms. Allocated memory is still 350.2MB. Free memory was 292.4MB in the beginning and 290.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 496.08ms. Allocated memory was 350.2MB in the beginning and 438.3MB in the end (delta: 88.1MB). Free memory was 290.2MB in the beginning and 404.8MB in the end (delta: -114.6MB). Peak memory consumption was 16.3MB. Max. memory is 16.0GB. * TraceAbstraction took 838566.71ms. Allocated memory was 438.3MB in the beginning and 2.2GB in the end (delta: 1.7GB). Free memory was 404.8MB in the beginning and 428.2MB in the end (delta: -23.4MB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 736]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [736] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 161 PlacesBefore, 45 PlacesAfterwards, 188 TransitionsBefore, 66 TransitionsAfterwards, 10608 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 92 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 156 TotalNumberOfCompositions, 16839 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8351, independent: 8079, independent conditional: 0, independent unconditional: 8079, dependent: 272, dependent conditional: 0, dependent unconditional: 272, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5285, independent: 5227, independent conditional: 0, independent unconditional: 5227, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8351, independent: 2852, independent conditional: 0, independent unconditional: 2852, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 5285, unknown conditional: 0, unknown unconditional: 5285] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 169, Positive conditional cache size: 0, Positive unconditional cache size: 169, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 161 PlacesBefore, 45 PlacesAfterwards, 188 TransitionsBefore, 66 TransitionsAfterwards, 10608 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 92 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 157 TotalNumberOfCompositions, 16887 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8277, independent: 8005, independent conditional: 0, independent unconditional: 8005, dependent: 272, dependent conditional: 0, dependent unconditional: 272, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5214, independent: 5157, independent conditional: 0, independent unconditional: 5157, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8277, independent: 2848, independent conditional: 0, independent unconditional: 2848, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 5214, unknown conditional: 0, unknown unconditional: 5214] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 223 PlacesBefore, 68 PlacesAfterwards, 263 TransitionsBefore, 100 TransitionsAfterwards, 31960 CoEnabledTransitionPairs, 5 FixpointIterations, 35 TrivialSequentialCompositions, 142 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 27 ConcurrentYvCompositions, 8 ChoiceCompositions, 217 TotalNumberOfCompositions, 50430 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25356, independent: 25001, independent conditional: 0, independent unconditional: 25001, dependent: 355, dependent conditional: 0, dependent unconditional: 355, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15847, independent: 15757, independent conditional: 0, independent unconditional: 15757, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25356, independent: 9244, independent conditional: 0, independent unconditional: 9244, dependent: 265, dependent conditional: 0, dependent unconditional: 265, unknown: 15847, unknown conditional: 0, unknown unconditional: 15847] , Statistics on independence cache: Total cache size (in pairs): 506, Positive cache size: 463, Positive conditional cache size: 0, Positive unconditional cache size: 463, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 219 locations, 4 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: 6.1s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 521 IncrementalHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 0 mSDtfsCounter, 521 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=4, InterpolantAutomatonStates: 32, 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 100 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 303 SizeOfPredicates, 5 NumberOfNonLiveVariables, 526 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 23/58 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 275 locations, 5 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: 828.7s, OverallIterations: 24, TraceHistogramMax: 10, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 612.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 660 mSolverCounterUnknown, 3359 SdHoareTripleChecker+Valid, 345.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3359 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 343.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5921 IncrementalHoareTripleChecker+Unchecked, 145 mSDsCounter, 667 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13957 IncrementalHoareTripleChecker+Invalid, 21206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 667 mSolverCounterUnsat, 14 mSDtfsCounter, 13957 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1586 GetRequests, 929 SyntacticMatches, 44 SemanticMatches, 613 ConstructedPredicates, 51 IntricatePredicates, 7 DeprecatedPredicates, 3086 ImplicationChecksByTransitivity, 430.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1840occurred in iteration=23, InterpolantAutomatonStates: 300, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 204.2s InterpolantComputationTime, 1212 NumberOfCodeBlocks, 1182 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 1716 ConstructedInterpolants, 537 QuantifiedInterpolants, 39591 SizeOfPredicates, 157 NumberOfNonLiveVariables, 4913 ConjunctsInSsa, 682 ConjunctsInUnsatCore, 66 InterpolantComputations, 4 PerfectInterpolantSequences, 2831/3277 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 219 locations, 4 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: 3.6s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 244 IncrementalHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 244 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 14/47 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