/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_76-tricky_address3_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 12:49:29,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 12:49:29,341 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:49:29,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 12:49:29,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 12:49:29,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 12:49:29,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 12:49:29,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 12:49:29,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 12:49:29,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 12:49:29,373 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 12:49:29,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 12:49:29,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 12:49:29,374 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 12:49:29,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 12:49:29,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 12:49:29,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 12:49:29,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 12:49:29,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 12:49:29,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 12:49:29,375 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 12:49:29,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 12:49:29,376 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 12:49:29,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 12:49:29,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 12:49:29,376 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 12:49:29,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 12:49:29,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 12:49:29,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 12:49:29,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 12:49:29,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 12:49:29,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 12:49:29,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 12:49:29,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 12:49:29,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 12:49:29,378 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:49:29,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 12:49:29,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 12:49:29,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 12:49:29,657 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 12:49:29,657 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 12:49:29,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-08-24 12:49:30,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 12:49:30,926 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 12:49:30,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-08-24 12:49:30,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa9fb3e7/02fe6329c60049f09bce9bcb10cc43f1/FLAG830ad2aaf [2023-08-24 12:49:30,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa9fb3e7/02fe6329c60049f09bce9bcb10cc43f1 [2023-08-24 12:49:30,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 12:49:30,951 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 12:49:30,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 12:49:30,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 12:49:30,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 12:49:30,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 12:49:30" (1/1) ... [2023-08-24 12:49:30,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312b9090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:49:30, skipping insertion in model container [2023-08-24 12:49:30,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 12:49:30" (1/1) ... [2023-08-24 12:49:30,982 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 12:49:31,214 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_76-tricky_address3_racefree.i[41323,41336] [2023-08-24 12:49:31,234 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 12:49:31,252 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 12:49:31,269 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-24 12:49:31,270 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-24 12:49:31,274 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-24 12:49:31,278 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_76-tricky_address3_racefree.i[41323,41336] [2023-08-24 12:49:31,286 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 12:49:31,333 INFO L206 MainTranslator]: Completed translation [2023-08-24 12:49:31,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:49:31 WrapperNode [2023-08-24 12:49:31,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 12:49:31,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 12:49:31,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 12:49:31,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 12:49:31,339 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:49:31" (1/1) ... [2023-08-24 12:49:31,363 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:49:31" (1/1) ... [2023-08-24 12:49:31,388 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 196 [2023-08-24 12:49:31,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 12:49:31,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 12:49:31,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 12:49:31,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 12:49:31,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:49:31" (1/1) ... [2023-08-24 12:49:31,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:49:31" (1/1) ... [2023-08-24 12:49:31,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:49:31" (1/1) ... [2023-08-24 12:49:31,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:49:31" (1/1) ... [2023-08-24 12:49:31,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:49:31" (1/1) ... [2023-08-24 12:49:31,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:49:31" (1/1) ... [2023-08-24 12:49:31,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:49:31" (1/1) ... [2023-08-24 12:49:31,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:49:31" (1/1) ... [2023-08-24 12:49:31,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 12:49:31,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 12:49:31,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 12:49:31,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 12:49:31,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:49:31" (1/1) ... [2023-08-24 12:49:31,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 12:49:31,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:49:31,469 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:49:31,486 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:49:31,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 12:49:31,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 12:49:31,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 12:49:31,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 12:49:31,496 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-24 12:49:31,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 12:49:31,496 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-24 12:49:31,496 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-24 12:49:31,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 12:49:31,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 12:49:31,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 12:49:31,497 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:49:31,629 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 12:49:31,630 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 12:49:31,927 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 12:49:31,932 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 12:49:31,932 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-24 12:49:31,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 12:49:31 BoogieIcfgContainer [2023-08-24 12:49:31,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 12:49:31,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 12:49:31,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 12:49:31,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 12:49:31,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 12:49:30" (1/3) ... [2023-08-24 12:49:31,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6868d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 12:49:31, skipping insertion in model container [2023-08-24 12:49:31,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:49:31" (2/3) ... [2023-08-24 12:49:31,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6868d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 12:49:31, skipping insertion in model container [2023-08-24 12:49:31,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 12:49:31" (3/3) ... [2023-08-24 12:49:31,939 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2023-08-24 12:49:31,949 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 12:49:31,950 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 12:49:31,950 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 12:49:32,000 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-24 12:49:32,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 196 transitions, 400 flow [2023-08-24 12:49:32,084 INFO L124 PetriNetUnfolderBase]: 45/268 cut-off events. [2023-08-24 12:49:32,084 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-24 12:49:32,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 268 events. 45/268 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 837 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 148. Up to 8 conditions per place. [2023-08-24 12:49:32,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 196 transitions, 400 flow [2023-08-24 12:49:32,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 191 transitions, 387 flow [2023-08-24 12:49:32,107 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 12:49:32,113 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 191 transitions, 387 flow [2023-08-24 12:49:32,114 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 191 transitions, 387 flow [2023-08-24 12:49:32,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 191 transitions, 387 flow [2023-08-24 12:49:32,144 INFO L124 PetriNetUnfolderBase]: 44/263 cut-off events. [2023-08-24 12:49:32,145 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:49:32,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 263 events. 44/263 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 800 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 148. Up to 8 conditions per place. [2023-08-24 12:49:32,149 INFO L119 LiptonReduction]: Number of co-enabled transitions 11076 [2023-08-24 12:49:34,405 INFO L134 LiptonReduction]: Checked pairs total: 18087 [2023-08-24 12:49:34,405 INFO L136 LiptonReduction]: Total number of compositions: 168 [2023-08-24 12:49:34,414 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 12:49:34,418 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;@70638694, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 12:49:34,418 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-24 12:49:34,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 12:49:34,422 INFO L124 PetriNetUnfolderBase]: 5/27 cut-off events. [2023-08-24 12:49:34,422 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:49:34,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:49:34,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-24 12:49:34,422 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:49:34,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:49:34,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1630590956, now seen corresponding path program 1 times [2023-08-24 12:49:34,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:49:34,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796214555] [2023-08-24 12:49:34,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:34,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:49:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:34,600 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:49:34,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:49:34,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796214555] [2023-08-24 12:49:34,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796214555] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:49:34,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:49:34,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 12:49:34,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056711494] [2023-08-24 12:49:34,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:49:34,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:49:34,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:49:34,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:49:34,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 12:49:34,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 364 [2023-08-24 12:49:34,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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:49:34,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:49:34,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 364 [2023-08-24 12:49:34,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:49:34,768 INFO L124 PetriNetUnfolderBase]: 272/611 cut-off events. [2023-08-24 12:49:34,768 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:49:34,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 611 events. 272/611 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3026 event pairs, 238 based on Foata normal form. 118/638 useless extension candidates. Maximal degree in co-relation 1092. Up to 528 conditions per place. [2023-08-24 12:49:34,775 INFO L140 encePairwiseOnDemand]: 339/364 looper letters, 34 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-24 12:49:34,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 167 flow [2023-08-24 12:49:34,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:49:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:49:34,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2023-08-24 12:49:34,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48534798534798534 [2023-08-24 12:49:34,789 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 530 transitions. [2023-08-24 12:49:34,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 530 transitions. [2023-08-24 12:49:34,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:49:34,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 530 transitions. [2023-08-24 12:49:34,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:49:34,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states 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:49:34,803 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states 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:49:34,804 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 530 transitions. [2023-08-24 12:49:34,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 167 flow [2023-08-24 12:49:34,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 167 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:49:34,809 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 105 flow [2023-08-24 12:49:34,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-08-24 12:49:34,813 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-08-24 12:49:34,813 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 105 flow [2023-08-24 12:49:34,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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:49:34,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:49:34,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:49:34,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 12:49:34,814 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:49:34,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:49:34,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1557690004, now seen corresponding path program 1 times [2023-08-24 12:49:34,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:49:34,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477557371] [2023-08-24 12:49:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:49:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:34,909 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:49:34,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:49:34,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477557371] [2023-08-24 12:49:34,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477557371] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:49:34,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74970168] [2023-08-24 12:49:34,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:34,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:49:34,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:49:34,912 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:49:34,932 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:49:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:34,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-24 12:49:34,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:49:35,009 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:49:35,009 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:49:35,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74970168] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:49:35,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:49:35,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-24 12:49:35,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093627542] [2023-08-24 12:49:35,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:49:35,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:49:35,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:49:35,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:49:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 12:49:35,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 364 [2023-08-24 12:49:35,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states 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:49:35,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:49:35,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 364 [2023-08-24 12:49:35,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:49:35,101 INFO L124 PetriNetUnfolderBase]: 255/592 cut-off events. [2023-08-24 12:49:35,101 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:49:35,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 592 events. 255/592 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3329 event pairs, 0 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 1120. Up to 497 conditions per place. [2023-08-24 12:49:35,103 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 49 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-24 12:49:35,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 237 flow [2023-08-24 12:49:35,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:49:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:49:35,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2023-08-24 12:49:35,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47802197802197804 [2023-08-24 12:49:35,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2023-08-24 12:49:35,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2023-08-24 12:49:35,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:49:35,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2023-08-24 12:49:35,106 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:49:35,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states 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:49:35,108 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states 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:49:35,108 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 105 flow. Second operand 3 states and 522 transitions. [2023-08-24 12:49:35,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 237 flow [2023-08-24 12:49:35,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 233 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 12:49:35,109 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 109 flow [2023-08-24 12:49:35,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2023-08-24 12:49:35,110 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2023-08-24 12:49:35,110 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 109 flow [2023-08-24 12:49:35,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states 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:49:35,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:49:35,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:49:35,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-24 12:49:35,315 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:49:35,316 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:49:35,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:49:35,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1877398059, now seen corresponding path program 1 times [2023-08-24 12:49:35,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:49:35,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712644002] [2023-08-24 12:49:35,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:35,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:49:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:35,390 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:49:35,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:49:35,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712644002] [2023-08-24 12:49:35,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712644002] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:49:35,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893814451] [2023-08-24 12:49:35,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:35,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:49:35,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:49:35,394 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:49:35,413 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:49:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:35,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 12:49:35,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:49:35,482 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:49:35,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:49:35,498 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:49:35,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893814451] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:49:35,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:49:35,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-24 12:49:35,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878546362] [2023-08-24 12:49:35,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:49:35,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 12:49:35,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:49:35,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 12:49:35,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-24 12:49:35,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 364 [2023-08-24 12:49:35,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 109 flow. Second operand has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 states 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:49:35,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:49:35,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 364 [2023-08-24 12:49:35,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:49:35,628 INFO L124 PetriNetUnfolderBase]: 270/596 cut-off events. [2023-08-24 12:49:35,628 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-08-24 12:49:35,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 596 events. 270/596 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2934 event pairs, 238 based on Foata normal form. 3/527 useless extension candidates. Maximal degree in co-relation 1147. Up to 513 conditions per place. [2023-08-24 12:49:35,630 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 34 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-08-24 12:49:35,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 199 flow [2023-08-24 12:49:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:49:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:49:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 984 transitions. [2023-08-24 12:49:35,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45054945054945056 [2023-08-24 12:49:35,632 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 984 transitions. [2023-08-24 12:49:35,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 984 transitions. [2023-08-24 12:49:35,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:49:35,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 984 transitions. [2023-08-24 12:49:35,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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:49:35,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 364.0) internal successors, (2548), 7 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states 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:49:35,637 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 364.0) internal successors, (2548), 7 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states 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:49:35,637 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 109 flow. Second operand 6 states and 984 transitions. [2023-08-24 12:49:35,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 199 flow [2023-08-24 12:49:35,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 12:49:35,638 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 141 flow [2023-08-24 12:49:35,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-08-24 12:49:35,639 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2023-08-24 12:49:35,639 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 141 flow [2023-08-24 12:49:35,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 states 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:49:35,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:49:35,640 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:49:35,661 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:49:35,844 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:49:35,845 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:49:35,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:49:35,845 INFO L85 PathProgramCache]: Analyzing trace with hash 991879339, now seen corresponding path program 2 times [2023-08-24 12:49:35,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:49:35,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611586918] [2023-08-24 12:49:35,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:35,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:49:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:35,907 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:49:35,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:49:35,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611586918] [2023-08-24 12:49:35,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611586918] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:49:35,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756929678] [2023-08-24 12:49:35,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:49:35,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:49:35,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:49:35,909 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:49:35,910 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:49:35,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 12:49:35,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:49:35,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-24 12:49:35,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:49:35,996 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:49:36,039 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:49:36,039 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:49:36,054 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:49:36,094 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:49:36,094 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:49:36,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756929678] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:49:36,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:49:36,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-24 12:49:36,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473374431] [2023-08-24 12:49:36,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:49:36,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 12:49:36,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:49:36,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 12:49:36,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-24 12:49:36,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 364 [2023-08-24 12:49:36,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states 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:49:36,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:49:36,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 364 [2023-08-24 12:49:36,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:49:36,230 INFO L124 PetriNetUnfolderBase]: 278/643 cut-off events. [2023-08-24 12:49:36,231 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-24 12:49:36,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 643 events. 278/643 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3292 event pairs, 37 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 1242. Up to 369 conditions per place. [2023-08-24 12:49:36,232 INFO L140 encePairwiseOnDemand]: 357/364 looper letters, 43 selfloop transitions, 6 changer transitions 25/81 dead transitions. [2023-08-24 12:49:36,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 359 flow [2023-08-24 12:49:36,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 12:49:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 12:49:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2023-08-24 12:49:36,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39395604395604394 [2023-08-24 12:49:36,234 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 717 transitions. [2023-08-24 12:49:36,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 717 transitions. [2023-08-24 12:49:36,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:49:36,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 717 transitions. [2023-08-24 12:49:36,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:49:36,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states 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:49:36,239 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states 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:49:36,239 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 141 flow. Second operand 5 states and 717 transitions. [2023-08-24 12:49:36,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 359 flow [2023-08-24 12:49:36,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 345 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 12:49:36,241 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 145 flow [2023-08-24 12:49:36,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2023-08-24 12:49:36,242 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2023-08-24 12:49:36,242 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 145 flow [2023-08-24 12:49:36,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states 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:49:36,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:49:36,242 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:49:36,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-24 12:49:36,449 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:49:36,449 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:49:36,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:49:36,449 INFO L85 PathProgramCache]: Analyzing trace with hash -946810494, now seen corresponding path program 1 times [2023-08-24 12:49:36,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:49:36,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004518715] [2023-08-24 12:49:36,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:36,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:49:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:36,506 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:49:36,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:49:36,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004518715] [2023-08-24 12:49:36,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004518715] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:49:36,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936491858] [2023-08-24 12:49:36,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:36,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:49:36,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:49:36,507 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:49:36,509 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:49:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:36,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 12:49:36,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:49:36,602 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:49:36,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:49:36,645 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:49:36,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936491858] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:49:36,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:49:36,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-24 12:49:36,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228518261] [2023-08-24 12:49:36,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:49:36,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-24 12:49:36,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:49:36,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-24 12:49:36,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-24 12:49:36,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 364 [2023-08-24 12:49:36,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 145 flow. Second operand has 14 states, 14 states have (on average 152.21428571428572) internal successors, (2131), 14 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:49:36,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:49:36,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 364 [2023-08-24 12:49:36,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:49:36,706 INFO L124 PetriNetUnfolderBase]: 23/76 cut-off events. [2023-08-24 12:49:36,706 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2023-08-24 12:49:36,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 76 events. 23/76 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 136 event pairs, 0 based on Foata normal form. 18/91 useless extension candidates. Maximal degree in co-relation 155. Up to 46 conditions per place. [2023-08-24 12:49:36,706 INFO L140 encePairwiseOnDemand]: 359/364 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2023-08-24 12:49:36,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 234 flow [2023-08-24 12:49:36,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 12:49:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-24 12:49:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2146 transitions. [2023-08-24 12:49:36,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42111459968602827 [2023-08-24 12:49:36,710 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2146 transitions. [2023-08-24 12:49:36,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2146 transitions. [2023-08-24 12:49:36,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:49:36,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2146 transitions. [2023-08-24 12:49:36,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 153.28571428571428) internal successors, (2146), 14 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:49:36,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 364.0) internal successors, (5460), 15 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:49:36,719 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 364.0) internal successors, (5460), 15 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:49:36,719 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 145 flow. Second operand 14 states and 2146 transitions. [2023-08-24 12:49:36,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 234 flow [2023-08-24 12:49:36,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 213 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-24 12:49:36,720 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2023-08-24 12:49:36,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=45, PETRI_TRANSITIONS=0} [2023-08-24 12:49:36,721 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2023-08-24 12:49:36,721 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2023-08-24 12:49:36,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 152.21428571428572) internal successors, (2131), 14 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:49:36,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-24 12:49:36,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-24 12:49:36,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-24 12:49:36,731 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:49:36,928 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:49:36,929 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-08-24 12:49:36,930 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-24 12:49:36,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 196 transitions, 400 flow [2023-08-24 12:49:36,947 INFO L124 PetriNetUnfolderBase]: 45/268 cut-off events. [2023-08-24 12:49:36,947 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-24 12:49:36,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 268 events. 45/268 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 837 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 148. Up to 8 conditions per place. [2023-08-24 12:49:36,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 196 transitions, 400 flow [2023-08-24 12:49:36,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 191 transitions, 387 flow [2023-08-24 12:49:36,949 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 12:49:36,949 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 191 transitions, 387 flow [2023-08-24 12:49:36,949 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 191 transitions, 387 flow [2023-08-24 12:49:36,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 191 transitions, 387 flow [2023-08-24 12:49:36,961 INFO L124 PetriNetUnfolderBase]: 44/263 cut-off events. [2023-08-24 12:49:36,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:49:36,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 263 events. 44/263 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 800 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 148. Up to 8 conditions per place. [2023-08-24 12:49:36,965 INFO L119 LiptonReduction]: Number of co-enabled transitions 11076 [2023-08-24 12:49:38,986 INFO L134 LiptonReduction]: Checked pairs total: 17406 [2023-08-24 12:49:38,987 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-08-24 12:49:38,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-24 12:49:38,988 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70638694, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 12:49:38,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-24 12:49:38,990 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 12:49:38,990 INFO L124 PetriNetUnfolderBase]: 7/31 cut-off events. [2023-08-24 12:49:38,990 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:49:38,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:49:38,991 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-24 12:49:38,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:49:38,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:49:38,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1645546535, now seen corresponding path program 1 times [2023-08-24 12:49:38,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:49:38,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087039646] [2023-08-24 12:49:38,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:38,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:49:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:39,006 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:49:39,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:49:39,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087039646] [2023-08-24 12:49:39,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087039646] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:49:39,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:49:39,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 12:49:39,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777731281] [2023-08-24 12:49:39,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:49:39,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:49:39,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:49:39,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:49:39,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 12:49:39,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 360 [2023-08-24 12:49:39,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:49:39,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:49:39,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 360 [2023-08-24 12:49:39,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:49:39,069 INFO L124 PetriNetUnfolderBase]: 272/611 cut-off events. [2023-08-24 12:49:39,069 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:49:39,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 611 events. 272/611 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3013 event pairs, 238 based on Foata normal form. 118/638 useless extension candidates. Maximal degree in co-relation 1092. Up to 528 conditions per place. [2023-08-24 12:49:39,070 INFO L140 encePairwiseOnDemand]: 335/360 looper letters, 20 selfloop transitions, 2 changer transitions 18/45 dead transitions. [2023-08-24 12:49:39,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 167 flow [2023-08-24 12:49:39,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:49:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:49:39,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2023-08-24 12:49:39,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2023-08-24 12:49:39,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 530 transitions. [2023-08-24 12:49:39,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 530 transitions. [2023-08-24 12:49:39,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:49:39,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 530 transitions. [2023-08-24 12:49:39,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:49:39,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states 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:49:39,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states 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:49:39,074 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 530 transitions. [2023-08-24 12:49:39,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 167 flow [2023-08-24 12:49:39,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 167 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:49:39,075 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 69 flow [2023-08-24 12:49:39,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2023-08-24 12:49:39,075 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-08-24 12:49:39,076 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 69 flow [2023-08-24 12:49:39,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:49:39,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:49:39,076 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-24 12:49:39,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 12:49:39,076 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:49:39,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:49:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash -76144654, now seen corresponding path program 1 times [2023-08-24 12:49:39,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:49:39,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283741058] [2023-08-24 12:49:39,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:39,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:49:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:39,096 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:49:39,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:49:39,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283741058] [2023-08-24 12:49:39,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283741058] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:49:39,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60275091] [2023-08-24 12:49:39,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:39,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:49:39,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:49:39,098 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:49:39,100 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:49:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:39,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 12:49:39,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:49:39,158 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:49:39,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:49:39,168 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:49:39,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60275091] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:49:39,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:49:39,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 12:49:39,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855893371] [2023-08-24 12:49:39,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:49:39,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:49:39,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:49:39,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:49:39,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-24 12:49:39,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 360 [2023-08-24 12:49:39,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 27 transitions, 69 flow. Second operand has 7 states, 7 states have (on average 158.57142857142858) internal successors, (1110), 7 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states 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:49:39,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:49:39,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 360 [2023-08-24 12:49:39,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:49:39,203 INFO L124 PetriNetUnfolderBase]: 47/128 cut-off events. [2023-08-24 12:49:39,203 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:49:39,204 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 359 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:49:39,204 INFO L140 encePairwiseOnDemand]: 357/360 looper letters, 20 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-24 12:49:39,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 131 flow [2023-08-24 12:49:39,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:49:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:49:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 970 transitions. [2023-08-24 12:49:39,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44907407407407407 [2023-08-24 12:49:39,206 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 970 transitions. [2023-08-24 12:49:39,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 970 transitions. [2023-08-24 12:49:39,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:49:39,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 970 transitions. [2023-08-24 12:49:39,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.66666666666666) internal successors, (970), 6 states have internal predecessors, (970), 0 states have call successors, (0), 0 states 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:49:39,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 360.0) internal successors, (2520), 7 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states 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:49:39,210 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 360.0) internal successors, (2520), 7 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states 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:49:39,210 INFO L175 Difference]: Start difference. First operand has 47 places, 27 transitions, 69 flow. Second operand 6 states and 970 transitions. [2023-08-24 12:49:39,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 131 flow [2023-08-24 12:49:39,210 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:49:39,211 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2023-08-24 12:49:39,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, 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:49:39,211 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-08-24 12:49:39,211 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2023-08-24 12:49:39,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.57142857142858) internal successors, (1110), 7 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states 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:49:39,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:49:39,212 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-24 12:49:39,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 12:49:39,416 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:49:39,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:49:39,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:49:39,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1029812761, now seen corresponding path program 2 times [2023-08-24 12:49:39,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:49:39,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85545381] [2023-08-24 12:49:39,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:39,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:49:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:39,486 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:49:39,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:49:39,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85545381] [2023-08-24 12:49:39,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85545381] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:49:39,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109154380] [2023-08-24 12:49:39,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:49:39,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:49:39,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:49:39,487 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:49:39,489 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:49:39,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:49:39,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:49:39,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 12:49:39,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:49:39,560 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:49:39,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:49:39,595 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:49:39,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109154380] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:49:39,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:49:39,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-24 12:49:39,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417568329] [2023-08-24 12:49:39,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:49:39,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 12:49:39,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:49:39,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 12:49:39,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-24 12:49:39,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 360 [2023-08-24 12:49:39,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 101 flow. Second operand has 13 states, 13 states have (on average 158.30769230769232) internal successors, (2058), 13 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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:49:39,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:49:39,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 360 [2023-08-24 12:49:39,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:49:39,641 INFO L124 PetriNetUnfolderBase]: 47/134 cut-off events. [2023-08-24 12:49:39,641 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-24 12:49:39,641 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 359 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:49:39,642 INFO L140 encePairwiseOnDemand]: 357/360 looper letters, 20 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2023-08-24 12:49:39,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 199 flow [2023-08-24 12:49:39,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 12:49:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 12:49:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1921 transitions. [2023-08-24 12:49:39,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4446759259259259 [2023-08-24 12:49:39,646 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1921 transitions. [2023-08-24 12:49:39,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1921 transitions. [2023-08-24 12:49:39,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:49:39,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1921 transitions. [2023-08-24 12:49:39,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 160.08333333333334) internal successors, (1921), 12 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states 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:49:39,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 360.0) internal successors, (4680), 13 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states 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:49:39,654 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 360.0) internal successors, (4680), 13 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states 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:49:39,654 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 12 states and 1921 transitions. [2023-08-24 12:49:39,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 199 flow [2023-08-24 12:49:39,654 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:49:39,655 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 171 flow [2023-08-24 12:49:39,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, 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:49:39,655 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-08-24 12:49:39,655 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 171 flow [2023-08-24 12:49:39,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 158.30769230769232) internal successors, (2058), 13 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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:49:39,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:49:39,656 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-24 12:49:39,663 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:49:39,861 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:49:39,861 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:49:39,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:49:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1265650823, now seen corresponding path program 3 times [2023-08-24 12:49:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:49:39,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527244617] [2023-08-24 12:49:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:39,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:49:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 12:49:39,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 12:49:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 12:49:39,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 12:49:39,930 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 12:49:39,930 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-24 12:49:39,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 12:49:39,930 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-24 12:49:39,930 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-24 12:49:39,931 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 12:49:39,931 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-24 12:49:39,947 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-24 12:49:39,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 269 transitions, 556 flow [2023-08-24 12:49:39,973 INFO L124 PetriNetUnfolderBase]: 75/438 cut-off events. [2023-08-24 12:49:39,973 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-24 12:49:39,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 438 events. 75/438 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1742 event pairs, 0 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 270. Up to 12 conditions per place. [2023-08-24 12:49:39,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 269 transitions, 556 flow [2023-08-24 12:49:39,977 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 269 transitions, 556 flow [2023-08-24 12:49:39,977 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 12:49:39,977 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 229 places, 269 transitions, 556 flow [2023-08-24 12:49:39,977 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 269 transitions, 556 flow [2023-08-24 12:49:39,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 269 transitions, 556 flow [2023-08-24 12:49:40,001 INFO L124 PetriNetUnfolderBase]: 75/438 cut-off events. [2023-08-24 12:49:40,001 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-24 12:49:40,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 438 events. 75/438 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1742 event pairs, 0 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 270. Up to 12 conditions per place. [2023-08-24 12:49:40,015 INFO L119 LiptonReduction]: Number of co-enabled transitions 33796 [2023-08-24 12:49:42,546 INFO L134 LiptonReduction]: Checked pairs total: 58206 [2023-08-24 12:49:42,547 INFO L136 LiptonReduction]: Total number of compositions: 222 [2023-08-24 12:49:42,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 12:49:42,550 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;@70638694, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 12:49:42,550 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 12:49:42,552 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 12:49:42,552 INFO L124 PetriNetUnfolderBase]: 8/30 cut-off events. [2023-08-24 12:49:42,552 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:49:42,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:49:42,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-24 12:49:42,552 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:49:42,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:49:42,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1713447269, now seen corresponding path program 1 times [2023-08-24 12:49:42,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:49:42,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338548521] [2023-08-24 12:49:42,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:42,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:49:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:42,570 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:49:42,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:49:42,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338548521] [2023-08-24 12:49:42,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338548521] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:49:42,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:49:42,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 12:49:42,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504270802] [2023-08-24 12:49:42,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:49:42,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:49:42,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:49:42,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:49:42,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 12:49:42,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 491 [2023-08-24 12:49:42,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states 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:49:42,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:49:42,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 491 [2023-08-24 12:49:42,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:49:43,573 INFO L124 PetriNetUnfolderBase]: 10521/16515 cut-off events. [2023-08-24 12:49:43,573 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-08-24 12:49:43,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32050 conditions, 16515 events. 10521/16515 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 109430 event pairs, 9818 based on Foata normal form. 2499/16448 useless extension candidates. Maximal degree in co-relation 13969. Up to 15431 conditions per place. [2023-08-24 12:49:43,627 INFO L140 encePairwiseOnDemand]: 457/491 looper letters, 56 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-24 12:49:43,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 274 flow [2023-08-24 12:49:43,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:49:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:49:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 735 transitions. [2023-08-24 12:49:43,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4989816700610998 [2023-08-24 12:49:43,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 735 transitions. [2023-08-24 12:49:43,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 735 transitions. [2023-08-24 12:49:43,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:49:43,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 735 transitions. [2023-08-24 12:49:43,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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:49:43,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 491.0) internal successors, (1964), 4 states have internal predecessors, (1964), 0 states have call successors, (0), 0 states 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:49:43,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 491.0) internal successors, (1964), 4 states have internal predecessors, (1964), 0 states have call successors, (0), 0 states 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:49:43,633 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 218 flow. Second operand 3 states and 735 transitions. [2023-08-24 12:49:43,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 274 flow [2023-08-24 12:49:43,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 274 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:49:43,635 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-08-24 12:49:43,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, 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:49:43,636 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-24 12:49:43,636 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-08-24 12:49:43,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states 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:49:43,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:49:43,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:49:43,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 12:49:43,637 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:49:43,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:49:43,637 INFO L85 PathProgramCache]: Analyzing trace with hash 754930640, now seen corresponding path program 1 times [2023-08-24 12:49:43,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:49:43,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380274747] [2023-08-24 12:49:43,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:43,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:49:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:43,667 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:49:43,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:49:43,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380274747] [2023-08-24 12:49:43,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380274747] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:49:43,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767250201] [2023-08-24 12:49:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:43,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:49:43,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:49:43,668 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:49:43,670 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:49:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:43,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-24 12:49:43,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:49:43,735 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:49:43,735 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:49:43,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767250201] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:49:43,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:49:43,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-24 12:49:43,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523034546] [2023-08-24 12:49:43,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:49:43,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:49:43,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:49:43,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:49:43,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 12:49:43,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 491 [2023-08-24 12:49:43,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states 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:49:43,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:49:43,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 491 [2023-08-24 12:49:43,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:49:44,547 INFO L124 PetriNetUnfolderBase]: 10399/16491 cut-off events. [2023-08-24 12:49:44,547 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2023-08-24 12:49:44,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32041 conditions, 16491 events. 10399/16491 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 111674 event pairs, 4650 based on Foata normal form. 0/13963 useless extension candidates. Maximal degree in co-relation 32028. Up to 15399 conditions per place. [2023-08-24 12:49:44,598 INFO L140 encePairwiseOnDemand]: 488/491 looper letters, 74 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-08-24 12:49:44,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 356 flow [2023-08-24 12:49:44,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:49:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:49:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2023-08-24 12:49:44,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894772572980312 [2023-08-24 12:49:44,600 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 721 transitions. [2023-08-24 12:49:44,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 721 transitions. [2023-08-24 12:49:44,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:49:44,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 721 transitions. [2023-08-24 12:49:44,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states 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:49:44,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 491.0) internal successors, (1964), 4 states have internal predecessors, (1964), 0 states have call successors, (0), 0 states 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:49:44,603 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 491.0) internal successors, (1964), 4 states have internal predecessors, (1964), 0 states have call successors, (0), 0 states 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:49:44,603 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 721 transitions. [2023-08-24 12:49:44,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 356 flow [2023-08-24 12:49:44,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 88 transitions, 352 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 12:49:44,606 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-08-24 12:49:44,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, 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:49:44,607 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-24 12:49:44,607 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-08-24 12:49:44,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states 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:49:44,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:49:44,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:49:44,622 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:49:44,812 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:49:44,812 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:49:44,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:49:44,813 INFO L85 PathProgramCache]: Analyzing trace with hash -761976402, now seen corresponding path program 1 times [2023-08-24 12:49:44,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:49:44,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731242942] [2023-08-24 12:49:44,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:44,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:49:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:44,845 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:49:44,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:49:44,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731242942] [2023-08-24 12:49:44,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731242942] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:49:44,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325267741] [2023-08-24 12:49:44,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:44,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:49:44,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:49:44,847 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:49:44,848 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:49:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:44,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 12:49:44,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:49:44,916 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:49:44,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:49:44,926 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:49:44,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325267741] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:49:44,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:49:44,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 12:49:44,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856241717] [2023-08-24 12:49:44,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:49:44,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:49:44,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:49:44,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:49:44,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-24 12:49:44,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 491 [2023-08-24 12:49:44,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states 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:49:44,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:49:44,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 491 [2023-08-24 12:49:44,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:49:45,922 INFO L124 PetriNetUnfolderBase]: 10623/16504 cut-off events. [2023-08-24 12:49:45,922 INFO L125 PetriNetUnfolderBase]: For 685/685 co-relation queries the response was YES. [2023-08-24 12:49:45,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32633 conditions, 16504 events. 10623/16504 cut-off events. For 685/685 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 108061 event pairs, 9818 based on Foata normal form. 3/14244 useless extension candidates. Maximal degree in co-relation 32605. Up to 15417 conditions per place. [2023-08-24 12:49:45,968 INFO L140 encePairwiseOnDemand]: 488/491 looper letters, 57 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-24 12:49:45,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 312 flow [2023-08-24 12:49:45,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:49:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:49:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1354 transitions. [2023-08-24 12:49:45,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4596062457569586 [2023-08-24 12:49:45,971 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1354 transitions. [2023-08-24 12:49:45,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1354 transitions. [2023-08-24 12:49:45,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:49:45,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1354 transitions. [2023-08-24 12:49:45,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states 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:49:45,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 491.0) internal successors, (3437), 7 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states 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:49:45,986 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 491.0) internal successors, (3437), 7 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states 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:49:45,986 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1354 transitions. [2023-08-24 12:49:45,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 312 flow [2023-08-24 12:49:45,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 12:49:45,988 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-08-24 12:49:45,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, 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:49:45,989 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-08-24 12:49:45,989 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-08-24 12:49:45,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states 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:49:45,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:49:45,989 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:49:46,003 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:49:46,194 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:49:46,195 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:49:46,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:49:46,195 INFO L85 PathProgramCache]: Analyzing trace with hash 419625155, now seen corresponding path program 2 times [2023-08-24 12:49:46,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:49:46,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559927811] [2023-08-24 12:49:46,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:46,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:49:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:46,256 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:49:46,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:49:46,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559927811] [2023-08-24 12:49:46,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559927811] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:49:46,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513187845] [2023-08-24 12:49:46,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:49:46,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:49:46,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:49:46,258 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:49:46,260 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:49:46,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 12:49:46,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:49:46,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-24 12:49:46,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:49:46,330 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:49:46,359 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:49:46,360 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:49:46,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 12:49:46,402 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:49:46,403 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:49:46,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513187845] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:49:46,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:49:46,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-24 12:49:46,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100628159] [2023-08-24 12:49:46,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:49:46,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 12:49:46,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:49:46,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 12:49:46,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-24 12:49:46,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 491 [2023-08-24 12:49:46,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 182.5) internal successors, (1095), 6 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states 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:49:46,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:49:46,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 491 [2023-08-24 12:49:46,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:49:47,409 INFO L124 PetriNetUnfolderBase]: 11566/18234 cut-off events. [2023-08-24 12:49:47,409 INFO L125 PetriNetUnfolderBase]: For 706/706 co-relation queries the response was YES. [2023-08-24 12:49:47,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36407 conditions, 18234 events. 11566/18234 cut-off events. For 706/706 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 124845 event pairs, 2815 based on Foata normal form. 0/16003 useless extension candidates. Maximal degree in co-relation 36371. Up to 13532 conditions per place. [2023-08-24 12:49:47,447 INFO L140 encePairwiseOnDemand]: 482/491 looper letters, 135 selfloop transitions, 14 changer transitions 9/169 dead transitions. [2023-08-24 12:49:47,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 169 transitions, 747 flow [2023-08-24 12:49:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:49:47,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:49:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1241 transitions. [2023-08-24 12:49:47,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212491513917176 [2023-08-24 12:49:47,450 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1241 transitions. [2023-08-24 12:49:47,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1241 transitions. [2023-08-24 12:49:47,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:49:47,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1241 transitions. [2023-08-24 12:49:47,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 206.83333333333334) internal successors, (1241), 6 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states 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:49:47,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 491.0) internal successors, (3437), 7 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states 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:49:47,454 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 491.0) internal successors, (3437), 7 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states 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:49:47,454 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1241 transitions. [2023-08-24 12:49:47,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 169 transitions, 747 flow [2023-08-24 12:49:47,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 169 transitions, 733 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 12:49:47,457 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 280 flow [2023-08-24 12:49:47,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, 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:49:47,457 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-08-24 12:49:47,457 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 280 flow [2023-08-24 12:49:47,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.5) internal successors, (1095), 6 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states 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:49:47,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:49:47,458 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:49:47,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-24 12:49:47,663 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:49:47,663 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:49:47,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:49:47,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1628618498, now seen corresponding path program 1 times [2023-08-24 12:49:47,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:49:47,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869539659] [2023-08-24 12:49:47,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:47,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:49:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:47,710 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:49:47,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:49:47,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869539659] [2023-08-24 12:49:47,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869539659] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:49:47,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034423278] [2023-08-24 12:49:47,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:47,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:49:47,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:49:47,711 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:49:47,736 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:49:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:47,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 12:49:47,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:49:47,796 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:49:47,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:49:47,833 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:49:47,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034423278] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:49:47,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:49:47,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-24 12:49:47,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206926290] [2023-08-24 12:49:47,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:49:47,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 12:49:47,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:49:47,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 12:49:47,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-24 12:49:47,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 491 [2023-08-24 12:49:47,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 280 flow. Second operand has 13 states, 13 states have (on average 216.6153846153846) internal successors, (2816), 13 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states 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:49:47,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:49:47,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 491 [2023-08-24 12:49:47,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:49:49,026 INFO L124 PetriNetUnfolderBase]: 11004/17512 cut-off events. [2023-08-24 12:49:49,026 INFO L125 PetriNetUnfolderBase]: For 3607/3607 co-relation queries the response was YES. [2023-08-24 12:49:49,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38053 conditions, 17512 events. 11004/17512 cut-off events. For 3607/3607 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 120595 event pairs, 9683 based on Foata normal form. 6/16099 useless extension candidates. Maximal degree in co-relation 37995. Up to 16586 conditions per place. [2023-08-24 12:49:49,094 INFO L140 encePairwiseOnDemand]: 488/491 looper letters, 69 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2023-08-24 12:49:49,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 476 flow [2023-08-24 12:49:49,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 12:49:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 12:49:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2653 transitions. [2023-08-24 12:49:49,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4502715546503734 [2023-08-24 12:49:49,100 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2653 transitions. [2023-08-24 12:49:49,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2653 transitions. [2023-08-24 12:49:49,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:49:49,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2653 transitions. [2023-08-24 12:49:49,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 221.08333333333334) internal successors, (2653), 12 states have internal predecessors, (2653), 0 states have call successors, (0), 0 states 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:49:49,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 491.0) internal successors, (6383), 13 states have internal predecessors, (6383), 0 states have call successors, (0), 0 states 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:49:49,110 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 491.0) internal successors, (6383), 13 states have internal predecessors, (6383), 0 states have call successors, (0), 0 states 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:49:49,110 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 280 flow. Second operand 12 states and 2653 transitions. [2023-08-24 12:49:49,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 476 flow [2023-08-24 12:49:49,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 476 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:49:49,115 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 364 flow [2023-08-24 12:49:49,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, 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:49:49,116 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 36 predicate places. [2023-08-24 12:49:49,116 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 364 flow [2023-08-24 12:49:49,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 216.6153846153846) internal successors, (2816), 13 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states 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:49:49,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:49:49,116 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:49:49,139 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:49:49,321 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:49:49,321 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:49:49,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:49:49,321 INFO L85 PathProgramCache]: Analyzing trace with hash 339769122, now seen corresponding path program 2 times [2023-08-24 12:49:49,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:49:49,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309934284] [2023-08-24 12:49:49,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:49,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:49:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:49,595 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:49:49,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:49:49,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309934284] [2023-08-24 12:49:49,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309934284] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:49:49,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215243062] [2023-08-24 12:49:49,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:49:49,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:49:49,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:49:49,600 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:49:49,601 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:49:49,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:49:49,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:49:49,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-24 12:49:49,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:49:49,732 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:49:49,773 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:49:49,773 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:49:49,783 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 12:49:49,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:49:49,823 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:49:49,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:50:01,892 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_397) |c_~#a~0.base|))) is different from false [2023-08-24 12:50:01,956 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:01,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215243062] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:50:01,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:50:01,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-24 12:50:01,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571498211] [2023-08-24 12:50:01,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:50:01,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 12:50:01,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:50:01,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 12:50:01,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=4, NotChecked=18, Total=132 [2023-08-24 12:50:01,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 491 [2023-08-24 12:50:01,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 364 flow. Second operand has 12 states, 12 states have (on average 183.5) internal successors, (2202), 12 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states 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:01,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:50:01,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 491 [2023-08-24 12:50:01,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:50:03,214 INFO L124 PetriNetUnfolderBase]: 11333/18098 cut-off events. [2023-08-24 12:50:03,214 INFO L125 PetriNetUnfolderBase]: For 3670/3670 co-relation queries the response was YES. [2023-08-24 12:50:03,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39169 conditions, 18098 events. 11333/18098 cut-off events. For 3670/3670 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 125029 event pairs, 2436 based on Foata normal form. 0/16831 useless extension candidates. Maximal degree in co-relation 39086. Up to 13483 conditions per place. [2023-08-24 12:50:03,307 INFO L140 encePairwiseOnDemand]: 483/491 looper letters, 132 selfloop transitions, 20 changer transitions 14/177 dead transitions. [2023-08-24 12:50:03,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 177 transitions, 916 flow [2023-08-24 12:50:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:50:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:50:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1236 transitions. [2023-08-24 12:50:03,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195519348268839 [2023-08-24 12:50:03,310 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1236 transitions. [2023-08-24 12:50:03,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1236 transitions. [2023-08-24 12:50:03,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:50:03,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1236 transitions. [2023-08-24 12:50:03,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 491.0) internal successors, (3437), 7 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states 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,315 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 491.0) internal successors, (3437), 7 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states 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,315 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 364 flow. Second operand 6 states and 1236 transitions. [2023-08-24 12:50:03,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 177 transitions, 916 flow [2023-08-24 12:50:03,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 177 transitions, 868 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-24 12:50:03,322 INFO L231 Difference]: Finished difference. Result has 106 places, 100 transitions, 411 flow [2023-08-24 12:50:03,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, 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=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=411, PETRI_PLACES=106, PETRI_TRANSITIONS=100} [2023-08-24 12:50:03,323 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 38 predicate places. [2023-08-24 12:50:03,323 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 100 transitions, 411 flow [2023-08-24 12:50:03,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 183.5) internal successors, (2202), 12 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states 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,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:50:03,324 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:50:03,345 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:50:03,528 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:50:03,529 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:50:03,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:50:03,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1941032041, now seen corresponding path program 1 times [2023-08-24 12:50:03,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:50:03,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207663392] [2023-08-24 12:50:03,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:50:03,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:50:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:50:03,585 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:50:03,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:50:03,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207663392] [2023-08-24 12:50:03,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207663392] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:50:03,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039026894] [2023-08-24 12:50:03,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:50:03,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:50:03,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:50:03,587 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:50:03,589 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:50:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:50:03,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 12:50:03,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:50:03,696 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:50:03,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:50:03,711 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:50:03,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039026894] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:50:03,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:50:03,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-24 12:50:03,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453499069] [2023-08-24 12:50:03,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:50:03,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:50:03,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:50:03,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:50:03,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-24 12:50:03,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 491 [2023-08-24 12:50:03,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 100 transitions, 411 flow. Second operand has 7 states, 7 states have (on average 218.71428571428572) internal successors, (1531), 7 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states 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,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:50:03,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 491 [2023-08-24 12:50:03,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:50:03,969 INFO L124 PetriNetUnfolderBase]: 1336/2544 cut-off events. [2023-08-24 12:50:03,969 INFO L125 PetriNetUnfolderBase]: For 1179/1179 co-relation queries the response was YES. [2023-08-24 12:50:03,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6177 conditions, 2544 events. 1336/2544 cut-off events. For 1179/1179 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 15837 event pairs, 92 based on Foata normal form. 289/2730 useless extension candidates. Maximal degree in co-relation 6115. Up to 1577 conditions per place. [2023-08-24 12:50:03,976 INFO L140 encePairwiseOnDemand]: 488/491 looper letters, 92 selfloop transitions, 3 changer transitions 14/116 dead transitions. [2023-08-24 12:50:03,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 116 transitions, 624 flow [2023-08-24 12:50:03,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 12:50:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 12:50:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1164 transitions. [2023-08-24 12:50:03,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4741344195519348 [2023-08-24 12:50:03,979 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1164 transitions. [2023-08-24 12:50:03,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1164 transitions. [2023-08-24 12:50:03,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:50:03,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1164 transitions. [2023-08-24 12:50:03,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 232.8) internal successors, (1164), 5 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states 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,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 491.0) internal successors, (2946), 6 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states 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,984 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 491.0) internal successors, (2946), 6 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states 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,984 INFO L175 Difference]: Start difference. First operand has 106 places, 100 transitions, 411 flow. Second operand 5 states and 1164 transitions. [2023-08-24 12:50:03,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 116 transitions, 624 flow [2023-08-24 12:50:03,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 116 transitions, 604 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-24 12:50:03,989 INFO L231 Difference]: Finished difference. Result has 82 places, 56 transitions, 220 flow [2023-08-24 12:50:03,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=82, PETRI_TRANSITIONS=56} [2023-08-24 12:50:03,989 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 14 predicate places. [2023-08-24 12:50:03,989 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 56 transitions, 220 flow [2023-08-24 12:50:03,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 218.71428571428572) internal successors, (1531), 7 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states 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,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:50:03,990 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:50:03,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-24 12:50:04,194 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:50:04,194 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:50:04,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:50:04,194 INFO L85 PathProgramCache]: Analyzing trace with hash -748279554, now seen corresponding path program 1 times [2023-08-24 12:50:04,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:50:04,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970437513] [2023-08-24 12:50:04,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:50:04,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:50:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:50:04,306 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:50:04,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:50:04,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970437513] [2023-08-24 12:50:04,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970437513] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:50:04,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:50:04,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 12:50:04,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156168515] [2023-08-24 12:50:04,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:50:04,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 12:50:04,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:50:04,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 12:50:04,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 12:50:04,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 491 [2023-08-24 12:50:04,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 56 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 186.4) internal successors, (932), 5 states have internal predecessors, (932), 0 states have call successors, (0), 0 states 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:04,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:50:04,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 491 [2023-08-24 12:50:04,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:50:04,442 INFO L124 PetriNetUnfolderBase]: 513/1008 cut-off events. [2023-08-24 12:50:04,442 INFO L125 PetriNetUnfolderBase]: For 726/726 co-relation queries the response was YES. [2023-08-24 12:50:04,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2551 conditions, 1008 events. 513/1008 cut-off events. For 726/726 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5094 event pairs, 175 based on Foata normal form. 108/1028 useless extension candidates. Maximal degree in co-relation 2493. Up to 568 conditions per place. [2023-08-24 12:50:04,446 INFO L140 encePairwiseOnDemand]: 478/491 looper letters, 51 selfloop transitions, 13 changer transitions 4/74 dead transitions. [2023-08-24 12:50:04,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 74 transitions, 419 flow [2023-08-24 12:50:04,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 12:50:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 12:50:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 788 transitions. [2023-08-24 12:50:04,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40122199592668023 [2023-08-24 12:50:04,448 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 788 transitions. [2023-08-24 12:50:04,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 788 transitions. [2023-08-24 12:50:04,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:50:04,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 788 transitions. [2023-08-24 12:50:04,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states 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:04,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 491.0) internal successors, (2455), 5 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states 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:04,452 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 491.0) internal successors, (2455), 5 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states 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:04,452 INFO L175 Difference]: Start difference. First operand has 82 places, 56 transitions, 220 flow. Second operand 4 states and 788 transitions. [2023-08-24 12:50:04,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 74 transitions, 419 flow [2023-08-24 12:50:04,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 74 transitions, 408 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-24 12:50:04,454 INFO L231 Difference]: Finished difference. Result has 81 places, 58 transitions, 259 flow [2023-08-24 12:50:04,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=259, PETRI_PLACES=81, PETRI_TRANSITIONS=58} [2023-08-24 12:50:04,455 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 13 predicate places. [2023-08-24 12:50:04,455 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 58 transitions, 259 flow [2023-08-24 12:50:04,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 186.4) internal successors, (932), 5 states have internal predecessors, (932), 0 states have call successors, (0), 0 states 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:04,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:50:04,455 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:04,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-24 12:50:04,456 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:50:04,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:50:04,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2054940689, now seen corresponding path program 1 times [2023-08-24 12:50:04,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:50:04,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102243786] [2023-08-24 12:50:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:50:04,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:50:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:50:07,317 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:07,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:50:07,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102243786] [2023-08-24 12:50:07,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102243786] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:50:07,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476568313] [2023-08-24 12:50:07,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:50:07,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:50:07,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:50:07,319 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:50:07,321 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:50:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:50:07,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-24 12:50:07,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:50:07,428 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:07,487 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:07,487 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:07,513 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 12:50:07,542 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:07,568 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:07,627 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:07,627 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:07,668 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:07,713 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:07,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:50:07,814 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:07,817 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:19,889 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_67| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_61| Int) (v_ArrVal_585 (Array Int Int))) (or (= (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_67|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_61| |v_t_funThread2of2ForFork0_~p~0#1.offset_67|))) is different from false [2023-08-24 12:50:20,028 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:20,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476568313] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:50:20,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:50:20,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 27 [2023-08-24 12:50:20,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882454049] [2023-08-24 12:50:20,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:50:20,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 12:50:20,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:50:20,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 12:50:20,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=616, Unknown=2, NotChecked=52, Total=812 [2023-08-24 12:50:20,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 491 [2023-08-24 12:50:20,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 58 transitions, 259 flow. Second operand has 29 states, 29 states have (on average 156.0344827586207) internal successors, (4525), 29 states have internal predecessors, (4525), 0 states have call successors, (0), 0 states 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:20,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:50:20,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 491 [2023-08-24 12:50:20,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:50:20,931 INFO L124 PetriNetUnfolderBase]: 852/1692 cut-off events. [2023-08-24 12:50:20,931 INFO L125 PetriNetUnfolderBase]: For 958/964 co-relation queries the response was YES. [2023-08-24 12:50:20,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4441 conditions, 1692 events. 852/1692 cut-off events. For 958/964 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 10173 event pairs, 78 based on Foata normal form. 24/1542 useless extension candidates. Maximal degree in co-relation 4382. Up to 697 conditions per place. [2023-08-24 12:50:20,936 INFO L140 encePairwiseOnDemand]: 480/491 looper letters, 94 selfloop transitions, 33 changer transitions 24/157 dead transitions. [2023-08-24 12:50:20,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 157 transitions, 907 flow [2023-08-24 12:50:20,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-24 12:50:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-24 12:50:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3842 transitions. [2023-08-24 12:50:20,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32603530210454856 [2023-08-24 12:50:20,943 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3842 transitions. [2023-08-24 12:50:20,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3842 transitions. [2023-08-24 12:50:20,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:50:20,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3842 transitions. [2023-08-24 12:50:20,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 160.08333333333334) internal successors, (3842), 24 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states 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:20,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 491.0) internal successors, (12275), 25 states have internal predecessors, (12275), 0 states have call successors, (0), 0 states 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:20,959 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 491.0) internal successors, (12275), 25 states have internal predecessors, (12275), 0 states have call successors, (0), 0 states 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:20,959 INFO L175 Difference]: Start difference. First operand has 81 places, 58 transitions, 259 flow. Second operand 24 states and 3842 transitions. [2023-08-24 12:50:20,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 157 transitions, 907 flow [2023-08-24 12:50:20,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 157 transitions, 906 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 12:50:20,963 INFO L231 Difference]: Finished difference. Result has 109 places, 73 transitions, 425 flow [2023-08-24 12:50:20,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=425, PETRI_PLACES=109, PETRI_TRANSITIONS=73} [2023-08-24 12:50:20,964 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 41 predicate places. [2023-08-24 12:50:20,964 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 73 transitions, 425 flow [2023-08-24 12:50:20,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 156.0344827586207) internal successors, (4525), 29 states have internal predecessors, (4525), 0 states have call successors, (0), 0 states 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:20,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:50:20,965 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:20,971 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:21,169 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:21,170 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:21,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:50:21,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1171747751, now seen corresponding path program 2 times [2023-08-24 12:50:21,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:50:21,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578036876] [2023-08-24 12:50:21,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:50:21,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:50:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:50:21,473 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:21,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:50:21,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578036876] [2023-08-24 12:50:21,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578036876] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:50:21,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960446879] [2023-08-24 12:50:21,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:50:21,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:50:21,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:50:21,474 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:21,476 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:21,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:50:21,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:50:21,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-24 12:50:21,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:50:21,588 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:21,635 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:21,635 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:21,646 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:21,673 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:21,691 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-24 12:50:21,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:50:21,715 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:21,728 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:21,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:50:21,749 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 12:50:21,767 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:21,767 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:21,785 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:21,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:50:21,803 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_676 (Array Int Int))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) 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_69|)) 0)))) is different from false [2023-08-24 12:50:21,809 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_674 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_69|) 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_69|)) 0)))) is different from false [2023-08-24 12:50:21,828 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:50:21,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-24 12:50:21,833 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:50:21,833 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:21,835 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-24 12:50:33,952 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_674 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_63| Int) (v_ArrVal_670 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_63| |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_670) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_63| v_ArrVal_674) |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:35,979 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:35,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960446879] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:50:35,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:50:35,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-24 12:50:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263139447] [2023-08-24 12:50:35,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:50:35,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 12:50:35,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:50:35,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 12:50:35,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=244, Unknown=7, NotChecked=108, Total=462 [2023-08-24 12:50:35,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 491 [2023-08-24 12:50:35,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 73 transitions, 425 flow. Second operand has 22 states, 22 states have (on average 162.3181818181818) internal successors, (3571), 22 states have internal predecessors, (3571), 0 states have call successors, (0), 0 states 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:35,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:50:35,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 491 [2023-08-24 12:50:35,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:50:36,494 INFO L124 PetriNetUnfolderBase]: 956/1904 cut-off events. [2023-08-24 12:50:36,494 INFO L125 PetriNetUnfolderBase]: For 5586/5592 co-relation queries the response was YES. [2023-08-24 12:50:36,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6592 conditions, 1904 events. 956/1904 cut-off events. For 5586/5592 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11980 event pairs, 82 based on Foata normal form. 3/1715 useless extension candidates. Maximal degree in co-relation 6516. Up to 911 conditions per place. [2023-08-24 12:50:36,499 INFO L140 encePairwiseOnDemand]: 482/491 looper letters, 84 selfloop transitions, 24 changer transitions 16/130 dead transitions. [2023-08-24 12:50:36,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 130 transitions, 953 flow [2023-08-24 12:50:36,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 12:50:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 12:50:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1537 transitions. [2023-08-24 12:50:36,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.347816248019914 [2023-08-24 12:50:36,502 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1537 transitions. [2023-08-24 12:50:36,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1537 transitions. [2023-08-24 12:50:36,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:50:36,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1537 transitions. [2023-08-24 12:50:36,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 170.77777777777777) internal successors, (1537), 9 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states 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:36,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 491.0) internal successors, (4910), 10 states have internal predecessors, (4910), 0 states have call successors, (0), 0 states 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:36,506 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 491.0) internal successors, (4910), 10 states have internal predecessors, (4910), 0 states have call successors, (0), 0 states 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:36,507 INFO L175 Difference]: Start difference. First operand has 109 places, 73 transitions, 425 flow. Second operand 9 states and 1537 transitions. [2023-08-24 12:50:36,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 130 transitions, 953 flow [2023-08-24 12:50:36,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 130 transitions, 873 flow, removed 10 selfloop flow, removed 23 redundant places. [2023-08-24 12:50:36,513 INFO L231 Difference]: Finished difference. Result has 96 places, 79 transitions, 469 flow [2023-08-24 12:50:36,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=469, PETRI_PLACES=96, PETRI_TRANSITIONS=79} [2023-08-24 12:50:36,514 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 28 predicate places. [2023-08-24 12:50:36,514 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 79 transitions, 469 flow [2023-08-24 12:50:36,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 162.3181818181818) internal successors, (3571), 22 states have internal predecessors, (3571), 0 states have call successors, (0), 0 states 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:36,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:50:36,515 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:36,519 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:36,719 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:36,720 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:36,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:50:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1773240028, now seen corresponding path program 1 times [2023-08-24 12:50:36,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:50:36,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089867807] [2023-08-24 12:50:36,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:50:36,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:50:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:50:37,172 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:37,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:50:37,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089867807] [2023-08-24 12:50:37,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089867807] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:50:37,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506732977] [2023-08-24 12:50:37,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:50:37,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:50:37,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:50:37,173 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:37,175 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:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:50:37,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-24 12:50:37,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:50:37,290 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:37,329 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:37,329 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:37,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 12:50:37,357 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:37,372 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:37,404 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:37,406 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:37,445 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:37,470 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:37,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:50:37,513 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:37,517 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-24 12:50:47,561 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_757 (Array Int Int)) (v_ArrVal_760 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_65| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_71| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_757) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_71| v_ArrVal_760) |v_t_funThread1of2ForFork0_~p~0#1.offset_65|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_65| |v_t_funThread2of2ForFork0_~p~0#1.offset_71|))) is different from false [2023-08-24 12:50:47,658 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:47,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506732977] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:50:47,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:50:47,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-08-24 12:50:47,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089392758] [2023-08-24 12:50:47,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:50:47,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-24 12:50:47,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:50:47,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-24 12:50:47,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=4, NotChecked=30, Total=306 [2023-08-24 12:50:47,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 491 [2023-08-24 12:50:47,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 79 transitions, 469 flow. Second operand has 18 states, 18 states have (on average 163.72222222222223) internal successors, (2947), 18 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states 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:47,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:50:47,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 491 [2023-08-24 12:50:47,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:50:48,076 INFO L124 PetriNetUnfolderBase]: 1058/2099 cut-off events. [2023-08-24 12:50:48,077 INFO L125 PetriNetUnfolderBase]: For 9346/9352 co-relation queries the response was YES. [2023-08-24 12:50:48,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8016 conditions, 2099 events. 1058/2099 cut-off events. For 9346/9352 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13495 event pairs, 186 based on Foata normal form. 12/1898 useless extension candidates. Maximal degree in co-relation 7964. Up to 1287 conditions per place. [2023-08-24 12:50:48,083 INFO L140 encePairwiseOnDemand]: 481/491 looper letters, 98 selfloop transitions, 16 changer transitions 19/139 dead transitions. [2023-08-24 12:50:48,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 139 transitions, 1033 flow [2023-08-24 12:50:48,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 12:50:48,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 12:50:48,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1549 transitions. [2023-08-24 12:50:48,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3505317945236479 [2023-08-24 12:50:48,085 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1549 transitions. [2023-08-24 12:50:48,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1549 transitions. [2023-08-24 12:50:48,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:50:48,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1549 transitions. [2023-08-24 12:50:48,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 172.11111111111111) internal successors, (1549), 9 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:50:48,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 491.0) internal successors, (4910), 10 states have internal predecessors, (4910), 0 states have call successors, (0), 0 states 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:48,089 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 491.0) internal successors, (4910), 10 states have internal predecessors, (4910), 0 states have call successors, (0), 0 states 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:48,089 INFO L175 Difference]: Start difference. First operand has 96 places, 79 transitions, 469 flow. Second operand 9 states and 1549 transitions. [2023-08-24 12:50:48,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 139 transitions, 1033 flow [2023-08-24 12:50:48,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 139 transitions, 1002 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-08-24 12:50:48,103 INFO L231 Difference]: Finished difference. Result has 102 places, 84 transitions, 553 flow [2023-08-24 12:50:48,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=553, PETRI_PLACES=102, PETRI_TRANSITIONS=84} [2023-08-24 12:50:48,103 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 34 predicate places. [2023-08-24 12:50:48,103 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 84 transitions, 553 flow [2023-08-24 12:50:48,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 163.72222222222223) internal successors, (2947), 18 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states 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:48,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:50:48,104 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:48,119 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:48,308 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:48,309 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:48,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:50:48,309 INFO L85 PathProgramCache]: Analyzing trace with hash -49495735, now seen corresponding path program 3 times [2023-08-24 12:50:48,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:50:48,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599167183] [2023-08-24 12:50:48,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:50:48,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:50:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:50:48,547 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:48,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:50:48,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599167183] [2023-08-24 12:50:48,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599167183] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:50:48,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144348052] [2023-08-24 12:50:48,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 12:50:48,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:50:48,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:50:48,549 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:48,551 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:48,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 12:50:48,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:50:48,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-24 12:50:48,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:50:48,666 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:48,710 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:48,710 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:48,725 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 12:50:48,743 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:48,758 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:48,791 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:48,791 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:48,833 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:48,859 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:48,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:50:48,903 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:48,907 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:50,925 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#a~0.base|))) is different from false [2023-08-24 12:50:50,977 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:50,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144348052] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:50:50,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:50:50,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2023-08-24 12:50:50,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966811956] [2023-08-24 12:50:50,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:50:50,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-24 12:50:50,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:50:50,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-24 12:50:50,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=214, Unknown=1, NotChecked=30, Total=306 [2023-08-24 12:50:50,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 491 [2023-08-24 12:50:50,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 84 transitions, 553 flow. Second operand has 18 states, 18 states have (on average 161.66666666666666) internal successors, (2910), 18 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states 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:50,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:50:50,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 491 [2023-08-24 12:50:50,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:50:51,490 INFO L124 PetriNetUnfolderBase]: 1104/2224 cut-off events. [2023-08-24 12:50:51,490 INFO L125 PetriNetUnfolderBase]: For 15400/15412 co-relation queries the response was YES. [2023-08-24 12:50:51,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9093 conditions, 2224 events. 1104/2224 cut-off events. For 15400/15412 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14762 event pairs, 162 based on Foata normal form. 12/2013 useless extension candidates. Maximal degree in co-relation 9037. Up to 1384 conditions per place. [2023-08-24 12:50:51,497 INFO L140 encePairwiseOnDemand]: 480/491 looper letters, 103 selfloop transitions, 17 changer transitions 20/146 dead transitions. [2023-08-24 12:50:51,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 146 transitions, 1171 flow [2023-08-24 12:50:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 12:50:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 12:50:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1693 transitions. [2023-08-24 12:50:51,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34480651731160894 [2023-08-24 12:50:51,499 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1693 transitions. [2023-08-24 12:50:51,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1693 transitions. [2023-08-24 12:50:51,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:50:51,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1693 transitions. [2023-08-24 12:50:51,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 169.3) internal successors, (1693), 10 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states 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:51,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 491.0) internal successors, (5401), 11 states have internal predecessors, (5401), 0 states have call successors, (0), 0 states 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:51,504 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 491.0) internal successors, (5401), 11 states have internal predecessors, (5401), 0 states have call successors, (0), 0 states 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:51,504 INFO L175 Difference]: Start difference. First operand has 102 places, 84 transitions, 553 flow. Second operand 10 states and 1693 transitions. [2023-08-24 12:50:51,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 146 transitions, 1171 flow [2023-08-24 12:50:51,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 146 transitions, 1053 flow, removed 47 selfloop flow, removed 5 redundant places. [2023-08-24 12:50:51,523 INFO L231 Difference]: Finished difference. Result has 110 places, 90 transitions, 584 flow [2023-08-24 12:50:51,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=584, PETRI_PLACES=110, PETRI_TRANSITIONS=90} [2023-08-24 12:50:51,524 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 42 predicate places. [2023-08-24 12:50:51,524 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 90 transitions, 584 flow [2023-08-24 12:50:51,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 161.66666666666666) internal successors, (2910), 18 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states 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:51,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:50:51,524 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:51,531 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:51,729 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:51,729 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:51,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:50:51,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1977977812, now seen corresponding path program 2 times [2023-08-24 12:50:51,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:50:51,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295035312] [2023-08-24 12:50:51,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:50:51,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:50:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:50:51,940 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:51,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:50:51,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295035312] [2023-08-24 12:50:51,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295035312] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:50:51,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537937068] [2023-08-24 12:50:51,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:50:51,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:50:51,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:50:51,942 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:51,944 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:52,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:50:52,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:50:52,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-24 12:50:52,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:50:52,071 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:52,147 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:52,147 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:52,164 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:52,189 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:52,215 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:52,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:50:52,254 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:52,286 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:50:52,287 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:52,315 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:52,341 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:52,341 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:50:52,425 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:50:52,425 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:52,431 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:50:52,431 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:52,434 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:12,540 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_69| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_932 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_69| |v_t_funThread2of2ForFork0_~p~0#1.offset_75|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_927) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_75| v_ArrVal_932) |v_t_funThread1of2ForFork0_~p~0#1.offset_69|) 0)))) is different from false [2023-08-24 12:51:14,628 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:14,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537937068] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:51:14,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:51:14,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2023-08-24 12:51:14,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341953115] [2023-08-24 12:51:14,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:51:14,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-24 12:51:14,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:51:14,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-24 12:51:14,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=296, Unknown=11, NotChecked=36, Total=420 [2023-08-24 12:51:14,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 491 [2023-08-24 12:51:14,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 90 transitions, 584 flow. Second operand has 21 states, 21 states have (on average 162.42857142857142) internal successors, (3411), 21 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states 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:14,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:51:14,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 491 [2023-08-24 12:51:14,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:51:14,913 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (= (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= 4 |c_t_funThread1of2ForFork0_~p~0#1.base|) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_930 (Array Int Int)) (v_ArrVal_932 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_932)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_69|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_930) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_69| 4)) 0)))) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (exists ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_932 Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_932) (select |c_#memory_int| 4)) (not (= |t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) is different from false [2023-08-24 12:51:14,943 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_930 (Array Int Int)) (v_ArrVal_932 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_932)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_69|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_930) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_69| 4)) 0)))) (forall ((v_ArrVal_932 Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_932)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)))) is different from false [2023-08-24 12:51:17,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:19,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:21,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:23,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:24,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:26,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:29,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:29,527 INFO L124 PetriNetUnfolderBase]: 1316/2696 cut-off events. [2023-08-24 12:51:29,527 INFO L125 PetriNetUnfolderBase]: For 13952/13976 co-relation queries the response was YES. [2023-08-24 12:51:29,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10472 conditions, 2696 events. 1316/2696 cut-off events. For 13952/13976 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 19192 event pairs, 147 based on Foata normal form. 33/2469 useless extension candidates. Maximal degree in co-relation 10412. Up to 1500 conditions per place. [2023-08-24 12:51:29,536 INFO L140 encePairwiseOnDemand]: 477/491 looper letters, 142 selfloop transitions, 38 changer transitions 31/217 dead transitions. [2023-08-24 12:51:29,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 217 transitions, 1720 flow [2023-08-24 12:51:29,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-24 12:51:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-24 12:51:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2891 transitions. [2023-08-24 12:51:29,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3463519827482928 [2023-08-24 12:51:29,539 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2891 transitions. [2023-08-24 12:51:29,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2891 transitions. [2023-08-24 12:51:29,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:51:29,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2891 transitions. [2023-08-24 12:51:29,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 170.05882352941177) internal successors, (2891), 17 states have internal predecessors, (2891), 0 states have call successors, (0), 0 states 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:29,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 491.0) internal successors, (8838), 18 states have internal predecessors, (8838), 0 states have call successors, (0), 0 states 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:29,546 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 491.0) internal successors, (8838), 18 states have internal predecessors, (8838), 0 states have call successors, (0), 0 states 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:29,546 INFO L175 Difference]: Start difference. First operand has 110 places, 90 transitions, 584 flow. Second operand 17 states and 2891 transitions. [2023-08-24 12:51:29,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 217 transitions, 1720 flow [2023-08-24 12:51:29,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 217 transitions, 1672 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-08-24 12:51:29,566 INFO L231 Difference]: Finished difference. Result has 130 places, 117 transitions, 1023 flow [2023-08-24 12:51:29,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1023, PETRI_PLACES=130, PETRI_TRANSITIONS=117} [2023-08-24 12:51:29,567 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 62 predicate places. [2023-08-24 12:51:29,567 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 117 transitions, 1023 flow [2023-08-24 12:51:29,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 162.42857142857142) internal successors, (3411), 21 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states 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:29,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:51:29,568 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:51:29,574 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:51:29,772 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:51:29,772 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:51:29,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:51:29,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1105577071, now seen corresponding path program 4 times [2023-08-24 12:51:29,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:51:29,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017852174] [2023-08-24 12:51:29,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:51:29,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:51:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:51:30,039 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:51:30,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:51:30,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017852174] [2023-08-24 12:51:30,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017852174] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:51:30,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892814280] [2023-08-24 12:51:30,040 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 12:51:30,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:51:30,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:51:30,041 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:51:30,043 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:51:30,161 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 12:51:30,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:51:30,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-24 12:51:30,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:51:30,167 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:30,236 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:51:30,237 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:30,252 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:30,283 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:30,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:51:30,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 16 treesize of output 18 [2023-08-24 12:51:30,345 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:30,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:51:30,370 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:30,397 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:30,444 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:51:30,444 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:30,469 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:51:30,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:51:30,544 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1018) |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 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1016)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1019) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|)))) is different from false [2023-08-24 12:51:30,569 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:51:30,569 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:30,575 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:51:30,576 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:30,579 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:30,603 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((v_ArrVal_1019 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int) (v_ArrVal_1016 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_71| |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_71| v_ArrVal_1016)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1019) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) 0))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1019 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int) (v_ArrVal_1016 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_71| v_ArrVal_1016)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1019) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) 0))))) is different from false [2023-08-24 12:51:30,922 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1019 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1012 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int) (v_ArrVal_1016 Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1012))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_71| v_ArrVal_1016))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1019) |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_ArrVal_1019 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1012 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int) (v_ArrVal_1016 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_71| |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1012))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_71| v_ArrVal_1016))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1019) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) 0)))) is different from false [2023-08-24 12:51:38,970 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:51:39,110 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:51:39,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892814280] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:51:39,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:51:39,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-08-24 12:51:39,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622895793] [2023-08-24 12:51:39,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:51:39,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-24 12:51:39,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:51:39,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-24 12:51:39,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=280, Unknown=3, NotChecked=114, Total=506 [2023-08-24 12:51:39,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 491 [2023-08-24 12:51:39,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 117 transitions, 1023 flow. Second operand has 23 states, 23 states have (on average 162.2173913043478) internal successors, (3731), 23 states have internal predecessors, (3731), 0 states have call successors, (0), 0 states 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:39,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:51:39,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 491 [2023-08-24 12:51:39,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:51:39,683 INFO L124 PetriNetUnfolderBase]: 1283/2666 cut-off events. [2023-08-24 12:51:39,683 INFO L125 PetriNetUnfolderBase]: For 16131/16155 co-relation queries the response was YES. [2023-08-24 12:51:39,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11847 conditions, 2666 events. 1283/2666 cut-off events. For 16131/16155 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 18988 event pairs, 134 based on Foata normal form. 3/2417 useless extension candidates. Maximal degree in co-relation 11778. Up to 1434 conditions per place. [2023-08-24 12:51:39,693 INFO L140 encePairwiseOnDemand]: 483/491 looper letters, 123 selfloop transitions, 21 changer transitions 17/167 dead transitions. [2023-08-24 12:51:39,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 167 transitions, 1628 flow [2023-08-24 12:51:39,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 12:51:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 12:51:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1533 transitions. [2023-08-24 12:51:39,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3469110658520027 [2023-08-24 12:51:39,695 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1533 transitions. [2023-08-24 12:51:39,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1533 transitions. [2023-08-24 12:51:39,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:51:39,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1533 transitions. [2023-08-24 12:51:39,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 170.33333333333334) internal successors, (1533), 9 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states 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:39,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 491.0) internal successors, (4910), 10 states have internal predecessors, (4910), 0 states have call successors, (0), 0 states 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:39,699 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 491.0) internal successors, (4910), 10 states have internal predecessors, (4910), 0 states have call successors, (0), 0 states 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:39,699 INFO L175 Difference]: Start difference. First operand has 130 places, 117 transitions, 1023 flow. Second operand 9 states and 1533 transitions. [2023-08-24 12:51:39,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 167 transitions, 1628 flow [2023-08-24 12:51:39,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 167 transitions, 1375 flow, removed 116 selfloop flow, removed 6 redundant places. [2023-08-24 12:51:39,735 INFO L231 Difference]: Finished difference. Result has 134 places, 119 transitions, 843 flow [2023-08-24 12:51:39,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=843, PETRI_PLACES=134, PETRI_TRANSITIONS=119} [2023-08-24 12:51:39,735 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 66 predicate places. [2023-08-24 12:51:39,735 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 119 transitions, 843 flow [2023-08-24 12:51:39,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 162.2173913043478) internal successors, (3731), 23 states have internal predecessors, (3731), 0 states have call successors, (0), 0 states 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:39,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:51:39,736 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:51:39,743 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:39,940 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:39,940 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:39,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:51:39,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1518619166, now seen corresponding path program 3 times [2023-08-24 12:51:39,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:51:39,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689512647] [2023-08-24 12:51:39,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:51:39,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:51:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:51:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:51:40,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:51:40,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689512647] [2023-08-24 12:51:40,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689512647] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:51:40,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136340801] [2023-08-24 12:51:40,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 12:51:40,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:51:40,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:51:40,193 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:40,222 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:40,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 12:51:40,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:51:40,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-24 12:51:40,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:51:40,318 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:40,391 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:51:40,391 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:40,409 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 12:51:40,434 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:40,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 13 treesize of output 9 [2023-08-24 12:51:40,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:51:40,497 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:40,524 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:51:40,524 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:40,547 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:40,582 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:51:40,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:51:40,631 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1103 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_1105 Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1103) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_73| 4)) 0)) (= 0 (select (select (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_1105)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_73|)))) is different from false [2023-08-24 12:51:40,644 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:51:40,644 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:40,650 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:51:40,650 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:40,653 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:44,685 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1100 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1100) |c_~#a~0.base|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-24 12:51:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 3 not checked. [2023-08-24 12:51:46,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136340801] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:51:46,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:51:46,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-24 12:51:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069404352] [2023-08-24 12:51:46,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:51:46,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-24 12:51:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:51:46,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-24 12:51:46,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=280, Unknown=2, NotChecked=70, Total=420 [2023-08-24 12:51:46,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 491 [2023-08-24 12:51:46,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 119 transitions, 843 flow. Second operand has 21 states, 21 states have (on average 160.47619047619048) internal successors, (3370), 21 states have internal predecessors, (3370), 0 states have call successors, (0), 0 states 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:46,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:51:46,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 491 [2023-08-24 12:51:46,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:51:47,433 INFO L124 PetriNetUnfolderBase]: 1350/2816 cut-off events. [2023-08-24 12:51:47,433 INFO L125 PetriNetUnfolderBase]: For 12349/12379 co-relation queries the response was YES. [2023-08-24 12:51:47,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11738 conditions, 2816 events. 1350/2816 cut-off events. For 12349/12379 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 20358 event pairs, 225 based on Foata normal form. 11/2561 useless extension candidates. Maximal degree in co-relation 11667. Up to 1738 conditions per place. [2023-08-24 12:51:47,443 INFO L140 encePairwiseOnDemand]: 480/491 looper letters, 136 selfloop transitions, 40 changer transitions 25/207 dead transitions. [2023-08-24 12:51:47,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 207 transitions, 1820 flow [2023-08-24 12:51:47,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-24 12:51:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-24 12:51:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2662 transitions. [2023-08-24 12:51:47,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3388492871690428 [2023-08-24 12:51:47,446 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2662 transitions. [2023-08-24 12:51:47,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2662 transitions. [2023-08-24 12:51:47,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:51:47,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2662 transitions. [2023-08-24 12:51:47,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 166.375) internal successors, (2662), 16 states have internal predecessors, (2662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:47,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 491.0) internal successors, (8347), 17 states have internal predecessors, (8347), 0 states have call successors, (0), 0 states 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,452 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 491.0) internal successors, (8347), 17 states have internal predecessors, (8347), 0 states have call successors, (0), 0 states 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,452 INFO L175 Difference]: Start difference. First operand has 134 places, 119 transitions, 843 flow. Second operand 16 states and 2662 transitions. [2023-08-24 12:51:47,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 207 transitions, 1820 flow [2023-08-24 12:51:47,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 207 transitions, 1789 flow, removed 1 selfloop flow, removed 6 redundant places. [2023-08-24 12:51:47,477 INFO L231 Difference]: Finished difference. Result has 145 places, 132 transitions, 1086 flow [2023-08-24 12:51:47,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1086, PETRI_PLACES=145, PETRI_TRANSITIONS=132} [2023-08-24 12:51:47,478 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 77 predicate places. [2023-08-24 12:51:47,478 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 132 transitions, 1086 flow [2023-08-24 12:51:47,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 160.47619047619048) internal successors, (3370), 21 states have internal predecessors, (3370), 0 states have call successors, (0), 0 states 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,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:51:47,478 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:47,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-24 12:51:47,683 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:47,683 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:47,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:51:47,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1909187205, now seen corresponding path program 4 times [2023-08-24 12:51:47,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:51:47,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536755423] [2023-08-24 12:51:47,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:51:47,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:51:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:51:47,873 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:47,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:51:47,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536755423] [2023-08-24 12:51:47,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536755423] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:51:47,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886806131] [2023-08-24 12:51:47,874 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 12:51:47,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:51:47,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:51:47,875 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:47,878 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:48,000 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 12:51:48,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:51:48,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-24 12:51:48,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:51:48,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:48,042 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:51:48,043 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:48,048 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:48,063 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 12:51:48,077 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-24 12:51:48,110 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:51:48,110 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:48,154 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:48,186 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:48,204 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:48,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:51:48,208 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1195 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1195) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:51:48,260 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:48,263 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-24 12:51:48,267 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1195 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_75| |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) (= (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_81| v_ArrVal_1194)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1195) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75|) 0))) is different from false [2023-08-24 12:51:48,283 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (v_ArrVal_1190 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1195 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1190))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81| v_ArrVal_1194))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1195) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_75| |v_t_funThread2of2ForFork0_~p~0#1.offset_81|))) is different from false [2023-08-24 12:51:48,376 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:48,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886806131] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:51:48,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:51:48,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 16 [2023-08-24 12:51:48,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755049459] [2023-08-24 12:51:48,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:51:48,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-24 12:51:48,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:51:48,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-24 12:51:48,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=156, Unknown=6, NotChecked=84, Total=306 [2023-08-24 12:51:48,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 491 [2023-08-24 12:51:48,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 132 transitions, 1086 flow. Second operand has 18 states, 18 states have (on average 163.66666666666666) internal successors, (2946), 18 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states 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:48,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:51:48,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 491 [2023-08-24 12:51:48,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:51:48,892 INFO L124 PetriNetUnfolderBase]: 1289/2754 cut-off events. [2023-08-24 12:51:48,893 INFO L125 PetriNetUnfolderBase]: For 13453/13477 co-relation queries the response was YES. [2023-08-24 12:51:48,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11887 conditions, 2754 events. 1289/2754 cut-off events. For 13453/13477 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 20398 event pairs, 230 based on Foata normal form. 4/2485 useless extension candidates. Maximal degree in co-relation 11814. Up to 1830 conditions per place. [2023-08-24 12:51:48,903 INFO L140 encePairwiseOnDemand]: 482/491 looper letters, 123 selfloop transitions, 11 changer transitions 44/184 dead transitions. [2023-08-24 12:51:48,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 184 transitions, 1728 flow [2023-08-24 12:51:48,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 12:51:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 12:51:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1547 transitions. [2023-08-24 12:51:48,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35007920343969223 [2023-08-24 12:51:48,912 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1547 transitions. [2023-08-24 12:51:48,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1547 transitions. [2023-08-24 12:51:48,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:51:48,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1547 transitions. [2023-08-24 12:51:48,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 171.88888888888889) internal successors, (1547), 9 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states 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:48,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 491.0) internal successors, (4910), 10 states have internal predecessors, (4910), 0 states have call successors, (0), 0 states 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:48,916 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 491.0) internal successors, (4910), 10 states have internal predecessors, (4910), 0 states have call successors, (0), 0 states 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:48,916 INFO L175 Difference]: Start difference. First operand has 145 places, 132 transitions, 1086 flow. Second operand 9 states and 1547 transitions. [2023-08-24 12:51:48,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 184 transitions, 1728 flow [2023-08-24 12:51:48,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 184 transitions, 1577 flow, removed 58 selfloop flow, removed 8 redundant places. [2023-08-24 12:51:48,948 INFO L231 Difference]: Finished difference. Result has 148 places, 124 transitions, 912 flow [2023-08-24 12:51:48,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=912, PETRI_PLACES=148, PETRI_TRANSITIONS=124} [2023-08-24 12:51:48,949 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 80 predicate places. [2023-08-24 12:51:48,949 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 124 transitions, 912 flow [2023-08-24 12:51:48,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 163.66666666666666) internal successors, (2946), 18 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states 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:48,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:51:48,949 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:48,956 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:49,154 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:49,154 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:49,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:51:49,154 INFO L85 PathProgramCache]: Analyzing trace with hash 878854652, now seen corresponding path program 5 times [2023-08-24 12:51:49,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:51:49,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696219127] [2023-08-24 12:51:49,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:51:49,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:51:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:51:49,413 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:49,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:51:49,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696219127] [2023-08-24 12:51:49,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696219127] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:51:49,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312586033] [2023-08-24 12:51:49,413 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 12:51:49,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:51:49,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:51:49,414 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:49,416 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:49,701 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-24 12:51:49,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:51:49,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-24 12:51:49,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:51:49,709 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:49,768 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:51:49,768 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:49,800 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:49,829 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:49,855 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:49,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:51:49,922 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 12:51:49,978 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:51:49,978 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:50,018 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:50,045 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:50,075 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:50,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:51:50,249 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:51:50,249 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:50,254 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:51:50,255 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:50,258 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:50,274 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:51:50,274 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:50,278 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:51:50,278 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:50,280 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:00,541 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1284 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_77| |v_t_funThread2of2ForFork0_~p~0#1.offset_83|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1280) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_1284) |v_t_funThread2of2ForFork0_~p~0#1.offset_83|) 0)))) is different from false [2023-08-24 12:52:10,599 WARN L234 SmtUtils]: Spent 10.01s 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:52:10,724 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:10,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312586033] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:52:10,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:52:10,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 19 [2023-08-24 12:52:10,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364088378] [2023-08-24 12:52:10,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:52:10,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-24 12:52:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:52:10,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-24 12:52:10,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=309, Unknown=2, NotChecked=36, Total=420 [2023-08-24 12:52:10,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 491 [2023-08-24 12:52:10,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 124 transitions, 912 flow. Second operand has 21 states, 21 states have (on average 162.47619047619048) internal successors, (3412), 21 states have internal predecessors, (3412), 0 states have call successors, (0), 0 states 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:10,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:52:10,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 491 [2023-08-24 12:52:10,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:52:14,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:52:17,368 WARN L539 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:52:17,814 INFO L124 PetriNetUnfolderBase]: 1249/2682 cut-off events. [2023-08-24 12:52:17,814 INFO L125 PetriNetUnfolderBase]: For 11265/11289 co-relation queries the response was YES. [2023-08-24 12:52:17,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11051 conditions, 2682 events. 1249/2682 cut-off events. For 11265/11289 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19820 event pairs, 129 based on Foata normal form. 13/2427 useless extension candidates. Maximal degree in co-relation 10975. Up to 1032 conditions per place. [2023-08-24 12:52:17,826 INFO L140 encePairwiseOnDemand]: 481/491 looper letters, 115 selfloop transitions, 14 changer transitions 89/224 dead transitions. [2023-08-24 12:52:17,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 224 transitions, 1916 flow [2023-08-24 12:52:17,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-24 12:52:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-24 12:52:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2706 transitions. [2023-08-24 12:52:17,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3444501018329939 [2023-08-24 12:52:17,828 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2706 transitions. [2023-08-24 12:52:17,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2706 transitions. [2023-08-24 12:52:17,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:52:17,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2706 transitions. [2023-08-24 12:52:17,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 169.125) internal successors, (2706), 16 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:17,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 491.0) internal successors, (8347), 17 states have internal predecessors, (8347), 0 states have call successors, (0), 0 states 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:17,835 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 491.0) internal successors, (8347), 17 states have internal predecessors, (8347), 0 states have call successors, (0), 0 states 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:17,836 INFO L175 Difference]: Start difference. First operand has 148 places, 124 transitions, 912 flow. Second operand 16 states and 2706 transitions. [2023-08-24 12:52:17,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 224 transitions, 1916 flow [2023-08-24 12:52:17,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 224 transitions, 1866 flow, removed 14 selfloop flow, removed 10 redundant places. [2023-08-24 12:52:17,856 INFO L231 Difference]: Finished difference. Result has 150 places, 107 transitions, 762 flow [2023-08-24 12:52:17,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=762, PETRI_PLACES=150, PETRI_TRANSITIONS=107} [2023-08-24 12:52:17,857 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 82 predicate places. [2023-08-24 12:52:17,857 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 107 transitions, 762 flow [2023-08-24 12:52:17,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 162.47619047619048) internal successors, (3412), 21 states have internal predecessors, (3412), 0 states have call successors, (0), 0 states 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:17,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:52:17,857 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:17,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-08-24 12:52:18,062 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:52:18,063 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:52:18,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:52:18,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1716719436, now seen corresponding path program 6 times [2023-08-24 12:52:18,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:52:18,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186822295] [2023-08-24 12:52:18,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:18,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:52:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:18,286 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:18,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:52:18,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186822295] [2023-08-24 12:52:18,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186822295] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:52:18,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622685551] [2023-08-24 12:52:18,286 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 12:52:18,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:52:18,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:52:18,287 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:52:18,289 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:52:18,527 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-24 12:52:18,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:52:18,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-24 12:52:18,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:52:18,537 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:18,646 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-24 12:52:18,646 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:18,669 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:18,707 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:18,741 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:18,813 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:52:18,814 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:18,885 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:18,916 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:18,941 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:18,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:52:18,947 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1376) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:52:18,999 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:19,002 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:19,006 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1374 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1376 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_79| |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) (= 0 (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_1374)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1376) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|)))) is different from false [2023-08-24 12:52:19,021 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1374 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1371))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_79| v_ArrVal_1374))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1376) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_79| |v_t_funThread2of2ForFork0_~p~0#1.offset_85|))) is different from false [2023-08-24 12:52:19,136 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:19,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622685551] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:52:19,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:52:19,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 18 [2023-08-24 12:52:19,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951346135] [2023-08-24 12:52:19,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:52:19,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-24 12:52:19,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:52:19,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-24 12:52:19,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=213, Unknown=5, NotChecked=96, Total=380 [2023-08-24 12:52:19,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 491 [2023-08-24 12:52:19,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 107 transitions, 762 flow. Second operand has 20 states, 20 states have (on average 162.65) internal successors, (3253), 20 states have internal predecessors, (3253), 0 states have call successors, (0), 0 states 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:19,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:52:19,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 491 [2023-08-24 12:52:19,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:52:21,635 INFO L124 PetriNetUnfolderBase]: 757/1693 cut-off events. [2023-08-24 12:52:21,636 INFO L125 PetriNetUnfolderBase]: For 6479/6503 co-relation queries the response was YES. [2023-08-24 12:52:21,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7192 conditions, 1693 events. 757/1693 cut-off events. For 6479/6503 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11518 event pairs, 142 based on Foata normal form. 4/1550 useless extension candidates. Maximal degree in co-relation 7148. Up to 1040 conditions per place. [2023-08-24 12:52:21,641 INFO L140 encePairwiseOnDemand]: 482/491 looper letters, 94 selfloop transitions, 8 changer transitions 41/149 dead transitions. [2023-08-24 12:52:21,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 149 transitions, 1259 flow [2023-08-24 12:52:21,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 12:52:21,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 12:52:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1529 transitions. [2023-08-24 12:52:21,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460058836840914 [2023-08-24 12:52:21,644 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1529 transitions. [2023-08-24 12:52:21,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1529 transitions. [2023-08-24 12:52:21,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:52:21,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1529 transitions. [2023-08-24 12:52:21,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 169.88888888888889) internal successors, (1529), 9 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states 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:21,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 491.0) internal successors, (4910), 10 states have internal predecessors, (4910), 0 states have call successors, (0), 0 states 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:21,647 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 491.0) internal successors, (4910), 10 states have internal predecessors, (4910), 0 states have call successors, (0), 0 states 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:21,647 INFO L175 Difference]: Start difference. First operand has 150 places, 107 transitions, 762 flow. Second operand 9 states and 1529 transitions. [2023-08-24 12:52:21,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 149 transitions, 1259 flow [2023-08-24 12:52:21,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 149 transitions, 1191 flow, removed 15 selfloop flow, removed 17 redundant places. [2023-08-24 12:52:21,658 INFO L231 Difference]: Finished difference. Result has 129 places, 100 transitions, 660 flow [2023-08-24 12:52:21,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=660, PETRI_PLACES=129, PETRI_TRANSITIONS=100} [2023-08-24 12:52:21,658 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 61 predicate places. [2023-08-24 12:52:21,658 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 100 transitions, 660 flow [2023-08-24 12:52:21,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 162.65) internal successors, (3253), 20 states have internal predecessors, (3253), 0 states have call successors, (0), 0 states 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:21,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:52:21,659 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:21,675 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:21,864 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:21,864 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:21,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:52:21,865 INFO L85 PathProgramCache]: Analyzing trace with hash 410606395, now seen corresponding path program 5 times [2023-08-24 12:52:21,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:52:21,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101010558] [2023-08-24 12:52:21,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:21,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:52:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:22,123 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:22,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:52:22,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101010558] [2023-08-24 12:52:22,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101010558] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:52:22,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231444816] [2023-08-24 12:52:22,123 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 12:52:22,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:52:22,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:52:22,126 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:22,153 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:22,668 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-24 12:52:22,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:52:22,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-24 12:52:22,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:52:22,675 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:22,750 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:52:22,751 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:22,769 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:22,794 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:22,826 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:22,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:52:22,867 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:22,898 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:52:22,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:22,934 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:22,968 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:22,986 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:22,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:52:22,990 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:52:23,077 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:52:23,077 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-24 12:52:23,084 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:52:23,084 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:23,087 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:23,319 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_87| v_ArrVal_1465)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_81| |v_t_funThread2of2ForFork0_~p~0#1.offset_87|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_87| v_ArrVal_1465)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) 0))))) is different from false [2023-08-24 12:52:23,349 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1461 (Array Int Int))) (or (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1461))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_87| v_ArrVal_1465))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|)) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_81| |v_t_funThread2of2ForFork0_~p~0#1.offset_87|))) (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1461 (Array Int Int))) (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1461))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_87| v_ArrVal_1465))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-24 12:52:31,424 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:52:31,540 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:31,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231444816] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:52:31,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:52:31,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 20 [2023-08-24 12:52:31,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654479176] [2023-08-24 12:52:31,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:52:31,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 12:52:31,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:52:31,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 12:52:31,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=275, Unknown=9, NotChecked=108, Total=462 [2023-08-24 12:52:31,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 491 [2023-08-24 12:52:31,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 100 transitions, 660 flow. Second operand has 22 states, 22 states have (on average 162.5) internal successors, (3575), 22 states have internal predecessors, (3575), 0 states have call successors, (0), 0 states 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:31,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:52:31,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 491 [2023-08-24 12:52:31,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:52:31,822 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (= (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= 4 |c_t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1464) |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_1465)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) 0))) (not (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (exists ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1465 Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1465) (select |c_#memory_int| 4)) (not (= |t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| 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_1465)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |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)))))) is different from false [2023-08-24 12:52:32,402 INFO L124 PetriNetUnfolderBase]: 658/1526 cut-off events. [2023-08-24 12:52:32,402 INFO L125 PetriNetUnfolderBase]: For 4593/4619 co-relation queries the response was YES. [2023-08-24 12:52:32,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6270 conditions, 1526 events. 658/1526 cut-off events. For 4593/4619 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10355 event pairs, 150 based on Foata normal form. 7/1407 useless extension candidates. Maximal degree in co-relation 6231. Up to 763 conditions per place. [2023-08-24 12:52:32,407 INFO L140 encePairwiseOnDemand]: 479/491 looper letters, 97 selfloop transitions, 27 changer transitions 45/175 dead transitions. [2023-08-24 12:52:32,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 175 transitions, 1434 flow [2023-08-24 12:52:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 12:52:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-24 12:52:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2366 transitions. [2023-08-24 12:52:32,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34419551934826886 [2023-08-24 12:52:32,409 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2366 transitions. [2023-08-24 12:52:32,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2366 transitions. [2023-08-24 12:52:32,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:52:32,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2366 transitions. [2023-08-24 12:52:32,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 169.0) internal successors, (2366), 14 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states 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:32,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 491.0) internal successors, (7365), 15 states have internal predecessors, (7365), 0 states have call successors, (0), 0 states 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:32,415 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 491.0) internal successors, (7365), 15 states have internal predecessors, (7365), 0 states have call successors, (0), 0 states 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:32,415 INFO L175 Difference]: Start difference. First operand has 129 places, 100 transitions, 660 flow. Second operand 14 states and 2366 transitions. [2023-08-24 12:52:32,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 175 transitions, 1434 flow [2023-08-24 12:52:32,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 175 transitions, 1393 flow, removed 11 selfloop flow, removed 12 redundant places. [2023-08-24 12:52:32,423 INFO L231 Difference]: Finished difference. Result has 128 places, 102 transitions, 730 flow [2023-08-24 12:52:32,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=730, PETRI_PLACES=128, PETRI_TRANSITIONS=102} [2023-08-24 12:52:32,424 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 60 predicate places. [2023-08-24 12:52:32,424 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 102 transitions, 730 flow [2023-08-24 12:52:32,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 162.5) internal successors, (3575), 22 states have internal predecessors, (3575), 0 states have call successors, (0), 0 states 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:32,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:52:32,424 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:32,432 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:32,630 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:32,630 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:32,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:52:32,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1012869803, now seen corresponding path program 6 times [2023-08-24 12:52:32,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:52:32,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834230156] [2023-08-24 12:52:32,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:32,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:52:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:32,894 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:32,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:52:32,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834230156] [2023-08-24 12:52:32,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834230156] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:52:32,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525120633] [2023-08-24 12:52:32,895 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 12:52:32,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:52:32,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:52:32,896 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:32,897 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:33,119 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-24 12:52:33,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:52:33,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-24 12:52:33,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:52:33,127 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:33,206 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:52:33,207 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:33,225 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:33,250 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:33,290 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:33,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:52:33,337 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:33,356 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:33,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:52:33,382 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:33,410 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:52:33,410 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:33,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 16 treesize of output 18 [2023-08-24 12:52:33,458 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:33,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:52:33,501 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1558) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_83| 4)) 0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1559) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0))) is different from false [2023-08-24 12:52:33,507 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1556 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_1556)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1559) |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_1558) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_83| 4)) 0)))) is different from false [2023-08-24 12:52:33,530 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:52:33,530 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:33,536 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:52:33,536 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:33,539 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:33,555 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1559 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1556 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_89| v_ArrVal_1556)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1559) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0))) (forall ((v_ArrVal_1559 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1556 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_89| v_ArrVal_1556)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1559) |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_89|))))) is different from false [2023-08-24 12:52:33,584 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1559 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (v_ArrVal_1552 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1556 Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1552))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_89| v_ArrVal_1556))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1559) |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_89|))) (or (forall ((v_ArrVal_1559 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (v_ArrVal_1552 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1556 Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1552))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_89| v_ArrVal_1556))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1559) |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:41,666 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:52:41,779 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:41,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525120633] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:52:41,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:52:41,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-08-24 12:52:41,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546952201] [2023-08-24 12:52:41,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:52:41,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-24 12:52:41,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:52:41,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-24 12:52:41,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=270, Unknown=7, NotChecked=148, Total=506 [2023-08-24 12:52:41,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 491 [2023-08-24 12:52:41,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 102 transitions, 730 flow. Second operand has 23 states, 23 states have (on average 162.3913043478261) internal successors, (3735), 23 states have internal predecessors, (3735), 0 states have call successors, (0), 0 states 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:41,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:52:41,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 491 [2023-08-24 12:52:41,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:52:55,847 WARN L234 SmtUtils]: Spent 14.04s on a formula simplification. DAG size of input: 39 DAG size of output: 30 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:52:57,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:52:59,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:53:02,334 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:53:04,401 WARN L539 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:53:06,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 [0, 1] [2023-08-24 12:53:08,412 WARN L539 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:53:10,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:53:12,415 WARN L539 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:53:14,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:53:16,985 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:53:18,992 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:53:21,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 [0, 1] [2023-08-24 12:53:23,003 WARN L539 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:53:25,005 WARN L539 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:53:27,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 [0, 1] [2023-08-24 12:53:29,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:53:31,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:53:33,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:53:35,050 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] [2023-08-24 12:53:37,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:53:39,054 WARN L539 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:53:41,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:53:43,960 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:53:45,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:53:47,974 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] [2023-08-24 12:53:49,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:53:51,979 WARN L539 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:53:52,569 INFO L124 PetriNetUnfolderBase]: 647/1483 cut-off events. [2023-08-24 12:53:52,569 INFO L125 PetriNetUnfolderBase]: For 4760/4760 co-relation queries the response was YES. [2023-08-24 12:53:52,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6199 conditions, 1483 events. 647/1483 cut-off events. For 4760/4760 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9940 event pairs, 97 based on Foata normal form. 1/1357 useless extension candidates. Maximal degree in co-relation 6161. Up to 606 conditions per place. [2023-08-24 12:53:52,574 INFO L140 encePairwiseOnDemand]: 480/491 looper letters, 100 selfloop transitions, 25 changer transitions 21/152 dead transitions. [2023-08-24 12:53:52,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 152 transitions, 1333 flow [2023-08-24 12:53:52,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 12:53:52,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 12:53:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1691 transitions. [2023-08-24 12:53:52,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3443991853360489 [2023-08-24 12:53:52,576 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1691 transitions. [2023-08-24 12:53:52,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1691 transitions. [2023-08-24 12:53:52,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:53:52,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1691 transitions. [2023-08-24 12:53:52,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 169.1) internal successors, (1691), 10 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:52,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 491.0) internal successors, (5401), 11 states have internal predecessors, (5401), 0 states have call successors, (0), 0 states 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:52,580 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 491.0) internal successors, (5401), 11 states have internal predecessors, (5401), 0 states have call successors, (0), 0 states 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:52,580 INFO L175 Difference]: Start difference. First operand has 128 places, 102 transitions, 730 flow. Second operand 10 states and 1691 transitions. [2023-08-24 12:53:52,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 152 transitions, 1333 flow [2023-08-24 12:53:52,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 152 transitions, 1276 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-08-24 12:53:52,590 INFO L231 Difference]: Finished difference. Result has 129 places, 109 transitions, 819 flow [2023-08-24 12:53:52,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=819, PETRI_PLACES=129, PETRI_TRANSITIONS=109} [2023-08-24 12:53:52,590 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 61 predicate places. [2023-08-24 12:53:52,591 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 109 transitions, 819 flow [2023-08-24 12:53:52,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 162.3913043478261) internal successors, (3735), 23 states have internal predecessors, (3735), 0 states have call successors, (0), 0 states 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:52,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:53:52,591 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:53:52,596 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:53:52,796 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:53:52,796 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:53:52,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:53:52,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1843247637, now seen corresponding path program 7 times [2023-08-24 12:53:52,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:53:52,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509622364] [2023-08-24 12:53:52,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:53:52,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:53:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:53:53,118 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:53:53,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:53:53,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509622364] [2023-08-24 12:53:53,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509622364] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:53:53,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839295320] [2023-08-24 12:53:53,119 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 12:53:53,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:53:53,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:53:53,120 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:53:53,122 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:53:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:53:53,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-24 12:53:53,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:53:53,276 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:53,366 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:53:53,366 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:53,388 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:53,418 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:53,436 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:53:53,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:53:53,497 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:53:53,529 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:53:53,529 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:53:53,578 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:53:53,621 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:53:53,656 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:53:53,656 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:53:53,821 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:53:53,821 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:53:53,830 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:53:53,830 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:53:53,837 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:53:53,874 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((v_ArrVal_1649 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1650 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_91| v_ArrVal_1649)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1650) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1649 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1650 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_85| |v_t_funThread2of2ForFork0_~p~0#1.offset_91|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_91| v_ArrVal_1649)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1650) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0))))) is different from false [2023-08-24 12:53:53,892 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1649 Int) (v_ArrVal_1644 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1650 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_85| |v_t_funThread2of2ForFork0_~p~0#1.offset_91|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1644))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_91| v_ArrVal_1649))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1650) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0))) (or (forall ((v_ArrVal_1649 Int) (v_ArrVal_1644 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1650 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1644))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_91| v_ArrVal_1649))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1650) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-24 12:54:01,990 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:54:02,184 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:54:02,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839295320] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:54:02,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:54:02,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 20 [2023-08-24 12:54:02,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87023870] [2023-08-24 12:54:02,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:54:02,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 12:54:02,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:54:02,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 12:54:02,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=295, Unknown=17, NotChecked=74, Total=462 [2023-08-24 12:54:02,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 491 [2023-08-24 12:54:02,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 109 transitions, 819 flow. Second operand has 22 states, 22 states have (on average 162.5) internal successors, (3575), 22 states have internal predecessors, (3575), 0 states have call successors, (0), 0 states 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:02,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:54:02,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 491 [2023-08-24 12:54:02,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:54:02,536 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (forall ((v_ArrVal_1649 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1650 (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_1649)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1650) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_85| 4)) 0)))) (forall ((v_ArrVal_1649 Int) (v_ArrVal_1647 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1650 (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_1649)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1650) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1647) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_85| 4)) 0)))))) is different from false [2023-08-24 12:54:02,673 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (= (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= 4 |c_t_funThread1of2ForFork0_~p~0#1.base|) (not (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (forall ((v_ArrVal_1649 Int) (v_ArrVal_1647 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1650 (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_1649)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1650) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1647) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_85| 4)) 0)))) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|) (exists ((v_ArrVal_1649 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1649) (select |c_#memory_int| 4)) (not (= |t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)))))) is different from false [2023-08-24 12:54:03,363 INFO L124 PetriNetUnfolderBase]: 799/1904 cut-off events. [2023-08-24 12:54:03,364 INFO L125 PetriNetUnfolderBase]: For 7098/7134 co-relation queries the response was YES. [2023-08-24 12:54:03,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8277 conditions, 1904 events. 799/1904 cut-off events. For 7098/7134 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 14036 event pairs, 205 based on Foata normal form. 8/1755 useless extension candidates. Maximal degree in co-relation 8237. Up to 905 conditions per place. [2023-08-24 12:54:03,370 INFO L140 encePairwiseOnDemand]: 475/491 looper letters, 104 selfloop transitions, 25 changer transitions 71/206 dead transitions. [2023-08-24 12:54:03,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 206 transitions, 1902 flow [2023-08-24 12:54:03,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 12:54:03,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-24 12:54:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2365 transitions. [2023-08-24 12:54:03,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3440500436427117 [2023-08-24 12:54:03,372 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2365 transitions. [2023-08-24 12:54:03,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2365 transitions. [2023-08-24 12:54:03,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:54:03,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2365 transitions. [2023-08-24 12:54:03,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 168.92857142857142) internal successors, (2365), 14 states have internal predecessors, (2365), 0 states have call successors, (0), 0 states 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:03,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 491.0) internal successors, (7365), 15 states have internal predecessors, (7365), 0 states have call successors, (0), 0 states 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:03,378 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 491.0) internal successors, (7365), 15 states have internal predecessors, (7365), 0 states have call successors, (0), 0 states 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:03,378 INFO L175 Difference]: Start difference. First operand has 129 places, 109 transitions, 819 flow. Second operand 14 states and 2365 transitions. [2023-08-24 12:54:03,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 206 transitions, 1902 flow [2023-08-24 12:54:03,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 206 transitions, 1833 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-08-24 12:54:03,391 INFO L231 Difference]: Finished difference. Result has 141 places, 116 transitions, 935 flow [2023-08-24 12:54:03,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=935, PETRI_PLACES=141, PETRI_TRANSITIONS=116} [2023-08-24 12:54:03,392 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 73 predicate places. [2023-08-24 12:54:03,392 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 116 transitions, 935 flow [2023-08-24 12:54:03,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 162.5) internal successors, (3575), 22 states have internal predecessors, (3575), 0 states have call successors, (0), 0 states 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:03,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:54:03,392 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:54:03,399 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:54:03,597 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:54:03,597 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:54:03,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:54:03,598 INFO L85 PathProgramCache]: Analyzing trace with hash -685045781, now seen corresponding path program 8 times [2023-08-24 12:54:03,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:54:03,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285823685] [2023-08-24 12:54:03,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:54:03,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:54:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:54:03,878 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:54:03,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:54:03,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285823685] [2023-08-24 12:54:03,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285823685] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:54:03,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64007277] [2023-08-24 12:54:03,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:54:03,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:54:03,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:54:03,880 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:54:03,883 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:54:04,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:54:04,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:54:04,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-24 12:54:04,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:54:04,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 7 treesize of output 6 [2023-08-24 12:54:04,089 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:54:04,090 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:54:04,109 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:54:04,129 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 12:54:04,145 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:54:04,196 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:54:04,196 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-24 12:54:04,289 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:54:04,343 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:54:04,363 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:54:04,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:54:04,466 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:54:04,470 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:54:04,475 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1740 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_93| Int)) (or (= (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_93| v_ArrVal_1738)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1740) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_87|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_87| |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) is different from false [2023-08-24 12:54:04,487 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (v_ArrVal_1735 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1740 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_93| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_87| |v_t_funThread2of2ForFork0_~p~0#1.offset_93|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1735))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_93| v_ArrVal_1738))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1740) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_87|) 0))) is different from false [2023-08-24 12:54:04,610 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:54:04,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64007277] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:54:04,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:54:04,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 17 [2023-08-24 12:54:04,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446770703] [2023-08-24 12:54:04,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:54:04,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-24 12:54:04,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:54:04,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-24 12:54:04,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=200, Unknown=16, NotChecked=62, Total=342 [2023-08-24 12:54:04,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 491 [2023-08-24 12:54:04,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 116 transitions, 935 flow. Second operand has 19 states, 19 states have (on average 163.89473684210526) internal successors, (3114), 19 states have internal predecessors, (3114), 0 states have call successors, (0), 0 states 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:04,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:54:04,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 491 [2023-08-24 12:54:04,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:54:05,481 INFO L124 PetriNetUnfolderBase]: 640/1550 cut-off events. [2023-08-24 12:54:05,481 INFO L125 PetriNetUnfolderBase]: For 7221/7233 co-relation queries the response was YES. [2023-08-24 12:54:05,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7263 conditions, 1550 events. 640/1550 cut-off events. For 7221/7233 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10750 event pairs, 134 based on Foata normal form. 10/1423 useless extension candidates. Maximal degree in co-relation 7218. Up to 565 conditions per place. [2023-08-24 12:54:05,486 INFO L140 encePairwiseOnDemand]: 481/491 looper letters, 77 selfloop transitions, 18 changer transitions 89/190 dead transitions. [2023-08-24 12:54:05,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 190 transitions, 1821 flow [2023-08-24 12:54:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-24 12:54:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-24 12:54:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2540 transitions. [2023-08-24 12:54:05,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3448744059742023 [2023-08-24 12:54:05,489 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2540 transitions. [2023-08-24 12:54:05,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2540 transitions. [2023-08-24 12:54:05,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:54:05,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2540 transitions. [2023-08-24 12:54:05,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 169.33333333333334) internal successors, (2540), 15 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states 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:05,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 491.0) internal successors, (7856), 16 states have internal predecessors, (7856), 0 states have call successors, (0), 0 states 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:05,494 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 491.0) internal successors, (7856), 16 states have internal predecessors, (7856), 0 states have call successors, (0), 0 states 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:05,494 INFO L175 Difference]: Start difference. First operand has 141 places, 116 transitions, 935 flow. Second operand 15 states and 2540 transitions. [2023-08-24 12:54:05,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 190 transitions, 1821 flow [2023-08-24 12:54:05,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 190 transitions, 1779 flow, removed 12 selfloop flow, removed 8 redundant places. [2023-08-24 12:54:05,507 INFO L231 Difference]: Finished difference. Result has 150 places, 87 transitions, 656 flow [2023-08-24 12:54:05,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=656, PETRI_PLACES=150, PETRI_TRANSITIONS=87} [2023-08-24 12:54:05,508 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 82 predicate places. [2023-08-24 12:54:05,508 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 87 transitions, 656 flow [2023-08-24 12:54:05,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 163.89473684210526) internal successors, (3114), 19 states have internal predecessors, (3114), 0 states have call successors, (0), 0 states 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:05,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:54:05,508 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:54:05,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-08-24 12:54:05,713 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:54:05,713 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:54:05,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:54:05,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1439959641, now seen corresponding path program 1 times [2023-08-24 12:54:05,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:54:05,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272755601] [2023-08-24 12:54:05,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:54:05,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:54:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:54:06,251 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:54:06,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:54:06,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272755601] [2023-08-24 12:54:06,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272755601] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:54:06,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151921037] [2023-08-24 12:54:06,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:54:06,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:54:06,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:54:06,273 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:54:06,307 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:54:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:54:06,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-24 12:54:06,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:54:06,455 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:54:06,538 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:54:06,539 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 12:54:06,570 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:54:06,600 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:54:06,717 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:54:06,810 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:54:06,874 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:54:06,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:54:27,046 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1833 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1833) |c_~#a~0.base|))) is different from false [2023-08-24 12:54:27,149 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:54:27,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151921037] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:54:27,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:54:27,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 24 [2023-08-24 12:54:27,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873352437] [2023-08-24 12:54:27,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:54:27,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-24 12:54:27,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:54:27,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-24 12:54:27,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=500, Unknown=2, NotChecked=46, Total=650 [2023-08-24 12:54:27,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 491 [2023-08-24 12:54:27,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 87 transitions, 656 flow. Second operand has 26 states, 26 states have (on average 158.42307692307693) internal successors, (4119), 26 states have internal predecessors, (4119), 0 states have call successors, (0), 0 states 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:27,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:54:27,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 491 [2023-08-24 12:54:27,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:54:28,208 INFO L124 PetriNetUnfolderBase]: 380/910 cut-off events. [2023-08-24 12:54:28,208 INFO L125 PetriNetUnfolderBase]: For 4833/4839 co-relation queries the response was YES. [2023-08-24 12:54:28,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4319 conditions, 910 events. 380/910 cut-off events. For 4833/4839 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5495 event pairs, 105 based on Foata normal form. 9/863 useless extension candidates. Maximal degree in co-relation 4270. Up to 588 conditions per place. [2023-08-24 12:54:28,213 INFO L140 encePairwiseOnDemand]: 472/491 looper letters, 110 selfloop transitions, 29 changer transitions 13/158 dead transitions. [2023-08-24 12:54:28,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 158 transitions, 1473 flow [2023-08-24 12:54:28,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-24 12:54:28,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-24 12:54:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2915 transitions. [2023-08-24 12:54:28,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3298257524326771 [2023-08-24 12:54:28,215 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2915 transitions. [2023-08-24 12:54:28,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2915 transitions. [2023-08-24 12:54:28,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:54:28,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2915 transitions. [2023-08-24 12:54:28,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 161.94444444444446) internal successors, (2915), 18 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:54:28,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 491.0) internal successors, (9329), 19 states have internal predecessors, (9329), 0 states have call successors, (0), 0 states 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:28,222 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 491.0) internal successors, (9329), 19 states have internal predecessors, (9329), 0 states have call successors, (0), 0 states 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:28,222 INFO L175 Difference]: Start difference. First operand has 150 places, 87 transitions, 656 flow. Second operand 18 states and 2915 transitions. [2023-08-24 12:54:28,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 158 transitions, 1473 flow [2023-08-24 12:54:28,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 158 transitions, 1328 flow, removed 41 selfloop flow, removed 24 redundant places. [2023-08-24 12:54:28,231 INFO L231 Difference]: Finished difference. Result has 134 places, 104 transitions, 788 flow [2023-08-24 12:54:28,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=788, PETRI_PLACES=134, PETRI_TRANSITIONS=104} [2023-08-24 12:54:28,232 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 66 predicate places. [2023-08-24 12:54:28,232 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 104 transitions, 788 flow [2023-08-24 12:54:28,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 158.42307692307693) internal successors, (4119), 26 states have internal predecessors, (4119), 0 states have call successors, (0), 0 states 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:28,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:54:28,233 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:54:28,238 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:54:28,437 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:54:28,437 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:54:28,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:54:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1416364227, now seen corresponding path program 1 times [2023-08-24 12:54:28,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:54:28,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599072909] [2023-08-24 12:54:28,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:54:28,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:54:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:54:28,716 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:54:28,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:54:28,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599072909] [2023-08-24 12:54:28,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599072909] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:54:28,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149760219] [2023-08-24 12:54:28,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:54:28,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:54:28,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:54:28,718 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:54:28,719 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:54:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:54:28,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-24 12:54:28,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:54:28,879 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:54:28,936 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:54: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:54:28,961 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:54:28,979 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:54:29,067 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:54:29,131 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:54:29,180 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:54:29,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:54:45,302 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1930 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1930) |c_~#a~0.base|))) is different from false [2023-08-24 12:54:45,378 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:54:45,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149760219] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:54:45,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:54:45,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2023-08-24 12:54:45,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930912981] [2023-08-24 12:54:45,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:54:45,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-24 12:54:45,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:54:45,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-24 12:54:45,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=382, Unknown=8, NotChecked=40, Total=506 [2023-08-24 12:54:45,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 491 [2023-08-24 12:54:45,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 104 transitions, 788 flow. Second operand has 23 states, 23 states have (on average 177.69565217391303) internal successors, (4087), 23 states have internal predecessors, (4087), 0 states have call successors, (0), 0 states 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:45,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:54:45,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 491 [2023-08-24 12:54:45,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:54:46,021 INFO L124 PetriNetUnfolderBase]: 353/896 cut-off events. [2023-08-24 12:54:46,021 INFO L125 PetriNetUnfolderBase]: For 3323/3323 co-relation queries the response was YES. [2023-08-24 12:54:46,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3998 conditions, 896 events. 353/896 cut-off events. For 3323/3323 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5677 event pairs, 48 based on Foata normal form. 9/832 useless extension candidates. Maximal degree in co-relation 3956. Up to 385 conditions per place. [2023-08-24 12:54:46,024 INFO L140 encePairwiseOnDemand]: 479/491 looper letters, 99 selfloop transitions, 35 changer transitions 12/154 dead transitions. [2023-08-24 12:54:46,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 154 transitions, 1440 flow [2023-08-24 12:54:46,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 12:54:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 12:54:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2186 transitions. [2023-08-24 12:54:46,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3710115410726409 [2023-08-24 12:54:46,026 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2186 transitions. [2023-08-24 12:54:46,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2186 transitions. [2023-08-24 12:54:46,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:54:46,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2186 transitions. [2023-08-24 12:54:46,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 182.16666666666666) internal successors, (2186), 12 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:46,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 491.0) internal successors, (6383), 13 states have internal predecessors, (6383), 0 states have call successors, (0), 0 states 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:46,031 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 491.0) internal successors, (6383), 13 states have internal predecessors, (6383), 0 states have call successors, (0), 0 states 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:46,032 INFO L175 Difference]: Start difference. First operand has 134 places, 104 transitions, 788 flow. Second operand 12 states and 2186 transitions. [2023-08-24 12:54:46,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 154 transitions, 1440 flow [2023-08-24 12:54:46,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 154 transitions, 1301 flow, removed 51 selfloop flow, removed 12 redundant places. [2023-08-24 12:54:46,039 INFO L231 Difference]: Finished difference. Result has 137 places, 117 transitions, 868 flow [2023-08-24 12:54:46,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=868, PETRI_PLACES=137, PETRI_TRANSITIONS=117} [2023-08-24 12:54:46,040 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 69 predicate places. [2023-08-24 12:54:46,040 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 117 transitions, 868 flow [2023-08-24 12:54:46,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 177.69565217391303) internal successors, (4087), 23 states have internal predecessors, (4087), 0 states have call successors, (0), 0 states 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:46,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:54:46,041 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:54:46,046 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 12:54:46,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:54:46,246 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:54:46,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:54:46,246 INFO L85 PathProgramCache]: Analyzing trace with hash -606987587, now seen corresponding path program 2 times [2023-08-24 12:54:46,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:54:46,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048770368] [2023-08-24 12:54:46,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:54:46,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:54:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:54:46,583 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:54:46,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:54:46,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048770368] [2023-08-24 12:54:46,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048770368] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:54:46,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593502095] [2023-08-24 12:54:46,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:54:46,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:54:46,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:54:46,584 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:54:46,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-08-24 12:54:46,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:54:46,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:54:46,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-24 12:54:46,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:54:46,752 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:54:46,816 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:54:46,816 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:54:46,824 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:54:46,924 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:54:47,001 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:54:47,017 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:54:47,066 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:54:47,066 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:55:03,130 WARN L861 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2031) |c_~#a~0.base|))) (select .cse0 (@diff .cse0 ((as const (Array Int Int)) 0)))) 0)) is different from true [2023-08-24 12:55:03,140 WARN L861 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 (Array Int Int))) (= (let ((.cse0 (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| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post40#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2031) |c_~#a~0.base|))) (select .cse0 (@diff .cse0 ((as const (Array Int Int)) 0)))) 0)) is different from true [2023-08-24 12:55:03,146 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 (Array Int Int))) (= (let ((.cse0 (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2031) |c_~#a~0.base|))) (select .cse0 (@diff .cse0 ((as const (Array Int Int)) 0)))) 0)) is different from false [2023-08-24 12:55:03,161 WARN L861 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 (Array Int Int))) (= (let ((.cse0 (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| |c_t_funThread1of2ForFork0_#t~post37#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2031) |c_~#a~0.base|))) (select .cse0 (@diff .cse0 ((as const (Array Int Int)) 0)))) 0)) is different from true [2023-08-24 12:55:03,168 WARN L861 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (let ((.cse0 (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2031) |c_~#a~0.base|))) (select .cse0 (@diff .cse0 ((as const (Array Int Int)) 0)))) 0)) is different from true [2023-08-24 12:55:03,188 WARN L861 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= 0 (let ((.cse0 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2031) |c_~#a~0.base|))) (select .cse0 (@diff .cse0 ((as const (Array Int Int)) 0)))))) is different from true [2023-08-24 12:55:03,198 WARN L861 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2026 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2026))) (store .cse1 |c_~#a~0.base| (let ((.cse2 (select .cse1 |c_~#a~0.base|))) (store .cse2 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse2 |t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2031) |c_~#a~0.base|))) (select .cse0 (@diff .cse0 ((as const (Array Int Int)) 0)))) 0)) is different from true [2023-08-24 12:55:03,208 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_147| Int) (v_ArrVal_2026 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_147|) 0)) (= (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_147| v_ArrVal_2026))) (store .cse1 |c_~#a~0.base| (let ((.cse2 (select .cse1 |c_~#a~0.base|))) (store .cse2 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse2 |t_funThread1of2ForFork0_~p~0#1.offset|))))) |v_ULTIMATE.start_main_~#t_ids~0#1.base_147| v_ArrVal_2031) |c_~#a~0.base|))) (select .cse0 (@diff .cse0 ((as const (Array Int Int)) 0)))) 0))) is different from false [2023-08-24 12:55:03,210 WARN L861 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_147| Int) (v_ArrVal_2026 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_147|) 0)) (= (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_147| v_ArrVal_2026))) (store .cse1 |c_~#a~0.base| (let ((.cse2 (select .cse1 |c_~#a~0.base|))) (store .cse2 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse2 |t_funThread1of2ForFork0_~p~0#1.offset|))))) |v_ULTIMATE.start_main_~#t_ids~0#1.base_147| v_ArrVal_2031) |c_~#a~0.base|))) (select .cse0 (@diff .cse0 ((as const (Array Int Int)) 0)))) 0))) is different from true [2023-08-24 12:55:03,261 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:55:03,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593502095] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:55:03,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:55:03,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 24 [2023-08-24 12:55:03,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607416241] [2023-08-24 12:55:03,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:55:03,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-24 12:55:03,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:55:03,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-24 12:55:03,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=246, Unknown=12, NotChecked=312, Total=650 [2023-08-24 12:55:03,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 491 [2023-08-24 12:55:03,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 117 transitions, 868 flow. Second operand has 26 states, 26 states have (on average 177.19230769230768) internal successors, (4607), 26 states have internal predecessors, (4607), 0 states have call successors, (0), 0 states 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:55:03,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:55:03,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 491 [2023-08-24 12:55:03,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:55:03,277 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0))) (and (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_147| Int) (v_ArrVal_2026 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_147|) 0)) (= (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_147| v_ArrVal_2026))) (store .cse2 |c_~#a~0.base| (let ((.cse3 (select .cse2 |c_~#a~0.base|))) (store .cse3 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse3 |t_funThread1of2ForFork0_~p~0#1.offset|))))) |v_ULTIMATE.start_main_~#t_ids~0#1.base_147| v_ArrVal_2031) |c_~#a~0.base|))) (select .cse0 (@diff .cse0 .cse1))) 0))) (= (select |c_#valid| 4) 1) (= .cse1 (select |c_#memory_int| 4)) (= |c_~#a~0.base| 4))) is different from false [2023-08-24 12:55:03,283 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0))) (and (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_147| Int) (v_ArrVal_2026 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_147|) 0)) (= (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_147| v_ArrVal_2026))) (store .cse2 |c_~#a~0.base| (let ((.cse3 (select .cse2 |c_~#a~0.base|))) (store .cse3 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse3 |t_funThread1of2ForFork0_~p~0#1.offset|))))) |v_ULTIMATE.start_main_~#t_ids~0#1.base_147| v_ArrVal_2031) |c_~#a~0.base|))) (select .cse0 (@diff .cse0 .cse1))) 0))) (= (select |c_#valid| 4) 1) (= .cse1 (select |c_#memory_int| 4)) (= |c_~#a~0.base| 4))) is different from true [2023-08-24 12:55:03,616 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= 4 |c_t_funThread1of2ForFork0_~p~0#1.base|) (= .cse0 (select |c_#memory_int| 4)) (forall ((v_ArrVal_2031 (Array Int Int))) (= (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2031) |c_~#a~0.base|))) (select .cse1 (@diff .cse1 .cse0))) 0)) (= |c_~#a~0.base| 4))) is different from true [2023-08-24 12:55:03,901 INFO L124 PetriNetUnfolderBase]: 484/1241 cut-off events. [2023-08-24 12:55:03,901 INFO L125 PetriNetUnfolderBase]: For 4940/4952 co-relation queries the response was YES. [2023-08-24 12:55:03,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5453 conditions, 1241 events. 484/1241 cut-off events. For 4940/4952 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 8970 event pairs, 125 based on Foata normal form. 33/1175 useless extension candidates. Maximal degree in co-relation 5411. Up to 532 conditions per place. [2023-08-24 12:55:03,906 INFO L140 encePairwiseOnDemand]: 476/491 looper letters, 127 selfloop transitions, 32 changer transitions 39/206 dead transitions. [2023-08-24 12:55:03,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 206 transitions, 1892 flow [2023-08-24 12:55:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-24 12:55:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-24 12:55:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2721 transitions. [2023-08-24 12:55:03,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36945010183299387 [2023-08-24 12:55:03,908 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2721 transitions. [2023-08-24 12:55:03,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2721 transitions. [2023-08-24 12:55:03,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:55:03,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2721 transitions. [2023-08-24 12:55:03,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 181.4) internal successors, (2721), 15 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states 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:55:03,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 491.0) internal successors, (7856), 16 states have internal predecessors, (7856), 0 states have call successors, (0), 0 states 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:55:03,913 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 491.0) internal successors, (7856), 16 states have internal predecessors, (7856), 0 states have call successors, (0), 0 states 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:55:03,914 INFO L175 Difference]: Start difference. First operand has 137 places, 117 transitions, 868 flow. Second operand 15 states and 2721 transitions. [2023-08-24 12:55:03,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 206 transitions, 1892 flow [2023-08-24 12:55:03,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 206 transitions, 1828 flow, removed 21 selfloop flow, removed 7 redundant places. [2023-08-24 12:55:03,924 INFO L231 Difference]: Finished difference. Result has 151 places, 132 transitions, 1044 flow [2023-08-24 12:55:03,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1044, PETRI_PLACES=151, PETRI_TRANSITIONS=132} [2023-08-24 12:55:03,925 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 83 predicate places. [2023-08-24 12:55:03,925 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 132 transitions, 1044 flow [2023-08-24 12:55:03,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 177.19230769230768) internal successors, (4607), 26 states have internal predecessors, (4607), 0 states have call successors, (0), 0 states 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:55:03,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:55:03,925 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, 1, 1] [2023-08-24 12:55:03,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-08-24 12:55:04,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:55:04,130 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:55:04,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:55:04,130 INFO L85 PathProgramCache]: Analyzing trace with hash 973216830, now seen corresponding path program 1 times [2023-08-24 12:55:04,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:55:04,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464877070] [2023-08-24 12:55:04,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:55:04,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:55:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:55:04,460 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:55:04,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:55:04,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464877070] [2023-08-24 12:55:04,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464877070] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:55:04,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493470604] [2023-08-24 12:55:04,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:55:04,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:55:04,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:55:04,462 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:55:04,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-08-24 12:55:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:55:04,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-24 12:55:04,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:55:04,642 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:55:04,708 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:55:04,708 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:55:04,716 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:55:04,824 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:55:04,901 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:55:04,927 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:55:04,979 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:55:04,979 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:55:25,411 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:55:25,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493470604] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:55:25,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:55:25,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 20 [2023-08-24 12:55:25,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229738726] [2023-08-24 12:55:25,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:55:25,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 12:55:25,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:55:25,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 12:55:25,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=377, Unknown=5, NotChecked=0, Total=462 [2023-08-24 12:55:25,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 491 [2023-08-24 12:55:25,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 132 transitions, 1044 flow. Second operand has 22 states, 22 states have (on average 177.6818181818182) internal successors, (3909), 22 states have internal predecessors, (3909), 0 states have call successors, (0), 0 states 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:55:25,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:55:25,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 491 [2023-08-24 12:55:25,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:55:26,170 INFO L124 PetriNetUnfolderBase]: 399/1042 cut-off events. [2023-08-24 12:55:26,170 INFO L125 PetriNetUnfolderBase]: For 4685/4697 co-relation queries the response was YES. [2023-08-24 12:55:26,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4879 conditions, 1042 events. 399/1042 cut-off events. For 4685/4697 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7138 event pairs, 112 based on Foata normal form. 5/965 useless extension candidates. Maximal degree in co-relation 4829. Up to 414 conditions per place. [2023-08-24 12:55:26,175 INFO L140 encePairwiseOnDemand]: 479/491 looper letters, 70 selfloop transitions, 4 changer transitions 89/167 dead transitions. [2023-08-24 12:55:26,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 167 transitions, 1714 flow [2023-08-24 12:55:26,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-24 12:55:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-24 12:55:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2343 transitions. [2023-08-24 12:55:26,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36706877643741187 [2023-08-24 12:55:26,177 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2343 transitions. [2023-08-24 12:55:26,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2343 transitions. [2023-08-24 12:55:26,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:55:26,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2343 transitions. [2023-08-24 12:55:26,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 180.23076923076923) internal successors, (2343), 13 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states 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:55:26,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 491.0) internal successors, (6874), 14 states have internal predecessors, (6874), 0 states have call successors, (0), 0 states 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:55:26,182 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 491.0) internal successors, (6874), 14 states have internal predecessors, (6874), 0 states have call successors, (0), 0 states 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:55:26,182 INFO L175 Difference]: Start difference. First operand has 151 places, 132 transitions, 1044 flow. Second operand 13 states and 2343 transitions. [2023-08-24 12:55:26,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 167 transitions, 1714 flow [2023-08-24 12:55:26,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 167 transitions, 1606 flow, removed 33 selfloop flow, removed 15 redundant places. [2023-08-24 12:55:26,193 INFO L231 Difference]: Finished difference. Result has 146 places, 76 transitions, 555 flow [2023-08-24 12:55:26,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=555, PETRI_PLACES=146, PETRI_TRANSITIONS=76} [2023-08-24 12:55:26,193 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 78 predicate places. [2023-08-24 12:55:26,193 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 76 transitions, 555 flow [2023-08-24 12:55:26,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 177.6818181818182) internal successors, (3909), 22 states have internal predecessors, (3909), 0 states have call successors, (0), 0 states 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:55:26,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:55:26,194 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:55:26,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-08-24 12:55:26,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-08-24 12:55:26,395 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:55:26,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:55:26,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2020150078, now seen corresponding path program 2 times [2023-08-24 12:55:26,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:55:26,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251022465] [2023-08-24 12:55:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:55:26,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:55:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:55:26,871 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:55:26,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:55:26,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251022465] [2023-08-24 12:55:26,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251022465] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:55:26,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382776366] [2023-08-24 12:55:26,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:55:26,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:55:26,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:55:26,873 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:55:26,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-08-24 12:55:27,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:55:27,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:55:27,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 44 conjunts are in the unsatisfiable core [2023-08-24 12:55:27,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:55:27,048 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:55:27,108 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:55:27,108 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 12:55:27,113 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:55:27,133 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:55:27,226 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:55:27,334 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:55: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 19 treesize of output 21 [2023-08-24 12:55:27,393 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:55:27,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:55:33,423 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2234 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2234) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:55:35,432 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2234 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (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| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post40#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2234) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:55:37,438 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2234 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2234) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:55:37,449 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2234 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2234) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:55:37,456 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2234 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (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| |c_t_funThread2of2ForFork0_#t~post37#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2234) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:55:37,461 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2234 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2234) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:55:37,471 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2234 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2234) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:55:37,482 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2234 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2229))) (store .cse0 |c_~#a~0.base| (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2234) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:55:37,565 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:55:37,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382776366] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:55:37,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:55:37,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 26 [2023-08-24 12:55:37,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347973334] [2023-08-24 12:55:37,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:55:37,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-24 12:55:37,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:55:37,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-24 12:55:37,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=328, Unknown=10, NotChecked=344, Total=756 [2023-08-24 12:55:37,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 491 [2023-08-24 12:55:37,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 76 transitions, 555 flow. Second operand has 28 states, 28 states have (on average 177.17857142857142) internal successors, (4961), 28 states have internal predecessors, (4961), 0 states have call successors, (0), 0 states 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:55:37,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:55:37,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 491 [2023-08-24 12:55:37,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:56:00,753 WARN L234 SmtUtils]: Spent 18.82s on a formula simplification. DAG size of input: 36 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:56:02,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:04,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:06,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:08,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:10,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:56:13,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 [0, 1] [2023-08-24 12:56:15,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 12:56:27,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:29,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:31,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:33,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:35,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:56:37,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:56:39,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:40,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 12:56:42,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:56:44,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:45,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 12:56:47,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:56:48,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:56:49,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:56:49,960 INFO L124 PetriNetUnfolderBase]: 182/499 cut-off events. [2023-08-24 12:56:49,960 INFO L125 PetriNetUnfolderBase]: For 1777/1777 co-relation queries the response was YES. [2023-08-24 12:56:49,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2374 conditions, 499 events. 182/499 cut-off events. For 1777/1777 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2869 event pairs, 36 based on Foata normal form. 3/499 useless extension candidates. Maximal degree in co-relation 2330. Up to 186 conditions per place. [2023-08-24 12:56:49,962 INFO L140 encePairwiseOnDemand]: 479/491 looper letters, 57 selfloop transitions, 19 changer transitions 29/109 dead transitions. [2023-08-24 12:56:49,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 109 transitions, 1049 flow [2023-08-24 12:56:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 12:56:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 12:56:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2153 transitions. [2023-08-24 12:56:49,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36541072640868977 [2023-08-24 12:56:49,964 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2153 transitions. [2023-08-24 12:56:49,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2153 transitions. [2023-08-24 12:56:49,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:56:49,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2153 transitions. [2023-08-24 12:56:49,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 179.41666666666666) internal successors, (2153), 12 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:56:49,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 491.0) internal successors, (6383), 13 states have internal predecessors, (6383), 0 states have call successors, (0), 0 states 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:56:49,969 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 491.0) internal successors, (6383), 13 states have internal predecessors, (6383), 0 states have call successors, (0), 0 states 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:56:49,969 INFO L175 Difference]: Start difference. First operand has 146 places, 76 transitions, 555 flow. Second operand 12 states and 2153 transitions. [2023-08-24 12:56:49,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 109 transitions, 1049 flow [2023-08-24 12:56:49,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 109 transitions, 970 flow, removed 15 selfloop flow, removed 13 redundant places. [2023-08-24 12:56:49,973 INFO L231 Difference]: Finished difference. Result has 110 places, 74 transitions, 555 flow [2023-08-24 12:56:49,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=555, PETRI_PLACES=110, PETRI_TRANSITIONS=74} [2023-08-24 12:56:49,973 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 42 predicate places. [2023-08-24 12:56:49,973 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 74 transitions, 555 flow [2023-08-24 12:56:49,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 177.17857142857142) internal successors, (4961), 28 states have internal predecessors, (4961), 0 states have call successors, (0), 0 states 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:56:49,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:56:49,974 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:56:49,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-08-24 12:56:50,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-08-24 12:56:50,179 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:56:50,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:56:50,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1485948806, now seen corresponding path program 3 times [2023-08-24 12:56:50,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:56:50,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669460483] [2023-08-24 12:56:50,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:56:50,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:56:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:56:50,501 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:56:50,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:56:50,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669460483] [2023-08-24 12:56:50,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669460483] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:56:50,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757292561] [2023-08-24 12:56:50,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 12:56:50,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:56:50,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:56:50,503 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:56:50,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-08-24 12:56:50,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 12:56:50,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:56:50,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-24 12:56:50,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:56:50,733 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:56:50,914 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-24 12:56:50,914 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:56:50,959 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:56:51,013 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:56:51,070 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:56:51,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:56:51,160 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:56:51,197 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:56:51,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:56:51,263 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 12:56:51,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:56:51,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 16 treesize of output 18 [2023-08-24 12:56:51,361 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:56:51,362 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:56:51,423 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:56:51,498 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:56:51,527 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:56:51,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:56:51,532 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2341 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2341) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:56:51,629 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2338 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2339 Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2338) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_99| 4)) 0)) (= (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_2339)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2341) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_99|) 0))) is different from false [2023-08-24 12:56:51,691 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:56:51,691 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-24 12:56:51,699 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 12:56:51,699 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:56:51,703 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:56:51,789 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2341 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_105| Int) (v_ArrVal_2339 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_105| v_ArrVal_2339)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2341) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_99|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_99| |v_t_funThread2of2ForFork0_~p~0#1.offset_105|))) (or (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2341 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_105| Int) (v_ArrVal_2339 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_105| v_ArrVal_2339)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2341) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_99|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-08-24 12:56:51,824 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2331 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_105| Int) (v_ArrVal_2339 Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2331))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_105| v_ArrVal_2339))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2341) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_99|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2331 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_105| Int) (v_ArrVal_2339 Int)) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2331))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_105| v_ArrVal_2339))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2341) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_99|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_99| |v_t_funThread2of2ForFork0_~p~0#1.offset_105|)))) is different from false [2023-08-24 12:56:59,927 WARN L234 SmtUtils]: Spent 8.02s 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:57:00,142 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:57:00,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757292561] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:57:00,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:57:00,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2023-08-24 12:57:00,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434836486] [2023-08-24 12:57:00,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:57:00,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-24 12:57:00,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:57:00,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-24 12:57:00,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=395, Unknown=9, NotChecked=172, Total=650 [2023-08-24 12:57:00,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 491 [2023-08-24 12:57:00,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 74 transitions, 555 flow. Second operand has 26 states, 26 states have (on average 157.57692307692307) internal successors, (4097), 26 states have internal predecessors, (4097), 0 states have call successors, (0), 0 states 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:57:00,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:57:00,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 491 [2023-08-24 12:57:00,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:57:01,321 INFO L124 PetriNetUnfolderBase]: 122/358 cut-off events. [2023-08-24 12:57:01,321 INFO L125 PetriNetUnfolderBase]: For 1783/1783 co-relation queries the response was YES. [2023-08-24 12:57:01,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1817 conditions, 358 events. 122/358 cut-off events. For 1783/1783 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1833 event pairs, 5 based on Foata normal form. 4/359 useless extension candidates. Maximal degree in co-relation 1777. Up to 138 conditions per place. [2023-08-24 12:57:01,322 INFO L140 encePairwiseOnDemand]: 481/491 looper letters, 0 selfloop transitions, 0 changer transitions 102/102 dead transitions. [2023-08-24 12:57:01,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 102 transitions, 1026 flow [2023-08-24 12:57:01,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-24 12:57:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-24 12:57:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2384 transitions. [2023-08-24 12:57:01,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3236931432450781 [2023-08-24 12:57:01,324 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2384 transitions. [2023-08-24 12:57:01,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2384 transitions. [2023-08-24 12:57:01,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:57:01,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2384 transitions. [2023-08-24 12:57:01,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 158.93333333333334) internal successors, (2384), 15 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:57:01,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 491.0) internal successors, (7856), 16 states have internal predecessors, (7856), 0 states have call successors, (0), 0 states 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:57:01,329 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 491.0) internal successors, (7856), 16 states have internal predecessors, (7856), 0 states have call successors, (0), 0 states 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:57:01,329 INFO L175 Difference]: Start difference. First operand has 110 places, 74 transitions, 555 flow. Second operand 15 states and 2384 transitions. [2023-08-24 12:57:01,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 102 transitions, 1026 flow [2023-08-24 12:57:01,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 102 transitions, 964 flow, removed 3 selfloop flow, removed 10 redundant places. [2023-08-24 12:57:01,332 INFO L231 Difference]: Finished difference. Result has 110 places, 0 transitions, 0 flow [2023-08-24 12:57:01,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=0, PETRI_PLACES=110, PETRI_TRANSITIONS=0} [2023-08-24 12:57:01,333 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 42 predicate places. [2023-08-24 12:57:01,333 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 0 transitions, 0 flow [2023-08-24 12:57:01,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 157.57692307692307) internal successors, (4097), 26 states have internal predecessors, (4097), 0 states have call successors, (0), 0 states 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:57:01,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 12:57:01,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-24 12:57:01,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-24 12:57:01,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-24 12:57:01,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-08-24 12:57:01,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:57:01,539 INFO L445 BasicCegarLoop]: Path program histogram: [8, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2023-08-24 12:57:01,540 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-24 12:57:01,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 269 transitions, 556 flow [2023-08-24 12:57:01,586 INFO L124 PetriNetUnfolderBase]: 75/438 cut-off events. [2023-08-24 12:57:01,586 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-24 12:57:01,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 438 events. 75/438 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1742 event pairs, 0 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 270. Up to 12 conditions per place. [2023-08-24 12:57:01,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 269 transitions, 556 flow [2023-08-24 12:57:01,589 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 269 transitions, 556 flow [2023-08-24 12:57:01,589 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 12:57:01,590 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 229 places, 269 transitions, 556 flow [2023-08-24 12:57:01,590 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 269 transitions, 556 flow [2023-08-24 12:57:01,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 269 transitions, 556 flow [2023-08-24 12:57:01,614 INFO L124 PetriNetUnfolderBase]: 75/438 cut-off events. [2023-08-24 12:57:01,614 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-24 12:57:01,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 438 events. 75/438 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1742 event pairs, 0 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 270. Up to 12 conditions per place. [2023-08-24 12:57:01,621 INFO L119 LiptonReduction]: Number of co-enabled transitions 33796 [2023-08-24 12:57:05,089 INFO L134 LiptonReduction]: Checked pairs total: 57384 [2023-08-24 12:57:05,089 INFO L136 LiptonReduction]: Total number of compositions: 222 [2023-08-24 12:57:05,091 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-24 12:57:05,091 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;@70638694, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 12:57:05,091 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-24 12:57:05,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 12:57:05,096 INFO L124 PetriNetUnfolderBase]: 37/112 cut-off events. [2023-08-24 12:57:05,096 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 12:57:05,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:57:05,096 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-24 12:57:05,096 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:57:05,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:57:05,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1761864695, now seen corresponding path program 1 times [2023-08-24 12:57:05,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:57:05,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928436196] [2023-08-24 12:57:05,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:57:05,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:57:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:57:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 12:57:05,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:57:05,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928436196] [2023-08-24 12:57:05,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928436196] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:57:05,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:57:05,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 12:57:05,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509648783] [2023-08-24 12:57:05,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:57:05,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:57:05,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:57:05,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:57:05,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 12:57:05,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 491 [2023-08-24 12:57:05,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states 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:57:05,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:57:05,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 491 [2023-08-24 12:57:05,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:57:05,849 INFO L124 PetriNetUnfolderBase]: 10521/16515 cut-off events. [2023-08-24 12:57:05,850 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-08-24 12:57:05,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32050 conditions, 16515 events. 10521/16515 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 109345 event pairs, 9818 based on Foata normal form. 2499/16448 useless extension candidates. Maximal degree in co-relation 13969. Up to 15431 conditions per place. [2023-08-24 12:57:05,881 INFO L140 encePairwiseOnDemand]: 457/491 looper letters, 38 selfloop transitions, 2 changer transitions 23/70 dead transitions. [2023-08-24 12:57:05,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 274 flow [2023-08-24 12:57:05,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:57:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:57:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 735 transitions. [2023-08-24 12:57:05,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4989816700610998 [2023-08-24 12:57:05,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 735 transitions. [2023-08-24 12:57:05,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 735 transitions. [2023-08-24 12:57:05,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:57:05,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 735 transitions. [2023-08-24 12:57:05,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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:57:05,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 491.0) internal successors, (1964), 4 states have internal predecessors, (1964), 0 states have call successors, (0), 0 states 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:57:05,884 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 491.0) internal successors, (1964), 4 states have internal predecessors, (1964), 0 states have call successors, (0), 0 states 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:57:05,884 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 218 flow. Second operand 3 states and 735 transitions. [2023-08-24 12:57:05,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 274 flow [2023-08-24 12:57:05,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 274 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:57:05,885 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 116 flow [2023-08-24 12:57:05,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, 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=116, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2023-08-24 12:57:05,886 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-24 12:57:05,886 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 116 flow [2023-08-24 12:57:05,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states 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:57:05,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:57:05,886 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-24 12:57:05,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-08-24 12:57:05,886 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:57:05,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:57:05,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1260707836, now seen corresponding path program 1 times [2023-08-24 12:57:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:57:05,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296739924] [2023-08-24 12:57:05,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:57:05,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:57:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:57:05,914 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 12:57:05,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:57:05,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296739924] [2023-08-24 12:57:05,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296739924] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:57:05,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388971887] [2023-08-24 12:57:05,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:57:05,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:57:05,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:57:05,916 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:57:05,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-08-24 12:57:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:57:06,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 12:57:06,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:57:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 12:57:06,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:57:06,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 12:57:06,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388971887] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:57:06,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:57:06,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 12:57:06,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571366002] [2023-08-24 12:57:06,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:57:06,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:57:06,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:57:06,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:57:06,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-24 12:57:06,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 491 [2023-08-24 12:57:06,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 47 transitions, 116 flow. Second operand has 7 states, 7 states have (on average 216.71428571428572) internal successors, (1517), 7 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states 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:57:06,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:57:06,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 491 [2023-08-24 12:57:06,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:57:06,343 INFO L124 PetriNetUnfolderBase]: 1958/3219 cut-off events. [2023-08-24 12:57:06,343 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-08-24 12:57:06,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6300 conditions, 3219 events. 1958/3219 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 17490 event pairs, 1837 based on Foata normal form. 0/2639 useless extension candidates. Maximal degree in co-relation 6287. Up to 2999 conditions per place. [2023-08-24 12:57:06,351 INFO L140 encePairwiseOnDemand]: 488/491 looper letters, 38 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2023-08-24 12:57:06,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 214 flow [2023-08-24 12:57:06,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:57:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:57:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1336 transitions. [2023-08-24 12:57:06,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45349626612355737 [2023-08-24 12:57:06,353 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1336 transitions. [2023-08-24 12:57:06,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1336 transitions. [2023-08-24 12:57:06,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:57:06,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1336 transitions. [2023-08-24 12:57:06,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 222.66666666666666) internal successors, (1336), 6 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states 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:57:06,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 491.0) internal successors, (3437), 7 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states 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:57:06,360 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 491.0) internal successors, (3437), 7 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states 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:57:06,360 INFO L175 Difference]: Start difference. First operand has 71 places, 47 transitions, 116 flow. Second operand 6 states and 1336 transitions. [2023-08-24 12:57:06,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 214 flow [2023-08-24 12:57:06,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 208 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-24 12:57:06,361 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 146 flow [2023-08-24 12:57:06,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-24 12:57:06,362 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2023-08-24 12:57:06,362 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 146 flow [2023-08-24 12:57:06,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 216.71428571428572) internal successors, (1517), 7 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states 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:57:06,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:57:06,362 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-24 12:57:06,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2023-08-24 12:57:06,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-08-24 12:57:06,567 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:57:06,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:57:06,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1060570935, now seen corresponding path program 2 times [2023-08-24 12:57:06,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:57:06,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220826075] [2023-08-24 12:57:06,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:57:06,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:57:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:57:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 12:57:06,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:57:06,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220826075] [2023-08-24 12:57:06,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220826075] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:57:06,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997868222] [2023-08-24 12:57:06,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:57:06,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:57:06,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:57:06,628 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:57:06,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-08-24 12:57:06,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:57:06,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:57:06,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 12:57:06,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:57:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 12:57:06,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:57:06,895 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 12:57:06,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997868222] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:57:06,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:57:06,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-24 12:57:06,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375412212] [2023-08-24 12:57:06,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:57:06,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 12:57:06,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:57:06,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 12:57:06,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-24 12:57:06,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 491 [2023-08-24 12:57:06,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 146 flow. Second operand has 13 states, 13 states have (on average 216.3846153846154) internal successors, (2813), 13 states have internal predecessors, (2813), 0 states have call successors, (0), 0 states 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:57:06,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:57:06,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 491 [2023-08-24 12:57:06,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:57:07,122 INFO L124 PetriNetUnfolderBase]: 1958/3225 cut-off events. [2023-08-24 12:57:07,122 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-08-24 12:57:07,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6331 conditions, 3225 events. 1958/3225 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 17528 event pairs, 1837 based on Foata normal form. 6/2652 useless extension candidates. Maximal degree in co-relation 6272. Up to 2999 conditions per place. [2023-08-24 12:57:07,130 INFO L140 encePairwiseOnDemand]: 488/491 looper letters, 38 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2023-08-24 12:57:07,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 56 transitions, 280 flow [2023-08-24 12:57:07,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 12:57:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 12:57:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2635 transitions. [2023-08-24 12:57:07,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4472165648336728 [2023-08-24 12:57:07,136 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2635 transitions. [2023-08-24 12:57:07,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2635 transitions. [2023-08-24 12:57:07,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:57:07,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2635 transitions. [2023-08-24 12:57:07,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 219.58333333333334) internal successors, (2635), 12 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states 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:57:07,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 491.0) internal successors, (6383), 13 states have internal predecessors, (6383), 0 states have call successors, (0), 0 states 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:57:07,143 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 491.0) internal successors, (6383), 13 states have internal predecessors, (6383), 0 states have call successors, (0), 0 states 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:57:07,143 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 146 flow. Second operand 12 states and 2635 transitions. [2023-08-24 12:57:07,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 56 transitions, 280 flow [2023-08-24 12:57:07,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 56 transitions, 266 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 12:57:07,145 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 216 flow [2023-08-24 12:57:07,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=491, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=216, PETRI_PLACES=74, PETRI_TRANSITIONS=56} [2023-08-24 12:57:07,145 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2023-08-24 12:57:07,146 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 216 flow [2023-08-24 12:57:07,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 216.3846153846154) internal successors, (2813), 13 states have internal predecessors, (2813), 0 states have call successors, (0), 0 states 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:57:07,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:57:07,146 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-24 12:57:07,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-08-24 12:57:07,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-08-24 12:57:07,351 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:57:07,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:57:07,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1618648041, now seen corresponding path program 3 times [2023-08-24 12:57:07,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:57:07,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153125054] [2023-08-24 12:57:07,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:57:07,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:57:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 12:57:07,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 12:57:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 12:57:07,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 12:57:07,409 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 12:57:07,410 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-24 12:57:07,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-08-24 12:57:07,410 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-24 12:57:07,410 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-24 12:57:07,410 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 12:57:07,410 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-24 12:57:07,465 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-24 12:57:07,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 290 places, 342 transitions, 714 flow [2023-08-24 12:57:07,551 INFO L124 PetriNetUnfolderBase]: 110/641 cut-off events. [2023-08-24 12:57:07,551 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2023-08-24 12:57:07,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 641 events. 110/641 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2834 event pairs, 1 based on Foata normal form. 0/520 useless extension candidates. Maximal degree in co-relation 446. Up to 16 conditions per place. [2023-08-24 12:57:07,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 342 transitions, 714 flow [2023-08-24 12:57:07,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 290 places, 342 transitions, 714 flow [2023-08-24 12:57:07,572 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 12:57:07,572 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 290 places, 342 transitions, 714 flow [2023-08-24 12:57:07,572 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 290 places, 342 transitions, 714 flow [2023-08-24 12:57:07,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 290 places, 342 transitions, 714 flow [2023-08-24 12:57:07,634 INFO L124 PetriNetUnfolderBase]: 110/641 cut-off events. [2023-08-24 12:57:07,634 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2023-08-24 12:57:07,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 641 events. 110/641 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2834 event pairs, 1 based on Foata normal form. 0/520 useless extension candidates. Maximal degree in co-relation 446. Up to 16 conditions per place. [2023-08-24 12:57:07,653 INFO L119 LiptonReduction]: Number of co-enabled transitions 66456 [2023-08-24 12:57:12,644 INFO L134 LiptonReduction]: Checked pairs total: 113035 [2023-08-24 12:57:12,645 INFO L136 LiptonReduction]: Total number of compositions: 285 [2023-08-24 12:57:12,645 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 12:57:12,646 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;@70638694, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 12:57:12,646 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 12:57:12,647 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 12:57:12,647 INFO L124 PetriNetUnfolderBase]: 8/30 cut-off events. [2023-08-24 12:57:12,647 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:57:12,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:57:12,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-24 12:57:12,647 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 12:57:12,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:57:12,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1100044698, now seen corresponding path program 1 times [2023-08-24 12:57:12,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:57:12,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435756206] [2023-08-24 12:57:12,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:57:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:57:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:57:12,662 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:57:12,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:57:12,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435756206] [2023-08-24 12:57:12,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435756206] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:57:12,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:57:12,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 12:57:12,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471582158] [2023-08-24 12:57:12,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:57:12,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:57:12,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:57:12,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:57:12,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 12:57:12,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 627 [2023-08-24 12:57:12,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 130 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states 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:57:12,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:57:12,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 627 [2023-08-24 12:57:12,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:57:27,328 INFO L124 PetriNetUnfolderBase]: 199178/283337 cut-off events. [2023-08-24 12:57:27,328 INFO L125 PetriNetUnfolderBase]: For 3132/3132 co-relation queries the response was YES. [2023-08-24 12:57:27,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544756 conditions, 283337 events. 199178/283337 cut-off events. For 3132/3132 co-relation queries the response was YES. Maximal size of possible extension queue 7633. Compared 2266916 event pairs, 188343 based on Foata normal form. 51888/290822 useless extension candidates. Maximal degree in co-relation 50656. Up to 259483 conditions per place. [2023-08-24 12:57:28,662 INFO L140 encePairwiseOnDemand]: 583/627 looper letters, 69 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2023-08-24 12:57:28,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 352 flow [2023-08-24 12:57:28,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:57:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:57:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 932 transitions. [2023-08-24 12:57:28,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954811270600744 [2023-08-24 12:57:28,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 932 transitions. [2023-08-24 12:57:28,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 932 transitions. [2023-08-24 12:57:28,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:57:28,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 932 transitions. [2023-08-24 12:57:28,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states 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:57:28,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 627.0) internal successors, (2508), 4 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states 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:57:28,666 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 627.0) internal successors, (2508), 4 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states 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:57:28,666 INFO L175 Difference]: Start difference. First operand has 88 places, 130 transitions, 290 flow. Second operand 3 states and 932 transitions. [2023-08-24 12:57:28,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 352 flow [2023-08-24 12:57:28,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 90 transitions, 352 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:57:28,668 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 220 flow [2023-08-24 12:57:28,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2023-08-24 12:57:28,669 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 3 predicate places. [2023-08-24 12:57:28,669 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 220 flow [2023-08-24 12:57:28,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states 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:57:28,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:57:28,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:57:28,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-08-24 12:57:28,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 12:57:28,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:57:28,669 INFO L85 PathProgramCache]: Analyzing trace with hash -682828215, now seen corresponding path program 1 times [2023-08-24 12:57:28,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:57:28,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073048217] [2023-08-24 12:57:28,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:57:28,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:57:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:57:28,688 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:57:28,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:57:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073048217] [2023-08-24 12:57:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073048217] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:57:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536082544] [2023-08-24 12:57:28,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:57:28,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:57:28,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:57:28,689 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:57:28,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-08-24 12:57:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:57:28,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-24 12:57:28,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:57:28,852 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:57:28,852 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:57:28,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536082544] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:57:28,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:57:28,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-24 12:57:28,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203301898] [2023-08-24 12:57:28,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:57:28,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:57:28,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:57:28,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:57:28,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 12:57:28,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 627 [2023-08-24 12:57:28,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states 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:57:28,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:57:28,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 627 [2023-08-24 12:57:28,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:57:43,452 INFO L124 PetriNetUnfolderBase]: 199267/282260 cut-off events. [2023-08-24 12:57:43,452 INFO L125 PetriNetUnfolderBase]: For 3088/3088 co-relation queries the response was YES. [2023-08-24 12:57:43,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543726 conditions, 282260 events. 199267/282260 cut-off events. For 3088/3088 co-relation queries the response was YES. Maximal size of possible extension queue 7594. Compared 2240965 event pairs, 123187 based on Foata normal form. 0/237982 useless extension candidates. Maximal degree in co-relation 543712. Up to 259453 conditions per place. [2023-08-24 12:57:44,628 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 85 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2023-08-24 12:57:44,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 106 transitions, 426 flow [2023-08-24 12:57:44,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:57:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:57:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2023-08-24 12:57:44,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48165869218500795 [2023-08-24 12:57:44,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 906 transitions. [2023-08-24 12:57:44,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 906 transitions. [2023-08-24 12:57:44,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:57:44,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 906 transitions. [2023-08-24 12:57:44,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 0 states have call successors, (0), 0 states 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:57:44,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 627.0) internal successors, (2508), 4 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states 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:57:44,632 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 627.0) internal successors, (2508), 4 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states 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:57:44,632 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 220 flow. Second operand 3 states and 906 transitions. [2023-08-24 12:57:44,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 106 transitions, 426 flow [2023-08-24 12:57:44,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 106 transitions, 422 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 12:57:44,633 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 228 flow [2023-08-24 12:57:44,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2023-08-24 12:57:44,634 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2023-08-24 12:57:44,634 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 228 flow [2023-08-24 12:57:44,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states 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:57:44,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:57:44,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:57:44,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2023-08-24 12:57:44,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2023-08-24 12:57:44,838 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 12:57:44,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:57:44,839 INFO L85 PathProgramCache]: Analyzing trace with hash 213915197, now seen corresponding path program 1 times [2023-08-24 12:57:44,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:57:44,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559076785] [2023-08-24 12:57:44,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:57:44,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:57:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:57:44,860 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:57:44,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:57:44,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559076785] [2023-08-24 12:57:44,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559076785] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:57:44,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412605844] [2023-08-24 12:57:44,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:57:44,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:57:44,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:57:44,863 INFO L229 MonitoredProcess]: Starting monitored process 37 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:57:44,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-08-24 12:57:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:57:45,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 12:57:45,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:57:45,032 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:57:45,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:57:45,044 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:57:45,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412605844] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:57:45,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:57:45,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 12:57:45,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248793606] [2023-08-24 12:57:45,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:57:45,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:57:45,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:57:45,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:57:45,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-24 12:57:45,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 627 [2023-08-24 12:57:45,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 274.85714285714283) internal successors, (1924), 7 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states 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:57:45,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:57:45,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 627 [2023-08-24 12:57:45,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:58:00,464 INFO L124 PetriNetUnfolderBase]: 200915/283582 cut-off events. [2023-08-24 12:58:00,465 INFO L125 PetriNetUnfolderBase]: For 10256/10256 co-relation queries the response was YES. [2023-08-24 12:58:00,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552245 conditions, 283582 events. 200915/283582 cut-off events. For 10256/10256 co-relation queries the response was YES. Maximal size of possible extension queue 7564. Compared 2230325 event pairs, 188343 based on Foata normal form. 3/242695 useless extension candidates. Maximal degree in co-relation 552216. Up to 259469 conditions per place. [2023-08-24 12:58:01,720 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 70 selfloop transitions, 5 changer transitions 0/94 dead transitions. [2023-08-24 12:58:01,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 390 flow [2023-08-24 12:58:01,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:58:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:58:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1715 transitions. [2023-08-24 12:58:01,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45587453482190327 [2023-08-24 12:58:01,722 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1715 transitions. [2023-08-24 12:58:01,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1715 transitions. [2023-08-24 12:58:01,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:58:01,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1715 transitions. [2023-08-24 12:58:01,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 285.8333333333333) internal successors, (1715), 6 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states 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:58:01,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 627.0) internal successors, (4389), 7 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states 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:58:01,725 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 627.0) internal successors, (4389), 7 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states 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:58:01,725 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 228 flow. Second operand 6 states and 1715 transitions. [2023-08-24 12:58:01,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 390 flow [2023-08-24 12:58:01,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 12:58:01,732 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 262 flow [2023-08-24 12:58:01,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2023-08-24 12:58:01,733 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 12 predicate places. [2023-08-24 12:58:01,733 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 262 flow [2023-08-24 12:58:01,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 274.85714285714283) internal successors, (1924), 7 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states 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:58:01,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:58:01,733 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:58:01,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2023-08-24 12:58:01,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:58:01,938 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 12:58:01,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:58:01,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1514439718, now seen corresponding path program 2 times [2023-08-24 12:58:01,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:58:01,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647388895] [2023-08-24 12:58:01,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:58:01,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:58:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:58:01,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:58:01,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:58:01,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647388895] [2023-08-24 12:58:01,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647388895] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:58:01,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020813598] [2023-08-24 12:58:01,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:58:01,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:58:01,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:58:01,984 INFO L229 MonitoredProcess]: Starting monitored process 38 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:58:01,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-08-24 12:58:02,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 12:58:02,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:58:02,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-24 12:58:02,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:58:02,155 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:58:02,195 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:58:02,195 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:58:02,215 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 12:58:02,256 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:58:02,256 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:58:02,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020813598] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:58:02,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:58:02,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-24 12:58:02,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352345045] [2023-08-24 12:58:02,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:58:02,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 12:58:02,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:58:02,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 12:58:02,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-24 12:58:02,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 627 [2023-08-24 12:58:02,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states 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:58:02,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:58:02,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 627 [2023-08-24 12:58:02,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:58:23,417 INFO L124 PetriNetUnfolderBase]: 266830/374105 cut-off events. [2023-08-24 12:58:23,418 INFO L125 PetriNetUnfolderBase]: For 13301/13301 co-relation queries the response was YES. [2023-08-24 12:58:24,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738120 conditions, 374105 events. 266830/374105 cut-off events. For 13301/13301 co-relation queries the response was YES. Maximal size of possible extension queue 9695. Compared 2978944 event pairs, 52310 based on Foata normal form. 0/327033 useless extension candidates. Maximal degree in co-relation 738083. Up to 299605 conditions per place. [2023-08-24 12:58:25,431 INFO L140 encePairwiseOnDemand]: 617/627 looper letters, 202 selfloop transitions, 18 changer transitions 0/235 dead transitions. [2023-08-24 12:58:25,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 235 transitions, 1035 flow [2023-08-24 12:58:25,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:58:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:58:25,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1615 transitions. [2023-08-24 12:58:25,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2023-08-24 12:58:25,433 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1615 transitions. [2023-08-24 12:58:25,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1615 transitions. [2023-08-24 12:58:25,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:58:25,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1615 transitions. [2023-08-24 12:58:25,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 269.1666666666667) internal successors, (1615), 6 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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:58:25,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 627.0) internal successors, (4389), 7 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states 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:58:25,437 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 627.0) internal successors, (4389), 7 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states 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:58:25,437 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 262 flow. Second operand 6 states and 1615 transitions. [2023-08-24 12:58:25,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 235 transitions, 1035 flow [2023-08-24 12:58:25,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 235 transitions, 1021 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 12:58:25,445 INFO L231 Difference]: Finished difference. Result has 107 places, 110 transitions, 353 flow [2023-08-24 12:58:25,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=107, PETRI_TRANSITIONS=110} [2023-08-24 12:58:25,445 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 19 predicate places. [2023-08-24 12:58:25,445 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 110 transitions, 353 flow [2023-08-24 12:58:25,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states 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:58:25,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:58:25,446 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:58:25,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-08-24 12:58:25,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2023-08-24 12:58:25,651 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 12:58:25,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:58:25,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2078641643, now seen corresponding path program 1 times [2023-08-24 12:58:25,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:58:25,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128712187] [2023-08-24 12:58:25,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:58:25,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:58:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:58:25,725 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:58:25,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:58:25,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128712187] [2023-08-24 12:58:25,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128712187] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:58:25,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967363116] [2023-08-24 12:58:25,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:58:25,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:58:25,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:58:25,749 INFO L229 MonitoredProcess]: Starting monitored process 39 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:58:25,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-08-24 12:58:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:58:25,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 12:58:25,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:58:26,010 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:58:26,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:58:26,060 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:58:26,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967363116] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:58:26,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:58:26,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-24 12:58:26,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960783939] [2023-08-24 12:58:26,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:58:26,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 12:58:26,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:58:26,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 12:58:26,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-24 12:58:26,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 627 [2023-08-24 12:58:26,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 110 transitions, 353 flow. Second operand has 13 states, 13 states have (on average 274.6923076923077) internal successors, (3571), 13 states have internal predecessors, (3571), 0 states have call successors, (0), 0 states 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:58:26,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:58:26,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 627 [2023-08-24 12:58:26,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:58:44,674 INFO L124 PetriNetUnfolderBase]: 209229/299273 cut-off events. [2023-08-24 12:58:44,674 INFO L125 PetriNetUnfolderBase]: For 59038/59404 co-relation queries the response was YES. [2023-08-24 12:58:45,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634607 conditions, 299273 events. 209229/299273 cut-off events. For 59038/59404 co-relation queries the response was YES. Maximal size of possible extension queue 8582. Compared 2442808 event pairs, 186179 based on Foata normal form. 6/269735 useless extension candidates. Maximal degree in co-relation 634548. Up to 276706 conditions per place. [2023-08-24 12:58:46,446 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 86 selfloop transitions, 11 changer transitions 0/116 dead transitions. [2023-08-24 12:58:46,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 583 flow [2023-08-24 12:58:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 12:58:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 12:58:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3362 transitions. [2023-08-24 12:58:46,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4468367889420521 [2023-08-24 12:58:46,448 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3362 transitions. [2023-08-24 12:58:46,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3362 transitions. [2023-08-24 12:58:46,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:58:46,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3362 transitions. [2023-08-24 12:58:46,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 280.1666666666667) internal successors, (3362), 12 states have internal predecessors, (3362), 0 states have call successors, (0), 0 states 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:58:46,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 627.0) internal successors, (8151), 13 states have internal predecessors, (8151), 0 states have call successors, (0), 0 states 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:58:46,453 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 627.0) internal successors, (8151), 13 states have internal predecessors, (8151), 0 states have call successors, (0), 0 states 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:58:46,453 INFO L175 Difference]: Start difference. First operand has 107 places, 110 transitions, 353 flow. Second operand 12 states and 3362 transitions. [2023-08-24 12:58:46,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 583 flow [2023-08-24 12:58:46,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 116 transitions, 583 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:58:46,548 INFO L231 Difference]: Finished difference. Result has 124 places, 116 transitions, 437 flow [2023-08-24 12:58:46,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=437, PETRI_PLACES=124, PETRI_TRANSITIONS=116} [2023-08-24 12:58:46,548 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 36 predicate places. [2023-08-24 12:58:46,548 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 116 transitions, 437 flow [2023-08-24 12:58:46,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 274.6923076923077) internal successors, (3571), 13 states have internal predecessors, (3571), 0 states have call successors, (0), 0 states 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:58:46,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:58:46,549 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:58:46,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2023-08-24 12:58:46,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-08-24 12:58:46,753 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 12:58:46,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:58:46,754 INFO L85 PathProgramCache]: Analyzing trace with hash -732310773, now seen corresponding path program 2 times [2023-08-24 12:58:46,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:58:46,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434595008] [2023-08-24 12:58:46,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:58:46,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:58:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:58:46,891 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:58:46,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:58:46,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434595008] [2023-08-24 12:58:46,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434595008] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:58:46,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555604162] [2023-08-24 12:58:46,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:58:46,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:58:46,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:58:46,892 INFO L229 MonitoredProcess]: Starting monitored process 40 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:58:46,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-08-24 12:58:47,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:58:47,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:58:47,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-24 12:58:47,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:58:47,096 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:58:47,164 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:58:47,164 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:58:47,183 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:58:47,204 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:58:47,245 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:58:47,245 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:58:55,294 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2621 (Array Int Int)) (|t_funThread2of3ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2621) |c_~#a~0.base|) |t_funThread2of3ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:58:55,366 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:58:55,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555604162] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:58:55,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:58:55,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2023-08-24 12:58:55,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212489216] [2023-08-24 12:58:55,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:58:55,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 12:58:55,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:58:55,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 12:58:55,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=136, Unknown=2, NotChecked=24, Total=210 [2023-08-24 12:58:55,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 627 [2023-08-24 12:58:55,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 116 transitions, 437 flow. Second operand has 15 states, 15 states have (on average 210.4) internal successors, (3156), 15 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states 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:58:55,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:58:55,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 627 [2023-08-24 12:58:55,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:59:31,221 INFO L124 PetriNetUnfolderBase]: 370423/510761 cut-off events. [2023-08-24 12:59:31,221 INFO L125 PetriNetUnfolderBase]: For 87618/87618 co-relation queries the response was YES. [2023-08-24 12:59:32,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093409 conditions, 510761 events. 370423/510761 cut-off events. For 87618/87618 co-relation queries the response was YES. Maximal size of possible extension queue 11419. Compared 3933928 event pairs, 71696 based on Foata normal form. 0/470409 useless extension candidates. Maximal degree in co-relation 1093325. Up to 373462 conditions per place. [2023-08-24 12:59:34,500 INFO L140 encePairwiseOnDemand]: 613/627 looper letters, 265 selfloop transitions, 36 changer transitions 0/312 dead transitions. [2023-08-24 12:59:34,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 312 transitions, 1550 flow [2023-08-24 12:59:34,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 12:59:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 12:59:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1737 transitions. [2023-08-24 12:59:34,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39576213260423787 [2023-08-24 12:59:34,502 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1737 transitions. [2023-08-24 12:59:34,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1737 transitions. [2023-08-24 12:59:34,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:59:34,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1737 transitions. [2023-08-24 12:59:34,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 248.14285714285714) internal successors, (1737), 7 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states 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:59:34,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 627.0) internal successors, (5016), 8 states have internal predecessors, (5016), 0 states have call successors, (0), 0 states 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:59:34,506 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 627.0) internal successors, (5016), 8 states have internal predecessors, (5016), 0 states have call successors, (0), 0 states 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:59:34,506 INFO L175 Difference]: Start difference. First operand has 124 places, 116 transitions, 437 flow. Second operand 7 states and 1737 transitions. [2023-08-24 12:59:34,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 312 transitions, 1550 flow [2023-08-24 12:59:34,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 312 transitions, 1502 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-24 12:59:34,792 INFO L231 Difference]: Finished difference. Result has 129 places, 136 transitions, 614 flow [2023-08-24 12:59:34,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=614, PETRI_PLACES=129, PETRI_TRANSITIONS=136} [2023-08-24 12:59:34,792 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 41 predicate places. [2023-08-24 12:59:34,792 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 136 transitions, 614 flow [2023-08-24 12:59:34,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 210.4) internal successors, (3156), 15 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states 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:59:34,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:59:34,793 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:59:34,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2023-08-24 12:59:34,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2023-08-24 12:59:34,998 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 12:59:34,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:59:34,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1805992149, now seen corresponding path program 1 times [2023-08-24 12:59:34,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:59:34,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307633885] [2023-08-24 12:59:34,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:59:34,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:59:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:59:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-08-24 12:59:35,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:59:35,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307633885] [2023-08-24 12:59:35,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307633885] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:59:35,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028696092] [2023-08-24 12:59:35,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:59:35,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:59:35,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:59:35,186 INFO L229 MonitoredProcess]: Starting monitored process 41 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:59:35,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-08-24 12:59:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:59:35,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-24 12:59:35,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:59:35,376 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:59:35,448 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:59:35,448 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:59:35,465 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:59:35,486 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:59:35,506 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 12:59:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-08-24 12:59:35,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:59:43,598 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread3of3ForFork0_~p~0#1.offset| Int) (v_ArrVal_2691 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2691) |c_~#a~0.base|) |t_funThread3of3ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-24 12:59:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 2 not checked. [2023-08-24 12:59:43,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028696092] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:59:43,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:59:43,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2023-08-24 12:59:43,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47385153] [2023-08-24 12:59:43,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:59:43,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 12:59:43,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:59:43,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 12:59:43,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=4, NotChecked=24, Total=210 [2023-08-24 12:59:43,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 627 [2023-08-24 12:59:43,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 136 transitions, 614 flow. Second operand has 15 states, 15 states have (on average 210.6) internal successors, (3159), 15 states have internal predecessors, (3159), 0 states have call successors, (0), 0 states 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:59:43,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:59:43,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 627 [2023-08-24 12:59:43,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:00:26,451 INFO L124 PetriNetUnfolderBase]: 408544/567520 cut-off events. [2023-08-24 13:00:26,451 INFO L125 PetriNetUnfolderBase]: For 232718/232718 co-relation queries the response was YES. [2023-08-24 13:00:28,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315163 conditions, 567520 events. 408544/567520 cut-off events. For 232718/232718 co-relation queries the response was YES. Maximal size of possible extension queue 13257. Compared 4479343 event pairs, 96043 based on Foata normal form. 0/531708 useless extension candidates. Maximal degree in co-relation 1315098. Up to 426262 conditions per place. [2023-08-24 13:00:30,015 INFO L140 encePairwiseOnDemand]: 613/627 looper letters, 266 selfloop transitions, 54 changer transitions 3/334 dead transitions. [2023-08-24 13:00:30,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 334 transitions, 1896 flow [2023-08-24 13:00:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 13:00:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 13:00:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1731 transitions. [2023-08-24 13:00:30,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3943950786056049 [2023-08-24 13:00:30,017 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1731 transitions. [2023-08-24 13:00:30,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1731 transitions. [2023-08-24 13:00:30,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:00:30,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1731 transitions. [2023-08-24 13:00:30,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 247.28571428571428) internal successors, (1731), 7 states have internal predecessors, (1731), 0 states have call successors, (0), 0 states 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 13:00:30,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 627.0) internal successors, (5016), 8 states have internal predecessors, (5016), 0 states have call successors, (0), 0 states 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 13:00:30,020 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 627.0) internal successors, (5016), 8 states have internal predecessors, (5016), 0 states have call successors, (0), 0 states 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 13:00:30,020 INFO L175 Difference]: Start difference. First operand has 129 places, 136 transitions, 614 flow. Second operand 7 states and 1731 transitions. [2023-08-24 13:00:30,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 334 transitions, 1896 flow [2023-08-24 13:00:30,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 334 transitions, 1896 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 13:00:30,950 INFO L231 Difference]: Finished difference. Result has 139 places, 164 transitions, 1022 flow [2023-08-24 13:00:30,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1022, PETRI_PLACES=139, PETRI_TRANSITIONS=164} [2023-08-24 13:00:30,950 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 51 predicate places. [2023-08-24 13:00:30,951 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 164 transitions, 1022 flow [2023-08-24 13:00:30,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 210.6) internal successors, (3159), 15 states have internal predecessors, (3159), 0 states have call successors, (0), 0 states 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 13:00:30,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:00:30,951 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 13:00:30,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2023-08-24 13:00:31,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2023-08-24 13:00:31,157 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 13:00:31,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:00:31,157 INFO L85 PathProgramCache]: Analyzing trace with hash 181912325, now seen corresponding path program 1 times [2023-08-24 13:00:31,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:00:31,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318960906] [2023-08-24 13:00:31,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:00:31,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:00:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:00:31,196 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 13:00:31,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:00:31,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318960906] [2023-08-24 13:00:31,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318960906] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:00:31,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945561477] [2023-08-24 13:00:31,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:00:31,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:00:31,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:00:31,197 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 13:00:31,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-08-24 13:00:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:00:31,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 13:00:31,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:00:31,442 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 13:00:31,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 13:00:31,466 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 13:00:31,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945561477] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 13:00:31,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 13:00:31,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-24 13:00:31,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311458307] [2023-08-24 13:00:31,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 13:00:31,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 13:00:31,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:00:31,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 13:00:31,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-24 13:00:31,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 627 [2023-08-24 13:00:31,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 164 transitions, 1022 flow. Second operand has 7 states, 7 states have (on average 276.7142857142857) internal successors, (1937), 7 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states 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 13:00:31,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:00:31,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 627 [2023-08-24 13:00:31,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:00:35,862 INFO L124 PetriNetUnfolderBase]: 32900/51024 cut-off events. [2023-08-24 13:00:35,863 INFO L125 PetriNetUnfolderBase]: For 53495/53495 co-relation queries the response was YES. [2023-08-24 13:00:36,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143764 conditions, 51024 events. 32900/51024 cut-off events. For 53495/53495 co-relation queries the response was YES. Maximal size of possible extension queue 2024. Compared 403849 event pairs, 2936 based on Foata normal form. 4551/53218 useless extension candidates. Maximal degree in co-relation 143693. Up to 32278 conditions per place. [2023-08-24 13:00:36,131 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 197 selfloop transitions, 4 changer transitions 10/225 dead transitions. [2023-08-24 13:00:36,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 225 transitions, 1583 flow [2023-08-24 13:00:36,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 13:00:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 13:00:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1779 transitions. [2023-08-24 13:00:36,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4728867623604466 [2023-08-24 13:00:36,133 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1779 transitions. [2023-08-24 13:00:36,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1779 transitions. [2023-08-24 13:00:36,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:00:36,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1779 transitions. [2023-08-24 13:00:36,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 296.5) internal successors, (1779), 6 states have internal predecessors, (1779), 0 states have call successors, (0), 0 states 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 13:00:36,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 627.0) internal successors, (4389), 7 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states 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 13:00:36,137 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 627.0) internal successors, (4389), 7 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states 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 13:00:36,137 INFO L175 Difference]: Start difference. First operand has 139 places, 164 transitions, 1022 flow. Second operand 6 states and 1779 transitions. [2023-08-24 13:00:36,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 225 transitions, 1583 flow [2023-08-24 13:00:36,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 225 transitions, 1541 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-08-24 13:00:36,199 INFO L231 Difference]: Finished difference. Result has 113 places, 99 transitions, 494 flow [2023-08-24 13:00:36,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=494, PETRI_PLACES=113, PETRI_TRANSITIONS=99} [2023-08-24 13:00:36,200 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 25 predicate places. [2023-08-24 13:00:36,200 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 99 transitions, 494 flow [2023-08-24 13:00:36,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 276.7142857142857) internal successors, (1937), 7 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states 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 13:00:36,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:00:36,200 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 13:00:36,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2023-08-24 13:00:36,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-08-24 13:00:36,406 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 13:00:36,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:00:36,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1585347052, now seen corresponding path program 1 times [2023-08-24 13:00:36,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:00:36,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911039365] [2023-08-24 13:00:36,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:00:36,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:00:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:00:36,472 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 13:00:36,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:00:36,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911039365] [2023-08-24 13:00:36,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911039365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:00:36,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:00:36,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 13:00:36,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662949858] [2023-08-24 13:00:36,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:00:36,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 13:00:36,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:00:36,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 13:00:36,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 13:00:36,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 627 [2023-08-24 13:00:36,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 99 transitions, 494 flow. Second operand has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states 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 13:00:36,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:00:36,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 627 [2023-08-24 13:00:36,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:00:39,147 INFO L124 PetriNetUnfolderBase]: 20182/33112 cut-off events. [2023-08-24 13:00:39,147 INFO L125 PetriNetUnfolderBase]: For 39520/39520 co-relation queries the response was YES. [2023-08-24 13:00:39,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91605 conditions, 33112 events. 20182/33112 cut-off events. For 39520/39520 co-relation queries the response was YES. Maximal size of possible extension queue 1361. Compared 265037 event pairs, 7449 based on Foata normal form. 3815/34593 useless extension candidates. Maximal degree in co-relation 91540. Up to 15937 conditions per place. [2023-08-24 13:00:39,269 INFO L140 encePairwiseOnDemand]: 605/627 looper letters, 126 selfloop transitions, 22 changer transitions 2/161 dead transitions. [2023-08-24 13:00:39,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 161 transitions, 1124 flow [2023-08-24 13:00:39,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 13:00:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 13:00:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1030 transitions. [2023-08-24 13:00:39,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41068580542264754 [2023-08-24 13:00:39,270 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1030 transitions. [2023-08-24 13:00:39,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1030 transitions. [2023-08-24 13:00:39,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:00:39,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1030 transitions. [2023-08-24 13:00:39,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 257.5) internal successors, (1030), 4 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states 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 13:00:39,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 627.0) internal successors, (3135), 5 states have internal predecessors, (3135), 0 states have call successors, (0), 0 states 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 13:00:39,272 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 627.0) internal successors, (3135), 5 states have internal predecessors, (3135), 0 states have call successors, (0), 0 states 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 13:00:39,272 INFO L175 Difference]: Start difference. First operand has 113 places, 99 transitions, 494 flow. Second operand 4 states and 1030 transitions. [2023-08-24 13:00:39,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 161 transitions, 1124 flow [2023-08-24 13:00:39,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 161 transitions, 1109 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-24 13:00:39,292 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 598 flow [2023-08-24 13:00:39,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=598, PETRI_PLACES=114, PETRI_TRANSITIONS=111} [2023-08-24 13:00:39,292 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 26 predicate places. [2023-08-24 13:00:39,292 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 598 flow [2023-08-24 13:00:39,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states 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 13:00:39,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:00:39,293 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 13:00:39,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-08-24 13:00:39,293 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 13:00:39,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:00:39,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1251986578, now seen corresponding path program 1 times [2023-08-24 13:00:39,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:00:39,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157597883] [2023-08-24 13:00:39,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:00:39,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:00:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:00:39,533 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 13:00:39,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:00:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157597883] [2023-08-24 13:00:39,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157597883] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:00:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558003173] [2023-08-24 13:00:39,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:00:39,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:00:39,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:00:39,534 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 13:00:39,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2023-08-24 13:00:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:00:39,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-24 13:00:39,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:00:39,729 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 13:00:39,800 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 13:00:39,801 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 13:00:39,821 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 13:00:39,842 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 13:00:39,864 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 13:00:39,912 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 13:00:39,913 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 13:00:39,958 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 13:00:40,001 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 13:00:40,001 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 13:00:40,090 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 13:00:40,094 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 13:00:46,155 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2879 (Array Int Int)) (v_ArrVal_2882 Int) (|v_t_funThread2of3ForFork0_~p~0#1.offset_68| Int) (|v_t_funThread1of3ForFork0_~p~0#1.offset_68| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2879) |c_~#a~0.base|) |v_t_funThread1of3ForFork0_~p~0#1.offset_68| v_ArrVal_2882) |v_t_funThread2of3ForFork0_~p~0#1.offset_68|) 0) (= |v_t_funThread1of3ForFork0_~p~0#1.offset_68| |v_t_funThread2of3ForFork0_~p~0#1.offset_68|))) is different from false [2023-08-24 13:00:46,273 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 13:00:46,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558003173] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 13:00:46,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 13:00:46,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-08-24 13:00:46,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262423035] [2023-08-24 13:00:46,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 13:00:46,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-24 13:00:46,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:00:46,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-24 13:00:46,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=4, NotChecked=34, Total=380 [2023-08-24 13:00:46,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 627 [2023-08-24 13:00:46,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 111 transitions, 598 flow. Second operand has 20 states, 20 states have (on average 206.65) internal successors, (4133), 20 states have internal predecessors, (4133), 0 states have call successors, (0), 0 states 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 13:00:46,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:00:46,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 627 [2023-08-24 13:00:46,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:01:02,348 WARN L234 SmtUtils]: Spent 16.04s 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 13:01:04,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:07,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:09,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:01:11,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 [0, 1] [2023-08-24 13:01:13,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:15,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:01:17,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:19,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:01:21,237 WARN L539 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:01:23,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:25,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:27,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:29,310 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:01:31,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:33,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 13:01:35,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:41,576 INFO L124 PetriNetUnfolderBase]: 37172/59326 cut-off events. [2023-08-24 13:01:41,576 INFO L125 PetriNetUnfolderBase]: For 67048/67148 co-relation queries the response was YES. [2023-08-24 13:01:41,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188336 conditions, 59326 events. 37172/59326 cut-off events. For 67048/67148 co-relation queries the response was YES. Maximal size of possible extension queue 2194. Compared 494902 event pairs, 4856 based on Foata normal form. 309/55153 useless extension candidates. Maximal degree in co-relation 188270. Up to 26140 conditions per place. [2023-08-24 13:01:41,984 INFO L140 encePairwiseOnDemand]: 607/627 looper letters, 383 selfloop transitions, 90 changer transitions 40/521 dead transitions. [2023-08-24 13:01:41,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 521 transitions, 3506 flow [2023-08-24 13:01:41,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-24 13:01:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-24 13:01:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4071 transitions. [2023-08-24 13:01:41,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3607123870281765 [2023-08-24 13:01:41,994 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4071 transitions. [2023-08-24 13:01:41,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4071 transitions. [2023-08-24 13:01:41,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:01:41,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4071 transitions. [2023-08-24 13:01:41,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 226.16666666666666) internal successors, (4071), 18 states have internal predecessors, (4071), 0 states have call successors, (0), 0 states 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 13:01:42,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 627.0) internal successors, (11913), 19 states have internal predecessors, (11913), 0 states have call successors, (0), 0 states 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 13:01:42,003 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 627.0) internal successors, (11913), 19 states have internal predecessors, (11913), 0 states have call successors, (0), 0 states 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 13:01:42,003 INFO L175 Difference]: Start difference. First operand has 114 places, 111 transitions, 598 flow. Second operand 18 states and 4071 transitions. [2023-08-24 13:01:42,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 521 transitions, 3506 flow [2023-08-24 13:01:42,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 521 transitions, 3505 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 13:01:42,039 INFO L231 Difference]: Finished difference. Result has 143 places, 184 transitions, 1547 flow [2023-08-24 13:01:42,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1547, PETRI_PLACES=143, PETRI_TRANSITIONS=184} [2023-08-24 13:01:42,039 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 55 predicate places. [2023-08-24 13:01:42,039 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 184 transitions, 1547 flow [2023-08-24 13:01:42,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 206.65) internal successors, (4133), 20 states have internal predecessors, (4133), 0 states have call successors, (0), 0 states 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 13:01:42,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:01:42,040 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 13:01:42,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2023-08-24 13:01:42,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:01:42,248 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 13:01:42,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:01:42,249 INFO L85 PathProgramCache]: Analyzing trace with hash 794669148, now seen corresponding path program 2 times [2023-08-24 13:01:42,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:01:42,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636319271] [2023-08-24 13:01:42,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:01:42,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:01:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:01:42,682 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 13:01:42,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:01:42,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636319271] [2023-08-24 13:01:42,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636319271] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:01:42,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828900969] [2023-08-24 13:01:42,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 13:01:42,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:01:42,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:01:42,683 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 13:01:42,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2023-08-24 13:01:42,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 13:01:42,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 13:01:42,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-24 13:01:42,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:01:42,896 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 13:01:42,995 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 13:01:42,996 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 13:01:43,024 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 13:01:43,056 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-24 13:01:43,081 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 13:01:43,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 13:01:43,136 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 13:01:43,168 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 13:01:43,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 13:01:43,201 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 13:01:43,237 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 13:01:43,237 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 13:01:43,275 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 13:01:43,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 13:01:43,314 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of3ForFork0_~p~0#1.offset_70| Int) (v_ArrVal_2970 (Array Int Int))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of3ForFork0_~p~0#1.offset_70|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2970) |c_~#a~0.base|) (+ 4 |v_t_funThread2of3ForFork0_~p~0#1.offset_70|)) 0)))) is different from false [2023-08-24 13:01:43,384 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 13:01:43,384 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-24 13:01:43,392 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 13:01:43,392 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 13:01:43,396 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 13:01:55,509 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2969 Int) (|v_t_funThread2of3ForFork0_~p~0#1.offset_70| Int) (v_ArrVal_2964 (Array Int Int)) (|v_t_funThread1of3ForFork0_~p~0#1.offset_70| Int)) (or (= |v_t_funThread1of3ForFork0_~p~0#1.offset_70| |v_t_funThread2of3ForFork0_~p~0#1.offset_70|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2964) |c_~#a~0.base|) |v_t_funThread1of3ForFork0_~p~0#1.offset_70| v_ArrVal_2969) |v_t_funThread2of3ForFork0_~p~0#1.offset_70|) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-24 13:01:59,582 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 13:01:59,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828900969] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 13:01:59,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 13:01:59,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2023-08-24 13:01:59,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974486953] [2023-08-24 13:01:59,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 13:01:59,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-24 13:01:59,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:01:59,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-24 13:01:59,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=333, Unknown=6, NotChecked=78, Total=506 [2023-08-24 13:01:59,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 627 [2023-08-24 13:01:59,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 184 transitions, 1547 flow. Second operand has 23 states, 23 states have (on average 206.30434782608697) internal successors, (4745), 23 states have internal predecessors, (4745), 0 states have call successors, (0), 0 states 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 13:01:59,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:01:59,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 627 [2023-08-24 13:01:59,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:02:23,801 WARN L234 SmtUtils]: Spent 24.18s on a formula simplification. DAG size of input: 42 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:02:25,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:02:27,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:02:30,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] Received shutdown request... [2023-08-24 13:02:40,458 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:02:40,458 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 13:02:41,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2023-08-24 13:02:41,659 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-24 13:02:41,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 13:02:41,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2023-08-24 13:02:41,679 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:226) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:183) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:123) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-08-24 13:02:41,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-24 13:02:41,706 INFO L158 Benchmark]: Toolchain (without parser) took 790754.84ms. Allocated memory was 398.5MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 373.2MB in the beginning and 10.4GB in the end (delta: -10.0GB). Peak memory consumption was 5.6GB. Max. memory is 16.0GB. [2023-08-24 13:02:41,706 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 398.5MB. Free memory is still 374.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 13:02:41,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.88ms. Allocated memory is still 398.5MB. Free memory was 372.9MB in the beginning and 343.3MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-24 13:02:41,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.39ms. Allocated memory is still 398.5MB. Free memory was 343.3MB in the beginning and 340.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 13:02:41,706 INFO L158 Benchmark]: Boogie Preprocessor took 45.19ms. Allocated memory is still 398.5MB. Free memory was 340.4MB in the beginning and 338.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 13:02:41,706 INFO L158 Benchmark]: RCFGBuilder took 499.69ms. Allocated memory is still 398.5MB. Free memory was 338.5MB in the beginning and 369.6MB in the end (delta: -31.1MB). Peak memory consumption was 20.3MB. Max. memory is 16.0GB. [2023-08-24 13:02:41,706 INFO L158 Benchmark]: TraceAbstraction took 789770.08ms. Allocated memory was 398.5MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 368.8MB in the beginning and 10.4GB in the end (delta: -10.0GB). Peak memory consumption was 5.6GB. Max. memory is 16.0GB. [2023-08-24 13:02:41,707 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.10ms. Allocated memory is still 398.5MB. Free memory is still 374.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 382.88ms. Allocated memory is still 398.5MB. Free memory was 372.9MB in the beginning and 343.3MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.39ms. Allocated memory is still 398.5MB. Free memory was 343.3MB in the beginning and 340.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.19ms. Allocated memory is still 398.5MB. Free memory was 340.4MB in the beginning and 338.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 499.69ms. Allocated memory is still 398.5MB. Free memory was 338.5MB in the beginning and 369.6MB in the end (delta: -31.1MB). Peak memory consumption was 20.3MB. Max. memory is 16.0GB. * TraceAbstraction took 789770.08ms. Allocated memory was 398.5MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 368.8MB in the beginning and 10.4GB in the end (delta: -10.0GB). Peak memory consumption was 5.6GB. 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.3s, 164 PlacesBefore, 45 PlacesAfterwards, 191 TransitionsBefore, 66 TransitionsAfterwards, 11076 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 101 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 18 ConcurrentYvCompositions, 6 ChoiceCompositions, 168 TotalNumberOfCompositions, 18087 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9506, independent: 9230, independent conditional: 0, independent unconditional: 9230, dependent: 276, dependent conditional: 0, dependent unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5585, independent: 5528, independent conditional: 0, independent unconditional: 5528, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9506, independent: 3702, independent conditional: 0, independent unconditional: 3702, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 5585, unknown conditional: 0, unknown unconditional: 5585] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, 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.0s, 164 PlacesBefore, 45 PlacesAfterwards, 191 TransitionsBefore, 66 TransitionsAfterwards, 11076 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 99 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 164 TotalNumberOfCompositions, 17406 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8214, independent: 7943, independent conditional: 0, independent unconditional: 7943, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5480, independent: 5426, independent conditional: 0, independent unconditional: 5426, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8214, independent: 2517, independent conditional: 0, independent unconditional: 2517, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 5480, unknown conditional: 0, unknown unconditional: 5480] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 88, Positive conditional cache size: 0, Positive unconditional cache size: 88, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 229 PlacesBefore, 68 PlacesAfterwards, 269 TransitionsBefore, 100 TransitionsAfterwards, 33796 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 142 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 31 ConcurrentYvCompositions, 8 ChoiceCompositions, 222 TotalNumberOfCompositions, 58206 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28625, independent: 28179, independent conditional: 0, independent unconditional: 28179, dependent: 446, dependent conditional: 0, dependent unconditional: 446, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 16851, independent: 16740, independent conditional: 0, independent unconditional: 16740, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 28625, independent: 11439, independent conditional: 0, independent unconditional: 11439, dependent: 335, dependent conditional: 0, dependent unconditional: 335, unknown: 16851, unknown conditional: 0, unknown unconditional: 16851] , Statistics on independence cache: Total cache size (in pairs): 785, Positive cache size: 741, Positive conditional cache size: 0, Positive unconditional cache size: 741, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 229 PlacesBefore, 68 PlacesAfterwards, 269 TransitionsBefore, 100 TransitionsAfterwards, 33796 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 143 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 222 TotalNumberOfCompositions, 57384 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26369, independent: 25930, independent conditional: 0, independent unconditional: 25930, dependent: 439, dependent conditional: 0, dependent unconditional: 439, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 16493, independent: 16395, independent conditional: 0, independent unconditional: 16395, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26369, independent: 9535, independent conditional: 0, independent unconditional: 9535, dependent: 341, dependent conditional: 0, dependent unconditional: 341, unknown: 16493, unknown conditional: 0, unknown unconditional: 16493] , Statistics on independence cache: Total cache size (in pairs): 369, Positive cache size: 326, Positive conditional cache size: 0, Positive unconditional cache size: 326, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 290 PlacesBefore, 88 PlacesAfterwards, 342 TransitionsBefore, 130 TransitionsAfterwards, 66456 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 195 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 37 ConcurrentYvCompositions, 10 ChoiceCompositions, 285 TotalNumberOfCompositions, 113035 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52380, independent: 51807, independent conditional: 0, independent unconditional: 51807, dependent: 573, dependent conditional: 0, dependent unconditional: 573, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32566, independent: 32431, independent conditional: 0, independent unconditional: 32431, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 52380, independent: 19376, independent conditional: 0, independent unconditional: 19376, dependent: 438, dependent conditional: 0, dependent unconditional: 438, unknown: 32566, unknown conditional: 0, unknown unconditional: 32566] , Statistics on independence cache: Total cache size (in pairs): 768, Positive cache size: 709, Positive conditional cache size: 0, Positive unconditional cache size: 709, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown