/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_74-tricky_address1_racefree_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 03:51:40,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 03:51:40,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 03:51:40,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 03:51:40,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 03:51:40,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 03:51:40,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 03:51:40,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 03:51:40,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 03:51:40,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 03:51:40,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 03:51:40,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 03:51:40,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 03:51:40,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 03:51:40,798 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 03:51:40,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 03:51:40,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 03:51:40,799 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 03:51:40,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 03:51:40,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 03:51:40,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 03:51:40,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 03:51:40,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 03:51:40,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 03:51:40,800 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 03:51:40,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 03:51:40,801 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 03:51:40,801 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 03:51:40,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 03:51:40,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 03:51:40,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:51:40,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 03:51:40,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 03:51:40,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 03:51:40,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 03:51:40,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 03:51:40,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 03:51:40,803 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 03:51:40,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 03:51:40,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 03:51:40,803 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 03:51:40,803 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-04 03:51:41,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 03:51:41,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 03:51:41,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 03:51:41,022 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 03:51:41,022 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 03:51:41,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_74-tricky_address1_racefree_bound2.i [2023-08-04 03:51:42,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 03:51:42,508 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 03:51:42,509 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_74-tricky_address1_racefree_bound2.i [2023-08-04 03:51:42,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a0e45aab/c41b4c748616491581d9024ec66a2b0f/FLAG91a7ae385 [2023-08-04 03:51:42,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a0e45aab/c41b4c748616491581d9024ec66a2b0f [2023-08-04 03:51:42,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 03:51:42,548 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 03:51:42,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 03:51:42,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 03:51:42,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 03:51:42,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:51:42" (1/1) ... [2023-08-04 03:51:42,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ee836e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:42, skipping insertion in model container [2023-08-04 03:51:42,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:51:42" (1/1) ... [2023-08-04 03:51:42,582 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 03:51:42,947 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_74-tricky_address1_racefree_bound2.i[41323,41336] [2023-08-04 03:51:42,977 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:51:42,992 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 03:51:43,010 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 03:51:43,012 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 03:51:43,023 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-04 03:51:43,030 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_74-tricky_address1_racefree_bound2.i[41323,41336] [2023-08-04 03:51:43,040 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:51:43,079 INFO L206 MainTranslator]: Completed translation [2023-08-04 03:51:43,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:43 WrapperNode [2023-08-04 03:51:43,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 03:51:43,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 03:51:43,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 03:51:43,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 03:51:43,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:43" (1/1) ... [2023-08-04 03:51:43,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:43" (1/1) ... [2023-08-04 03:51:43,115 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 190 [2023-08-04 03:51:43,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 03:51:43,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 03:51:43,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 03:51:43,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 03:51:43,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:43" (1/1) ... [2023-08-04 03:51:43,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:43" (1/1) ... [2023-08-04 03:51:43,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:43" (1/1) ... [2023-08-04 03:51:43,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:43" (1/1) ... [2023-08-04 03:51:43,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:43" (1/1) ... [2023-08-04 03:51:43,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:43" (1/1) ... [2023-08-04 03:51:43,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:43" (1/1) ... [2023-08-04 03:51:43,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:43" (1/1) ... [2023-08-04 03:51:43,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 03:51:43,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 03:51:43,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 03:51:43,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 03:51:43,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:43" (1/1) ... [2023-08-04 03:51:43,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:51:43,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:43,168 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-04 03:51:43,185 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-04 03:51:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 03:51:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 03:51:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 03:51:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 03:51:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-04 03:51:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 03:51:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-04 03:51:43,198 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-04 03:51:43,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 03:51:43,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 03:51:43,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 03:51:43,199 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 03:51:43,359 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 03:51:43,363 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 03:51:43,643 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 03:51:43,649 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 03:51:43,650 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-04 03:51:43,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:51:43 BoogieIcfgContainer [2023-08-04 03:51:43,652 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 03:51:43,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 03:51:43,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 03:51:43,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 03:51:43,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 03:51:42" (1/3) ... [2023-08-04 03:51:43,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35445d43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:51:43, skipping insertion in model container [2023-08-04 03:51:43,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:43" (2/3) ... [2023-08-04 03:51:43,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35445d43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:51:43, skipping insertion in model container [2023-08-04 03:51:43,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:51:43" (3/3) ... [2023-08-04 03:51:43,659 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_74-tricky_address1_racefree_bound2.i [2023-08-04 03:51:43,665 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 03:51:43,673 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 03:51:43,673 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 03:51:43,674 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 03:51:43,737 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-04 03:51:43,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 190 transitions, 388 flow [2023-08-04 03:51:43,838 INFO L124 PetriNetUnfolderBase]: 45/260 cut-off events. [2023-08-04 03:51:43,838 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-04 03:51:43,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 260 events. 45/260 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 817 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-04 03:51:43,844 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 190 transitions, 388 flow [2023-08-04 03:51:43,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 185 transitions, 375 flow [2023-08-04 03:51:43,853 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:51:43,860 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-04 03:51:43,862 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-04 03:51:43,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 185 transitions, 375 flow [2023-08-04 03:51:43,954 INFO L124 PetriNetUnfolderBase]: 44/255 cut-off events. [2023-08-04 03:51:43,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:43,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 255 events. 44/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-04 03:51:43,968 INFO L119 LiptonReduction]: Number of co-enabled transitions 10336 [2023-08-04 03:51:46,250 INFO L134 LiptonReduction]: Checked pairs total: 15158 [2023-08-04 03:51:46,250 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-08-04 03:51:46,259 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:51:46,264 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=true, 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;@307a744a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:51:46,264 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 03:51:46,268 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:51:46,268 INFO L124 PetriNetUnfolderBase]: 5/25 cut-off events. [2023-08-04 03:51:46,269 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:46,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:46,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 03:51:46,269 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:51:46,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:46,272 INFO L85 PathProgramCache]: Analyzing trace with hash 826457834, now seen corresponding path program 1 times [2023-08-04 03:51:46,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:46,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630502407] [2023-08-04 03:51:46,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:46,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:46,434 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-04 03:51:46,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:46,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630502407] [2023-08-04 03:51:46,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630502407] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:51:46,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:51:46,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:51:46,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139018381] [2023-08-04 03:51:46,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:51:46,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:51:46,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:46,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:51:46,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:51:46,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2023-08-04 03:51:46,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 65 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:46,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:46,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2023-08-04 03:51:46,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:46,594 INFO L124 PetriNetUnfolderBase]: 301/651 cut-off events. [2023-08-04 03:51:46,595 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:46,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 651 events. 301/651 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3189 event pairs, 266 based on Foata normal form. 107/643 useless extension candidates. Maximal degree in co-relation 1189. Up to 588 conditions per place. [2023-08-04 03:51:46,599 INFO L140 encePairwiseOnDemand]: 318/341 looper letters, 36 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-04 03:51:46,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-08-04 03:51:46,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:51:46,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:51:46,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2023-08-04 03:51:46,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512218963831867 [2023-08-04 03:51:46,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2023-08-04 03:51:46,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2023-08-04 03:51:46,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:46,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2023-08-04 03:51:46,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:46,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:46,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:46,626 INFO L175 Difference]: Start difference. First operand has 45 places, 65 transitions, 135 flow. Second operand 3 states and 524 transitions. [2023-08-04 03:51:46,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-08-04 03:51:46,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:51:46,630 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 107 flow [2023-08-04 03:51:46,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2023-08-04 03:51:46,634 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-08-04 03:51:46,634 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 107 flow [2023-08-04 03:51:46,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:46,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:46,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:46,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 03:51:46,635 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:51:46,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash -669135341, now seen corresponding path program 1 times [2023-08-04 03:51:46,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:46,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699208159] [2023-08-04 03:51:46,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:46,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:46,754 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-04 03:51:46,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:46,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699208159] [2023-08-04 03:51:46,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699208159] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:46,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010840161] [2023-08-04 03:51:46,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:46,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:46,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:46,766 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-04 03:51:46,767 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-04 03:51:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:46,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:51:46,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:46,859 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-04 03:51:46,859 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:51:46,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010840161] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:51:46,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:51:46,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 03:51:46,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606235548] [2023-08-04 03:51:46,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:51:46,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:51:46,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:46,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:51:46,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:51:46,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2023-08-04 03:51:46,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:46,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:46,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2023-08-04 03:51:46,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:46,987 INFO L124 PetriNetUnfolderBase]: 283/635 cut-off events. [2023-08-04 03:51:46,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:46,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 635 events. 283/635 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3546 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1221. Up to 555 conditions per place. [2023-08-04 03:51:46,990 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 51 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-04 03:51:46,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 243 flow [2023-08-04 03:51:46,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:51:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:51:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2023-08-04 03:51:46,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063538611925709 [2023-08-04 03:51:46,992 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2023-08-04 03:51:46,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2023-08-04 03:51:46,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:46,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2023-08-04 03:51:46,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:46,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:46,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:46,996 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 107 flow. Second operand 3 states and 518 transitions. [2023-08-04 03:51:46,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 243 flow [2023-08-04 03:51:46,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 239 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:51:46,998 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 111 flow [2023-08-04 03:51:46,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-08-04 03:51:46,998 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2023-08-04 03:51:46,999 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 111 flow [2023-08-04 03:51:46,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:46,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:46,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:47,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 03:51:47,204 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-04 03:51:47,206 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:51:47,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:47,207 INFO L85 PathProgramCache]: Analyzing trace with hash 735439460, now seen corresponding path program 1 times [2023-08-04 03:51:47,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:47,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717692437] [2023-08-04 03:51:47,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:47,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:47,267 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-04 03:51:47,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:47,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717692437] [2023-08-04 03:51:47,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717692437] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:47,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981388132] [2023-08-04 03:51:47,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:47,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:47,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:47,704 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-04 03:51:47,707 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-04 03:51:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:47,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:51:47,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:47,796 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-04 03:51:47,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:51:47,807 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-04 03:51:47,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981388132] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:51:47,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:51:47,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 03:51:47,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559571902] [2023-08-04 03:51:47,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:51:47,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 03:51:47,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:47,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 03:51:47,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 03:51:47,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 341 [2023-08-04 03:51:47,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 155.85714285714286) internal successors, (1091), 7 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:47,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:47,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 341 [2023-08-04 03:51:47,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:47,924 INFO L124 PetriNetUnfolderBase]: 301/637 cut-off events. [2023-08-04 03:51:47,925 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-04 03:51:47,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 637 events. 301/637 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3076 event pairs, 266 based on Foata normal form. 3/547 useless extension candidates. Maximal degree in co-relation 1245. Up to 571 conditions per place. [2023-08-04 03:51:47,926 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 36 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2023-08-04 03:51:47,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 205 flow [2023-08-04 03:51:47,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:51:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:51:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions. [2023-08-04 03:51:47,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2023-08-04 03:51:47,929 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 968 transitions. [2023-08-04 03:51:47,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 968 transitions. [2023-08-04 03:51:47,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:47,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 968 transitions. [2023-08-04 03:51:47,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.33333333333334) internal successors, (968), 6 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:47,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:47,949 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:47,949 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 111 flow. Second operand 6 states and 968 transitions. [2023-08-04 03:51:47,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 205 flow [2023-08-04 03:51:47,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 03:51:47,950 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 143 flow [2023-08-04 03:51:47,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2023-08-04 03:51:47,951 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2023-08-04 03:51:47,951 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 143 flow [2023-08-04 03:51:47,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.85714285714286) internal successors, (1091), 7 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:47,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:47,952 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:47,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 03:51:48,156 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-04 03:51:48,156 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:51:48,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash 967406523, now seen corresponding path program 2 times [2023-08-04 03:51:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:48,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695414784] [2023-08-04 03:51:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:48,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:48,280 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-04 03:51:48,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:48,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695414784] [2023-08-04 03:51:48,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695414784] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:48,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247616803] [2023-08-04 03:51:48,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:51:48,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:48,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:48,293 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-04 03:51:48,295 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-04 03:51:48,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-04 03:51:48,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:51:48,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-04 03:51:48,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:48,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 7 treesize of output 6 [2023-08-04 03:51:48,413 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:51:48,413 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-04 03:51:48,432 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:51:48,473 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-04 03:51:48,473 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:51:48,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247616803] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:51:48,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:51:48,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-04 03:51:48,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473150601] [2023-08-04 03:51:48,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:51:48,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 03:51:48,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:48,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 03:51:48,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-04 03:51:48,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 341 [2023-08-04 03:51:48,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:48,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:48,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 341 [2023-08-04 03:51:48,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:48,788 INFO L124 PetriNetUnfolderBase]: 298/678 cut-off events. [2023-08-04 03:51:48,788 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-04 03:51:48,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 678 events. 298/678 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3515 event pairs, 49 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 1314. Up to 416 conditions per place. [2023-08-04 03:51:48,790 INFO L140 encePairwiseOnDemand]: 333/341 looper letters, 44 selfloop transitions, 6 changer transitions 34/91 dead transitions. [2023-08-04 03:51:48,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 399 flow [2023-08-04 03:51:48,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:51:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:51:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 965 transitions. [2023-08-04 03:51:48,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47165200391006845 [2023-08-04 03:51:48,793 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 965 transitions. [2023-08-04 03:51:48,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 965 transitions. [2023-08-04 03:51:48,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:48,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 965 transitions. [2023-08-04 03:51:48,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 160.83333333333334) internal successors, (965), 6 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:48,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:48,800 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:48,800 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 143 flow. Second operand 6 states and 965 transitions. [2023-08-04 03:51:48,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 91 transitions, 399 flow [2023-08-04 03:51:48,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 91 transitions, 385 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 03:51:48,802 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 157 flow [2023-08-04 03:51:48,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=157, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2023-08-04 03:51:48,803 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2023-08-04 03:51:48,803 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 157 flow [2023-08-04 03:51:48,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:48,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:48,804 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:48,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 03:51:49,009 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-04 03:51:49,010 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:51:49,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:49,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1432371976, now seen corresponding path program 1 times [2023-08-04 03:51:49,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:49,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335417503] [2023-08-04 03:51:49,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:49,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:49,104 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-04 03:51:49,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335417503] [2023-08-04 03:51:49,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335417503] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723342630] [2023-08-04 03:51:49,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:49,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:49,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:49,106 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-04 03:51:49,108 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-04 03:51:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:49,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:51:49,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:49,210 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-04 03:51:49,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:51:49,270 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-04 03:51:49,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723342630] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:51:49,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:51:49,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-04 03:51:49,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317273784] [2023-08-04 03:51:49,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:51:49,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-04 03:51:49,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:49,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-04 03:51:49,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-04 03:51:49,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 341 [2023-08-04 03:51:49,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 157 flow. Second operand has 14 states, 14 states have (on average 152.07142857142858) internal successors, (2129), 14 states have internal predecessors, (2129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:49,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:49,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 341 [2023-08-04 03:51:49,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:49,367 INFO L124 PetriNetUnfolderBase]: 23/80 cut-off events. [2023-08-04 03:51:49,368 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-08-04 03:51:49,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 80 events. 23/80 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 124 event pairs, 8 based on Foata normal form. 18/95 useless extension candidates. Maximal degree in co-relation 204. Up to 46 conditions per place. [2023-08-04 03:51:49,368 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2023-08-04 03:51:49,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 236 flow [2023-08-04 03:51:49,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-04 03:51:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-04 03:51:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2146 transitions. [2023-08-04 03:51:49,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4495182237117721 [2023-08-04 03:51:49,372 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2146 transitions. [2023-08-04 03:51:49,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2146 transitions. [2023-08-04 03:51:49,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:49,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2146 transitions. [2023-08-04 03:51:49,376 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-04 03:51:49,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 341.0) internal successors, (5115), 15 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:49,382 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 341.0) internal successors, (5115), 15 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:49,382 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 157 flow. Second operand 14 states and 2146 transitions. [2023-08-04 03:51:49,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 236 flow [2023-08-04 03:51:49,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 213 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-04 03:51:49,385 INFO L231 Difference]: Finished difference. Result has 46 places, 0 transitions, 0 flow [2023-08-04 03:51:49,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=46, PETRI_TRANSITIONS=0} [2023-08-04 03:51:49,386 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-08-04 03:51:49,386 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 0 transitions, 0 flow [2023-08-04 03:51:49,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 152.07142857142858) internal successors, (2129), 14 states have internal predecessors, (2129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:49,388 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 03:51:49,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 03:51:49,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 03:51:49,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-04 03:51:49,593 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-04 03:51:49,593 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-08-04 03:51:49,595 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 03:51:49,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 190 transitions, 388 flow [2023-08-04 03:51:49,610 INFO L124 PetriNetUnfolderBase]: 45/260 cut-off events. [2023-08-04 03:51:49,610 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-04 03:51:49,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 260 events. 45/260 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 817 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-04 03:51:49,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 190 transitions, 388 flow [2023-08-04 03:51:49,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 185 transitions, 375 flow [2023-08-04 03:51:49,612 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:51:49,612 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-04 03:51:49,612 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-04 03:51:49,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 185 transitions, 375 flow [2023-08-04 03:51:49,624 INFO L124 PetriNetUnfolderBase]: 44/255 cut-off events. [2023-08-04 03:51:49,624 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:49,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 255 events. 44/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-04 03:51:49,628 INFO L119 LiptonReduction]: Number of co-enabled transitions 10336 [2023-08-04 03:51:51,326 INFO L134 LiptonReduction]: Checked pairs total: 16649 [2023-08-04 03:51:51,326 INFO L136 LiptonReduction]: Total number of compositions: 150 [2023-08-04 03:51:51,327 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 03:51:51,328 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=true, 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;@307a744a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:51:51,328 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 03:51:51,333 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:51:51,333 INFO L124 PetriNetUnfolderBase]: 11/41 cut-off events. [2023-08-04 03:51:51,333 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:51,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:51,333 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-04 03:51:51,333 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:51:51,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:51,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1785070566, now seen corresponding path program 1 times [2023-08-04 03:51:51,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:51,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407511014] [2023-08-04 03:51:51,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:51,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:51,372 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-04 03:51:51,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:51,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407511014] [2023-08-04 03:51:51,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407511014] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:51:51,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:51:51,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:51:51,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246563016] [2023-08-04 03:51:51,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:51:51,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:51:51,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:51,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:51:51,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:51:51,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 340 [2023-08-04 03:51:51,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:51,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:51,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 340 [2023-08-04 03:51:51,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:51,441 INFO L124 PetriNetUnfolderBase]: 300/656 cut-off events. [2023-08-04 03:51:51,441 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:51,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 656 events. 300/656 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3223 event pairs, 266 based on Foata normal form. 108/654 useless extension candidates. Maximal degree in co-relation 1194. Up to 588 conditions per place. [2023-08-04 03:51:51,442 INFO L140 encePairwiseOnDemand]: 316/340 looper letters, 20 selfloop transitions, 2 changer transitions 19/46 dead transitions. [2023-08-04 03:51:51,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-08-04 03:51:51,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:51:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:51:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2023-08-04 03:51:51,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2023-08-04 03:51:51,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2023-08-04 03:51:51,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2023-08-04 03:51:51,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:51,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2023-08-04 03:51:51,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:51,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:51,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:51,446 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 525 transitions. [2023-08-04 03:51:51,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-08-04 03:51:51,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:51:51,447 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 69 flow [2023-08-04 03:51:51,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-08-04 03:51:51,448 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-08-04 03:51:51,448 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 69 flow [2023-08-04 03:51:51,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:51,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:51,449 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:51,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 03:51:51,449 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:51:51,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:51,449 INFO L85 PathProgramCache]: Analyzing trace with hash -523375806, now seen corresponding path program 1 times [2023-08-04 03:51:51,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:51,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605245948] [2023-08-04 03:51:51,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:51,479 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-04 03:51:51,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:51,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605245948] [2023-08-04 03:51:51,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605245948] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:51,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547233960] [2023-08-04 03:51:51,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:51,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:51,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:51,480 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-04 03:51:51,482 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-04 03:51:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:51,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:51:51,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:51,540 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-04 03:51:51,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:51:51,549 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-04 03:51:51,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547233960] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:51:51,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:51:51,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 03:51:51,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423906848] [2023-08-04 03:51:51,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:51:51,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 03:51:51,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:51,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 03:51:51,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 03:51:51,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 340 [2023-08-04 03:51:51,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 69 flow. Second operand has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:51,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:51,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 340 [2023-08-04 03:51:51,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:51,589 INFO L124 PetriNetUnfolderBase]: 47/128 cut-off events. [2023-08-04 03:51:51,589 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:51,589 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 358 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-04 03:51:51,590 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 20 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-04 03:51:51,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 131 flow [2023-08-04 03:51:51,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:51:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:51:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 952 transitions. [2023-08-04 03:51:51,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-08-04 03:51:51,592 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 952 transitions. [2023-08-04 03:51:51,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 952 transitions. [2023-08-04 03:51:51,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:51,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 952 transitions. [2023-08-04 03:51:51,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.66666666666666) internal successors, (952), 6 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:51,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 340.0) internal successors, (2380), 7 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:51,596 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 340.0) internal successors, (2380), 7 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:51,596 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 69 flow. Second operand 6 states and 952 transitions. [2023-08-04 03:51:51,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 131 flow [2023-08-04 03:51:51,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 127 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:51:51,596 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2023-08-04 03:51:51,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, 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-04 03:51:51,597 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-08-04 03:51:51,597 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2023-08-04 03:51:51,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:51,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:51,598 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-04 03:51:51,602 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-04 03:51:51,802 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-04 03:51:51,803 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:51:51,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1162836454, now seen corresponding path program 2 times [2023-08-04 03:51:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:51,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023669275] [2023-08-04 03:51:51,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:51,850 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-04 03:51:51,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:51,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023669275] [2023-08-04 03:51:51,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023669275] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:51,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611775398] [2023-08-04 03:51:51,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:51:51,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:51,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:51,852 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-04 03:51:51,898 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-04 03:51:51,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:51:51,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:51:51,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:51:51,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:51,961 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-04 03:51:51,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:51:51,999 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-04 03:51:52,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611775398] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:51:52,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:51:52,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-04 03:51:52,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303687542] [2023-08-04 03:51:52,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:51:52,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-04 03:51:52,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:52,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-04 03:51:52,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-04 03:51:52,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 340 [2023-08-04 03:51:52,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 101 flow. Second operand has 13 states, 13 states have (on average 155.30769230769232) internal successors, (2019), 13 states have internal predecessors, (2019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:52,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:52,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 340 [2023-08-04 03:51:52,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:52,097 INFO L124 PetriNetUnfolderBase]: 47/134 cut-off events. [2023-08-04 03:51:52,097 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-04 03:51:52,097 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 358 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-04 03:51:52,098 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 20 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2023-08-04 03:51:52,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 199 flow [2023-08-04 03:51:52,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 03:51:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 03:51:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1885 transitions. [2023-08-04 03:51:52,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46200980392156865 [2023-08-04 03:51:52,111 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1885 transitions. [2023-08-04 03:51:52,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1885 transitions. [2023-08-04 03:51:52,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:52,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1885 transitions. [2023-08-04 03:51:52,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 157.08333333333334) internal successors, (1885), 12 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:52,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 340.0) internal successors, (4420), 13 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:52,131 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 340.0) internal successors, (4420), 13 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:52,131 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 12 states and 1885 transitions. [2023-08-04 03:51:52,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 199 flow [2023-08-04 03:51:52,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 185 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 03:51:52,136 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 171 flow [2023-08-04 03:51:52,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, 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-04 03:51:52,138 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-08-04 03:51:52,138 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 171 flow [2023-08-04 03:51:52,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 155.30769230769232) internal successors, (2019), 13 states have internal predecessors, (2019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:52,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:52,139 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-04 03:51:52,148 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-04 03:51:52,348 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-04 03:51:52,349 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:51:52,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:52,349 INFO L85 PathProgramCache]: Analyzing trace with hash -834996966, now seen corresponding path program 3 times [2023-08-04 03:51:52,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:52,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803860436] [2023-08-04 03:51:52,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:52,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:51:52,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 03:51:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:51:52,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 03:51:52,387 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 03:51:52,387 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-04 03:51:52,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 03:51:52,387 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-04 03:51:52,387 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-04 03:51:52,388 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 03:51:52,388 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 03:51:52,404 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-04 03:51:52,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-04 03:51:52,431 INFO L124 PetriNetUnfolderBase]: 75/424 cut-off events. [2023-08-04 03:51:52,431 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-04 03:51:52,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-08-04 03:51:52,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 260 transitions, 538 flow [2023-08-04 03:51:52,436 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 260 transitions, 538 flow [2023-08-04 03:51:52,436 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:51:52,436 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-04 03:51:52,436 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-04 03:51:52,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-04 03:51:52,462 INFO L124 PetriNetUnfolderBase]: 75/424 cut-off events. [2023-08-04 03:51:52,462 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-04 03:51:52,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-08-04 03:51:52,476 INFO L119 LiptonReduction]: Number of co-enabled transitions 31416 [2023-08-04 03:51:54,966 INFO L134 LiptonReduction]: Checked pairs total: 49651 [2023-08-04 03:51:54,966 INFO L136 LiptonReduction]: Total number of compositions: 216 [2023-08-04 03:51:54,968 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:51:54,975 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=true, 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;@307a744a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:51:54,975 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 03:51:54,994 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:51:54,994 INFO L124 PetriNetUnfolderBase]: 8/28 cut-off events. [2023-08-04 03:51:54,994 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:54,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:54,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 03:51:54,995 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-04 03:51:54,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:54,996 INFO L85 PathProgramCache]: Analyzing trace with hash -200231614, now seen corresponding path program 1 times [2023-08-04 03:51:54,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:54,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797462858] [2023-08-04 03:51:54,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:54,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:55,015 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-04 03:51:55,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:55,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797462858] [2023-08-04 03:51:55,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797462858] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:51:55,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:51:55,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:51:55,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4367280] [2023-08-04 03:51:55,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:51:55,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:51:55,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:55,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:51:55,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:51:55,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 476 [2023-08-04 03:51:55,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 101 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:55,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:55,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 476 [2023-08-04 03:51:55,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:55,895 INFO L124 PetriNetUnfolderBase]: 9872/15757 cut-off events. [2023-08-04 03:51:55,896 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-08-04 03:51:55,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30205 conditions, 15757 events. 9872/15757 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 104375 event pairs, 9112 based on Foata normal form. 2730/16056 useless extension candidates. Maximal degree in co-relation 12164. Up to 14349 conditions per place. [2023-08-04 03:51:56,087 INFO L140 encePairwiseOnDemand]: 441/476 looper letters, 55 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-04 03:51:56,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 272 flow [2023-08-04 03:51:56,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:51:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:51:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2023-08-04 03:51:56,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042016806722689 [2023-08-04 03:51:56,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 720 transitions. [2023-08-04 03:51:56,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 720 transitions. [2023-08-04 03:51:56,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:56,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 720 transitions. [2023-08-04 03:51:56,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:56,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:56,095 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:56,096 INFO L175 Difference]: Start difference. First operand has 68 places, 101 transitions, 220 flow. Second operand 3 states and 720 transitions. [2023-08-04 03:51:56,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 272 flow [2023-08-04 03:51:56,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:51:56,098 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-08-04 03:51:56,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, 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-04 03:51:56,100 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-04 03:51:56,100 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-08-04 03:51:56,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:56,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:56,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:56,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 03:51:56,101 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-04 03:51:56,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:56,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1798379354, now seen corresponding path program 1 times [2023-08-04 03:51:56,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:56,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941875200] [2023-08-04 03:51:56,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:56,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:56,129 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-04 03:51:56,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:56,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941875200] [2023-08-04 03:51:56,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941875200] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:56,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535698503] [2023-08-04 03:51:56,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:56,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:56,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:56,132 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-04 03:51:56,139 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-04 03:51:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:56,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:51:56,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:56,214 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-04 03:51:56,214 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:51:56,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535698503] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:51:56,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:51:56,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 03:51:56,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152436701] [2023-08-04 03:51:56,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:51:56,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:51:56,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:56,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:51:56,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:51:56,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 476 [2023-08-04 03:51:56,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:56,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:56,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 476 [2023-08-04 03:51:56,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:57,075 INFO L124 PetriNetUnfolderBase]: 9675/15570 cut-off events. [2023-08-04 03:51:57,075 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-04 03:51:57,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30030 conditions, 15570 events. 9675/15570 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 105458 event pairs, 4312 based on Foata normal form. 0/13126 useless extension candidates. Maximal degree in co-relation 30017. Up to 14317 conditions per place. [2023-08-04 03:51:57,142 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 72 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-04 03:51:57,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 350 flow [2023-08-04 03:51:57,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:51:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:51:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2023-08-04 03:51:57,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49299719887955185 [2023-08-04 03:51:57,145 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2023-08-04 03:51:57,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2023-08-04 03:51:57,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:57,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2023-08-04 03:51:57,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:57,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:57,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:57,148 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 704 transitions. [2023-08-04 03:51:57,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 350 flow [2023-08-04 03:51:57,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 87 transitions, 346 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:51:57,151 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-08-04 03:51:57,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, 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-04 03:51:57,152 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-04 03:51:57,152 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-08-04 03:51:57,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:57,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:57,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:57,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-04 03:51:57,359 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-04 03:51:57,360 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-04 03:51:57,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:57,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1146753669, now seen corresponding path program 1 times [2023-08-04 03:51:57,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:57,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985140734] [2023-08-04 03:51:57,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:57,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:57,392 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-04 03:51:57,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:57,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985140734] [2023-08-04 03:51:57,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985140734] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:57,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129920087] [2023-08-04 03:51:57,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:57,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:57,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:57,423 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-04 03:51:57,424 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-04 03:51:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:57,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:51:57,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:57,497 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-04 03:51:57,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:51:57,509 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-04 03:51:57,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129920087] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:51:57,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:51:57,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 03:51:57,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871983417] [2023-08-04 03:51:57,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:51:57,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 03:51:57,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:57,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 03:51:57,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 03:51:57,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 476 [2023-08-04 03:51:57,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:57,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:57,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 476 [2023-08-04 03:51:57,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:58,493 INFO L124 PetriNetUnfolderBase]: 9912/15619 cut-off events. [2023-08-04 03:51:58,493 INFO L125 PetriNetUnfolderBase]: For 612/612 co-relation queries the response was YES. [2023-08-04 03:51:58,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30593 conditions, 15619 events. 9912/15619 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 101714 event pairs, 9112 based on Foata normal form. 3/13422 useless extension candidates. Maximal degree in co-relation 30565. Up to 14334 conditions per place. [2023-08-04 03:51:58,530 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 56 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-04 03:51:58,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 310 flow [2023-08-04 03:51:58,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:51:58,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:51:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1317 transitions. [2023-08-04 03:51:58,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46113445378151263 [2023-08-04 03:51:58,534 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1317 transitions. [2023-08-04 03:51:58,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1317 transitions. [2023-08-04 03:51:58,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:58,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1317 transitions. [2023-08-04 03:51:58,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 219.5) internal successors, (1317), 6 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:58,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:58,549 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:58,549 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1317 transitions. [2023-08-04 03:51:58,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 310 flow [2023-08-04 03:51:58,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:51:58,552 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-08-04 03:51:58,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, 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-04 03:51:58,552 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-08-04 03:51:58,553 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-08-04 03:51:58,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:58,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:58,554 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:58,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-04 03:51:58,758 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-04 03:51:58,759 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-04 03:51:58,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:58,759 INFO L85 PathProgramCache]: Analyzing trace with hash -737928083, now seen corresponding path program 2 times [2023-08-04 03:51:58,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:58,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012132017] [2023-08-04 03:51:58,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:58,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:58,820 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-04 03:51:58,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:58,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012132017] [2023-08-04 03:51:58,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012132017] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:58,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004876963] [2023-08-04 03:51:58,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:51:58,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:58,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:58,822 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-04 03:51:58,849 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-04 03:51:58,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-04 03:51:58,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:51:58,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-04 03:51:58,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:58,928 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-04 03:51:58,964 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:51:58,964 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-04 03:51:58,985 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:51:59,018 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-04 03:51:59,019 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:51:59,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004876963] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:51:59,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:51:59,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-04 03:51:59,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503079316] [2023-08-04 03:51:59,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:51:59,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 03:51:59,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:59,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 03:51:59,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-04 03:51:59,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 476 [2023-08-04 03:51:59,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 201.5) internal successors, (1209), 6 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:59,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:59,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 476 [2023-08-04 03:51:59,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:00,324 INFO L124 PetriNetUnfolderBase]: 10227/16630 cut-off events. [2023-08-04 03:52:00,324 INFO L125 PetriNetUnfolderBase]: For 598/598 co-relation queries the response was YES. [2023-08-04 03:52:00,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32704 conditions, 16630 events. 10227/16630 cut-off events. For 598/598 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 116535 event pairs, 2011 based on Foata normal form. 0/14547 useless extension candidates. Maximal degree in co-relation 32668. Up to 11903 conditions per place. [2023-08-04 03:52:00,379 INFO L140 encePairwiseOnDemand]: 467/476 looper letters, 131 selfloop transitions, 14 changer transitions 9/167 dead transitions. [2023-08-04 03:52:00,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 167 transitions, 735 flow [2023-08-04 03:52:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:52:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:52:00,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1351 transitions. [2023-08-04 03:52:00,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730392156862745 [2023-08-04 03:52:00,384 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1351 transitions. [2023-08-04 03:52:00,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1351 transitions. [2023-08-04 03:52:00,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:00,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1351 transitions. [2023-08-04 03:52:00,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:00,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:00,392 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:00,392 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1351 transitions. [2023-08-04 03:52:00,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 167 transitions, 735 flow [2023-08-04 03:52:00,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 167 transitions, 721 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 03:52:00,395 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 280 flow [2023-08-04 03:52:00,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, 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-04 03:52:00,396 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-08-04 03:52:00,396 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 280 flow [2023-08-04 03:52:00,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 201.5) internal successors, (1209), 6 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:00,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:00,396 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:00,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 03:52:00,602 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-04 03:52:00,602 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-04 03:52:00,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:00,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1645103301, now seen corresponding path program 1 times [2023-08-04 03:52:00,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:00,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441349239] [2023-08-04 03:52:00,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:00,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:00,660 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-04 03:52:00,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:00,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441349239] [2023-08-04 03:52:00,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441349239] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:00,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176314811] [2023-08-04 03:52:00,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:00,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:00,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:00,663 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-04 03:52:00,665 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-04 03:52:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:00,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:52:00,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:00,752 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-04 03:52:00,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:00,783 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-04 03:52:00,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176314811] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:00,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:00,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-04 03:52:00,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537326567] [2023-08-04 03:52:00,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:00,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-04 03:52:00,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:00,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-04 03:52:00,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-04 03:52:00,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 476 [2023-08-04 03:52:00,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 280 flow. Second operand has 13 states, 13 states have (on average 210.69230769230768) internal successors, (2739), 13 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:00,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:00,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 476 [2023-08-04 03:52:00,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:02,006 INFO L124 PetriNetUnfolderBase]: 10225/16589 cut-off events. [2023-08-04 03:52:02,007 INFO L125 PetriNetUnfolderBase]: For 3432/3437 co-relation queries the response was YES. [2023-08-04 03:52:02,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35719 conditions, 16589 events. 10225/16589 cut-off events. For 3432/3437 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 114470 event pairs, 9000 based on Foata normal form. 6/15204 useless extension candidates. Maximal degree in co-relation 35661. Up to 15411 conditions per place. [2023-08-04 03:52:02,073 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 68 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2023-08-04 03:52:02,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 474 flow [2023-08-04 03:52:02,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 03:52:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 03:52:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2580 transitions. [2023-08-04 03:52:02,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45168067226890757 [2023-08-04 03:52:02,097 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2580 transitions. [2023-08-04 03:52:02,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2580 transitions. [2023-08-04 03:52:02,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:02,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2580 transitions. [2023-08-04 03:52:02,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 215.0) internal successors, (2580), 12 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:02,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 476.0) internal successors, (6188), 13 states have internal predecessors, (6188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:02,122 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 476.0) internal successors, (6188), 13 states have internal predecessors, (6188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:02,122 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 280 flow. Second operand 12 states and 2580 transitions. [2023-08-04 03:52:02,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 474 flow [2023-08-04 03:52:02,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:52:02,129 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 364 flow [2023-08-04 03:52:02,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, 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-04 03:52:02,137 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 36 predicate places. [2023-08-04 03:52:02,137 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 364 flow [2023-08-04 03:52:02,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 210.69230769230768) internal successors, (2739), 13 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:02,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:02,138 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:02,145 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-04 03:52:02,344 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-04 03:52:02,345 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-04 03:52:02,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:02,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1249743301, now seen corresponding path program 2 times [2023-08-04 03:52:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:02,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151815149] [2023-08-04 03:52:02,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:02,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:02,802 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-04 03:52:02,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:02,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151815149] [2023-08-04 03:52:02,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151815149] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:02,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44693293] [2023-08-04 03:52:02,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:52:02,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:02,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:02,805 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-04 03:52:02,807 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-04 03:52:02,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:52:02,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:52:02,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-04 03:52:02,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:02,914 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-04 03:52:02,980 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:52:02,981 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-04 03:52:02,996 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:52:03,019 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:52:03,058 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-04 03:52:03,058 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:19,116 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_397 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_397) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-04 03:52:19,195 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-04 03:52:19,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44693293] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:19,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:19,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2023-08-04 03:52:19,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891995271] [2023-08-04 03:52:19,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:19,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-04 03:52:19,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:19,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-04 03:52:19,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=4, NotChecked=24, Total=210 [2023-08-04 03:52:19,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 476 [2023-08-04 03:52:19,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 364 flow. Second operand has 15 states, 15 states have (on average 155.4) internal successors, (2331), 15 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:19,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:19,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 476 [2023-08-04 03:52:19,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:35,239 WARN L233 SmtUtils]: Spent 16.03s on a formula simplification. DAG size of input: 29 DAG size of output: 20 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:52:37,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:39,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:41,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:43,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:45,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:47,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:49,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:51,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:53,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:55,262 INFO L124 PetriNetUnfolderBase]: 13779/21926 cut-off events. [2023-08-04 03:52:55,262 INFO L125 PetriNetUnfolderBase]: For 4318/4318 co-relation queries the response was YES. [2023-08-04 03:52:55,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47523 conditions, 21926 events. 13779/21926 cut-off events. For 4318/4318 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 151704 event pairs, 2524 based on Foata normal form. 0/20511 useless extension candidates. Maximal degree in co-relation 47440. Up to 14693 conditions per place. [2023-08-04 03:52:55,328 INFO L140 encePairwiseOnDemand]: 461/476 looper letters, 166 selfloop transitions, 26 changer transitions 26/227 dead transitions. [2023-08-04 03:52:55,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 227 transitions, 1159 flow [2023-08-04 03:52:55,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 03:52:55,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 03:52:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1426 transitions. [2023-08-04 03:52:55,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3744747899159664 [2023-08-04 03:52:55,332 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1426 transitions. [2023-08-04 03:52:55,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1426 transitions. [2023-08-04 03:52:55,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:55,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1426 transitions. [2023-08-04 03:52:55,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 178.25) internal successors, (1426), 8 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:55,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 476.0) internal successors, (4284), 9 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:55,337 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 476.0) internal successors, (4284), 9 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:55,337 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 364 flow. Second operand 8 states and 1426 transitions. [2023-08-04 03:52:55,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 227 transitions, 1159 flow [2023-08-04 03:52:55,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 227 transitions, 1111 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-04 03:52:55,346 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 487 flow [2023-08-04 03:52:55,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=487, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2023-08-04 03:52:55,347 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 43 predicate places. [2023-08-04 03:52:55,347 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 487 flow [2023-08-04 03:52:55,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 155.4) internal successors, (2331), 15 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:55,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:55,347 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:55,352 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-04 03:52:55,552 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-04 03:52:55,552 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-04 03:52:55,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:55,553 INFO L85 PathProgramCache]: Analyzing trace with hash -753113228, now seen corresponding path program 1 times [2023-08-04 03:52:55,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:55,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780031153] [2023-08-04 03:52:55,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:55,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:55,611 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-04 03:52:55,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:55,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780031153] [2023-08-04 03:52:55,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780031153] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:55,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101908141] [2023-08-04 03:52:55,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:55,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:55,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:55,637 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-04 03:52:55,676 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-04 03:52:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:55,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:52:55,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:55,758 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-04 03:52:55,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:55,776 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-04 03:52:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101908141] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:55,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:55,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 03:52:55,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220276389] [2023-08-04 03:52:55,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:55,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:52:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:55,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:52:55,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:52:55,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 476 [2023-08-04 03:52:55,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 487 flow. Second operand has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:55,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:55,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 476 [2023-08-04 03:52:55,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:57,344 INFO L124 PetriNetUnfolderBase]: 10785/17586 cut-off events. [2023-08-04 03:52:57,344 INFO L125 PetriNetUnfolderBase]: For 8194/8194 co-relation queries the response was YES. [2023-08-04 03:52:57,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41947 conditions, 17586 events. 10785/17586 cut-off events. For 8194/8194 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 126573 event pairs, 878 based on Foata normal form. 16/16631 useless extension candidates. Maximal degree in co-relation 41882. Up to 15252 conditions per place. [2023-08-04 03:52:57,433 INFO L140 encePairwiseOnDemand]: 472/476 looper letters, 141 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2023-08-04 03:52:57,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 158 transitions, 961 flow [2023-08-04 03:52:57,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:52:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:52:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 939 transitions. [2023-08-04 03:52:57,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49317226890756305 [2023-08-04 03:52:57,436 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 939 transitions. [2023-08-04 03:52:57,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 939 transitions. [2023-08-04 03:52:57,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:57,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 939 transitions. [2023-08-04 03:52:57,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 234.75) internal successors, (939), 4 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:57,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 476.0) internal successors, (2380), 5 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:57,441 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 476.0) internal successors, (2380), 5 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:57,441 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 487 flow. Second operand 4 states and 939 transitions. [2023-08-04 03:52:57,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 158 transitions, 961 flow [2023-08-04 03:52:57,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 158 transitions, 961 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:52:57,459 INFO L231 Difference]: Finished difference. Result has 116 places, 106 transitions, 502 flow [2023-08-04 03:52:57,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=502, PETRI_PLACES=116, PETRI_TRANSITIONS=106} [2023-08-04 03:52:57,459 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 48 predicate places. [2023-08-04 03:52:57,460 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 106 transitions, 502 flow [2023-08-04 03:52:57,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:57,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:57,460 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-04 03:52:57,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-04 03:52:57,666 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-04 03:52:57,666 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-04 03:52:57,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:57,666 INFO L85 PathProgramCache]: Analyzing trace with hash 636168720, now seen corresponding path program 1 times [2023-08-04 03:52:57,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:57,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275113428] [2023-08-04 03:52:57,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:57,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:57,841 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-04 03:52:57,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:57,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275113428] [2023-08-04 03:52:57,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275113428] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:52:57,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:52:57,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 03:52:57,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327062756] [2023-08-04 03:52:57,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:52:57,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:52:57,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:57,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:52:57,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:52:58,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 476 [2023-08-04 03:52:58,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 106 transitions, 502 flow. Second operand has 5 states, 5 states have (on average 194.4) internal successors, (972), 5 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:58,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:58,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 476 [2023-08-04 03:52:58,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:59,012 INFO L124 PetriNetUnfolderBase]: 6032/11219 cut-off events. [2023-08-04 03:52:59,012 INFO L125 PetriNetUnfolderBase]: For 9556/9556 co-relation queries the response was YES. [2023-08-04 03:52:59,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28724 conditions, 11219 events. 6032/11219 cut-off events. For 9556/9556 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 85775 event pairs, 2177 based on Foata normal form. 1512/11798 useless extension candidates. Maximal degree in co-relation 28657. Up to 5743 conditions per place. [2023-08-04 03:52:59,057 INFO L140 encePairwiseOnDemand]: 455/476 looper letters, 137 selfloop transitions, 21 changer transitions 3/171 dead transitions. [2023-08-04 03:52:59,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 171 transitions, 1124 flow [2023-08-04 03:52:59,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:52:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:52:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 878 transitions. [2023-08-04 03:52:59,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46113445378151263 [2023-08-04 03:52:59,059 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 878 transitions. [2023-08-04 03:52:59,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 878 transitions. [2023-08-04 03:52:59,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:59,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 878 transitions. [2023-08-04 03:52:59,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 219.5) internal successors, (878), 4 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:59,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 476.0) internal successors, (2380), 5 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:59,062 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 476.0) internal successors, (2380), 5 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:59,062 INFO L175 Difference]: Start difference. First operand has 116 places, 106 transitions, 502 flow. Second operand 4 states and 878 transitions. [2023-08-04 03:52:59,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 171 transitions, 1124 flow [2023-08-04 03:52:59,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 171 transitions, 1117 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-04 03:52:59,075 INFO L231 Difference]: Finished difference. Result has 119 places, 117 transitions, 604 flow [2023-08-04 03:52:59,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=604, PETRI_PLACES=119, PETRI_TRANSITIONS=117} [2023-08-04 03:52:59,076 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 51 predicate places. [2023-08-04 03:52:59,076 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 117 transitions, 604 flow [2023-08-04 03:52:59,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 194.4) internal successors, (972), 5 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:59,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:59,076 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-04 03:52:59,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-04 03:52:59,076 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-04 03:52:59,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:59,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1983072336, now seen corresponding path program 1 times [2023-08-04 03:52:59,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:59,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761859846] [2023-08-04 03:52:59,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:59,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:59,542 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-04 03:52:59,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:59,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761859846] [2023-08-04 03:52:59,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761859846] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:59,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961209610] [2023-08-04 03:52:59,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:59,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:59,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:59,544 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-04 03:52:59,580 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-04 03:52:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:59,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-04 03:52:59,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:59,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 7 treesize of output 6 [2023-08-04 03:52:59,768 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:52:59,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-04 03:52:59,786 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:52:59,812 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:52:59,830 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-04 03:52:59,879 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:52:59,880 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-04 03:52:59,910 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-04 03:52:59,946 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-04 03:52:59,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:53:00,018 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-04 03:53:00,022 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-04 03:53:12,067 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_65| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_61| Int) (v_ArrVal_585 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_61| |v_t_funThread2of2ForFork0_~p~0#1.offset_65|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_585) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_61| v_ArrVal_588) |v_t_funThread2of2ForFork0_~p~0#1.offset_65|) 0))) is different from false [2023-08-04 03:53:12,204 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-04 03:53:12,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961209610] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:53:12,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:53:12,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-08-04 03:53:12,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919990118] [2023-08-04 03:53:12,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:53:12,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-04 03:53:12,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:53:12,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-04 03:53:12,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=275, Unknown=5, NotChecked=34, Total=380 [2023-08-04 03:53:12,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 476 [2023-08-04 03:53:12,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 117 transitions, 604 flow. Second operand has 20 states, 20 states have (on average 153.65) internal successors, (3073), 20 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:53:12,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:53:12,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 476 [2023-08-04 03:53:12,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:53:17,623 INFO L124 PetriNetUnfolderBase]: 10720/19778 cut-off events. [2023-08-04 03:53:17,623 INFO L125 PetriNetUnfolderBase]: For 19934/19964 co-relation queries the response was YES. [2023-08-04 03:53:17,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59185 conditions, 19778 events. 10720/19778 cut-off events. For 19934/19964 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 164703 event pairs, 2135 based on Foata normal form. 106/18129 useless extension candidates. Maximal degree in co-relation 59115. Up to 7339 conditions per place. [2023-08-04 03:53:17,722 INFO L140 encePairwiseOnDemand]: 455/476 looper letters, 404 selfloop transitions, 92 changer transitions 98/603 dead transitions. [2023-08-04 03:53:17,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 603 transitions, 3834 flow [2023-08-04 03:53:17,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-04 03:53:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-04 03:53:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3839 transitions. [2023-08-04 03:53:17,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36659663865546216 [2023-08-04 03:53:17,727 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3839 transitions. [2023-08-04 03:53:17,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3839 transitions. [2023-08-04 03:53:17,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:53:17,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3839 transitions. [2023-08-04 03:53:17,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 174.5) internal successors, (3839), 22 states have internal predecessors, (3839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:53:17,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 476.0) internal successors, (10948), 23 states have internal predecessors, (10948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:53:17,741 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 476.0) internal successors, (10948), 23 states have internal predecessors, (10948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:53:17,741 INFO L175 Difference]: Start difference. First operand has 119 places, 117 transitions, 604 flow. Second operand 22 states and 3839 transitions. [2023-08-04 03:53:17,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 603 transitions, 3834 flow [2023-08-04 03:53:17,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 603 transitions, 3833 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:53:17,781 INFO L231 Difference]: Finished difference. Result has 152 places, 185 transitions, 1431 flow [2023-08-04 03:53:17,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1431, PETRI_PLACES=152, PETRI_TRANSITIONS=185} [2023-08-04 03:53:17,782 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 84 predicate places. [2023-08-04 03:53:17,782 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 185 transitions, 1431 flow [2023-08-04 03:53:17,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 153.65) internal successors, (3073), 20 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:53:17,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:53:17,783 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-04 03:53:17,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-04 03:53:17,987 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-04 03:53:17,987 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-04 03:53:17,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:53:17,988 INFO L85 PathProgramCache]: Analyzing trace with hash 191055260, now seen corresponding path program 2 times [2023-08-04 03:53:17,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:53:17,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131528675] [2023-08-04 03:53:17,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:53:17,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:53:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:53:21,196 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-04 03:53:21,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:53:21,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131528675] [2023-08-04 03:53:21,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131528675] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:53:21,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933335621] [2023-08-04 03:53:21,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:53:21,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:53:21,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:53:21,199 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-04 03:53:21,201 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-04 03:53:21,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:53:21,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:53:21,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-04 03:53:21,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:53:21,321 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-04 03:53:21,406 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:21,407 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-04 03:53:21,443 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:53:21,474 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:53:21,506 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-04 03:53:21,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:53:21,568 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:53:21,597 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-04 03:53:21,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:53:21,643 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:53:21,690 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:21,690 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-04 03:53:21,741 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-04 03:53:21,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:53:21,940 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:53:21,940 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-04 03:53:21,945 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:53:21,945 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-04 03:53:21,948 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-04 03:53:36,055 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_674 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_67| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_63| Int) (v_ArrVal_670 (Array Int Int))) (or (= (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_67|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_63| |v_t_funThread2of2ForFork0_~p~0#1.offset_67|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-04 03:53:38,122 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-04 03:53:38,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933335621] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:53:38,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:53:38,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 31 [2023-08-04 03:53:38,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728125858] [2023-08-04 03:53:38,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:53:38,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-04 03:53:38,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:53:38,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-04 03:53:38,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=769, Unknown=7, NotChecked=60, Total=1056 [2023-08-04 03:53:38,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 476 [2023-08-04 03:53:38,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 185 transitions, 1431 flow. Second operand has 33 states, 33 states have (on average 147.87878787878788) internal successors, (4880), 33 states have internal predecessors, (4880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:53:38,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:53:38,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 476 [2023-08-04 03:53:38,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:53:41,034 WARN L539 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] [2023-08-04 03:53:43,042 WARN L539 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] [2023-08-04 03:53:43,479 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_67| Int) (v_ArrVal_676 (Array Int Int))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_67|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_676) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_67|)) 0)))) (forall ((v_ArrVal_674 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_67| Int) (v_ArrVal_676 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_674)) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_67|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_676) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_67|)) 0))))) is different from false [2023-08-04 03:53:45,889 WARN L539 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] [2023-08-04 03:53:47,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:52,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:54,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:55,294 INFO L124 PetriNetUnfolderBase]: 13588/25148 cut-off events. [2023-08-04 03:53:55,294 INFO L125 PetriNetUnfolderBase]: For 83518/83564 co-relation queries the response was YES. [2023-08-04 03:53:55,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93810 conditions, 25148 events. 13588/25148 cut-off events. For 83518/83564 co-relation queries the response was YES. Maximal size of possible extension queue 977. Compared 219868 event pairs, 1583 based on Foata normal form. 59/23015 useless extension candidates. Maximal degree in co-relation 93726. Up to 10269 conditions per place. [2023-08-04 03:53:55,433 INFO L140 encePairwiseOnDemand]: 440/476 looper letters, 354 selfloop transitions, 190 changer transitions 174/727 dead transitions. [2023-08-04 03:53:55,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 727 transitions, 6101 flow [2023-08-04 03:53:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-04 03:53:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-04 03:53:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 5813 transitions. [2023-08-04 03:53:55,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33922735760971057 [2023-08-04 03:53:55,441 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 5813 transitions. [2023-08-04 03:53:55,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 5813 transitions. [2023-08-04 03:53:55,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:53:55,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 5813 transitions. [2023-08-04 03:53:55,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 161.47222222222223) internal successors, (5813), 36 states have internal predecessors, (5813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:53:55,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 476.0) internal successors, (17612), 37 states have internal predecessors, (17612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:53:55,458 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 476.0) internal successors, (17612), 37 states have internal predecessors, (17612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:53:55,458 INFO L175 Difference]: Start difference. First operand has 152 places, 185 transitions, 1431 flow. Second operand 36 states and 5813 transitions. [2023-08-04 03:53:55,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 727 transitions, 6101 flow [2023-08-04 03:53:55,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 727 transitions, 5989 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-08-04 03:53:55,852 INFO L231 Difference]: Finished difference. Result has 194 places, 301 transitions, 3139 flow [2023-08-04 03:53:55,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=3139, PETRI_PLACES=194, PETRI_TRANSITIONS=301} [2023-08-04 03:53:55,853 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 126 predicate places. [2023-08-04 03:53:55,853 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 301 transitions, 3139 flow [2023-08-04 03:53:55,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 147.87878787878788) internal successors, (4880), 33 states have internal predecessors, (4880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:53:55,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:53:55,854 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-04 03:53:55,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-04 03:53:56,054 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-04 03:53:56,054 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-04 03:53:56,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:53:56,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1245507454, now seen corresponding path program 1 times [2023-08-04 03:53:56,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:53:56,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217497442] [2023-08-04 03:53:56,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:53:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:53:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:53:56,532 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-04 03:53:56,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:53:56,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217497442] [2023-08-04 03:53:56,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217497442] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:53:56,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125533280] [2023-08-04 03:53:56,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:53:56,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:53:56,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:53:56,536 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-04 03:53:56,538 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-04 03:53:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:53:56,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-04 03:53:56,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:53:56,679 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-04 03:53:56,726 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:56,726 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-04 03:53:56,742 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:53:56,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:53:56,782 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-04 03:53:56,827 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:56,827 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-04 03:53:56,869 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-04 03:53:56,896 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-04 03:53:56,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:53:56,963 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-04 03:53:56,970 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-04 03:54:03,069 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-04 03:54:03,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125533280] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:54:03,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:54:03,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-04 03:54:03,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884448942] [2023-08-04 03:54:03,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:54:03,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-04 03:54:03,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:54:03,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-04 03:54:03,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=211, Unknown=3, NotChecked=0, Total=272 [2023-08-04 03:54:05,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:07,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:09,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:11,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:13,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:15,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:17,332 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-04 03:54:19,379 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-04 03:54:21,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:23,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:25,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:25,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 476 [2023-08-04 03:54:25,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 301 transitions, 3139 flow. Second operand has 17 states, 17 states have (on average 154.88235294117646) internal successors, (2633), 17 states have internal predecessors, (2633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:54:25,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:54:25,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 476 [2023-08-04 03:54:25,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:54:30,508 INFO L124 PetriNetUnfolderBase]: 14508/27231 cut-off events. [2023-08-04 03:54:30,509 INFO L125 PetriNetUnfolderBase]: For 163742/163796 co-relation queries the response was YES. [2023-08-04 03:54:30,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124195 conditions, 27231 events. 14508/27231 cut-off events. For 163742/163796 co-relation queries the response was YES. Maximal size of possible extension queue 1077. Compared 244422 event pairs, 3718 based on Foata normal form. 55/24907 useless extension candidates. Maximal degree in co-relation 124088. Up to 15741 conditions per place. [2023-08-04 03:54:30,643 INFO L140 encePairwiseOnDemand]: 456/476 looper letters, 443 selfloop transitions, 96 changer transitions 103/651 dead transitions. [2023-08-04 03:54:30,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 651 transitions, 6849 flow [2023-08-04 03:54:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-04 03:54:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-04 03:54:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2999 transitions. [2023-08-04 03:54:30,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37061295106277803 [2023-08-04 03:54:30,651 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2999 transitions. [2023-08-04 03:54:30,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2999 transitions. [2023-08-04 03:54:30,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:54:30,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2999 transitions. [2023-08-04 03:54:30,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 176.41176470588235) internal successors, (2999), 17 states have internal predecessors, (2999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:54:30,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 476.0) internal successors, (8568), 18 states have internal predecessors, (8568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:54:30,658 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 476.0) internal successors, (8568), 18 states have internal predecessors, (8568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:54:30,658 INFO L175 Difference]: Start difference. First operand has 194 places, 301 transitions, 3139 flow. Second operand 17 states and 2999 transitions. [2023-08-04 03:54:30,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 651 transitions, 6849 flow [2023-08-04 03:54:32,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 651 transitions, 6599 flow, removed 96 selfloop flow, removed 22 redundant places. [2023-08-04 03:54:32,604 INFO L231 Difference]: Finished difference. Result has 192 places, 315 transitions, 3374 flow [2023-08-04 03:54:32,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=2904, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3374, PETRI_PLACES=192, PETRI_TRANSITIONS=315} [2023-08-04 03:54:32,610 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 124 predicate places. [2023-08-04 03:54:32,610 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 315 transitions, 3374 flow [2023-08-04 03:54:32,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 154.88235294117646) internal successors, (2633), 17 states have internal predecessors, (2633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:54:32,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:54:32,611 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-04 03:54:32,629 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-04 03:54:32,816 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-04 03:54:32,817 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-04 03:54:32,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:54:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash -567793192, now seen corresponding path program 3 times [2023-08-04 03:54:32,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:54:32,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932103655] [2023-08-04 03:54:32,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:54:32,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:54:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:54:33,162 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-04 03:54:33,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:54:33,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932103655] [2023-08-04 03:54:33,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932103655] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:54:33,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290964023] [2023-08-04 03:54:33,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 03:54:33,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:54:33,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:54:33,177 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-04 03:54:33,220 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-04 03:54:33,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-04 03:54:33,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:54:33,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-04 03:54:33,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:54:33,310 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-04 03:54:33,352 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:54:33,352 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-04 03:54:33,368 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:54:33,387 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:54:33,408 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-04 03:54:33,439 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:54:33,439 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-04 03:54:33,484 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-04 03:54:33,515 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-04 03:54:33,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:54:33,576 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-04 03:54:33,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 12 treesize of output 8 [2023-08-04 03:54:37,692 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-04 03:54:37,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290964023] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:54:37,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:54:37,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-04 03:54:37,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716640818] [2023-08-04 03:54:37,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:54:37,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-04 03:54:37,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:54:37,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-04 03:54:37,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=210, Unknown=3, NotChecked=0, Total=272 [2023-08-04 03:54:39,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:41,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:43,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:45,935 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-04 03:54:47,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:49,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-04 03:54:52,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:54,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-04 03:54:56,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:58,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:00,184 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-04 03:55:02,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:04,269 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-04 03:55:06,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:08,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:10,447 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-04 03:55:12,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:14,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:16,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:18,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:20,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:22,667 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-04 03:55:24,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:26,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:28,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:30,842 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-04 03:55:32,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:32,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 476 [2023-08-04 03:55:32,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 315 transitions, 3374 flow. Second operand has 17 states, 17 states have (on average 154.8235294117647) internal successors, (2632), 17 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:55:32,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:55:32,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 476 [2023-08-04 03:55:32,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:55:39,014 INFO L124 PetriNetUnfolderBase]: 16757/31680 cut-off events. [2023-08-04 03:55:39,015 INFO L125 PetriNetUnfolderBase]: For 233848/233930 co-relation queries the response was YES. [2023-08-04 03:55:39,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149335 conditions, 31680 events. 16757/31680 cut-off events. For 233848/233930 co-relation queries the response was YES. Maximal size of possible extension queue 1256. Compared 293321 event pairs, 3540 based on Foata normal form. 56/28945 useless extension candidates. Maximal degree in co-relation 149250. Up to 15583 conditions per place. [2023-08-04 03:55:39,213 INFO L140 encePairwiseOnDemand]: 456/476 looper letters, 444 selfloop transitions, 123 changer transitions 137/713 dead transitions. [2023-08-04 03:55:39,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 713 transitions, 8016 flow [2023-08-04 03:55:39,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-04 03:55:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-04 03:55:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2996 transitions. [2023-08-04 03:55:39,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.370242214532872 [2023-08-04 03:55:39,217 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2996 transitions. [2023-08-04 03:55:39,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2996 transitions. [2023-08-04 03:55:39,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:55:39,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2996 transitions. [2023-08-04 03:55:39,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 176.23529411764707) internal successors, (2996), 17 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:55:39,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 476.0) internal successors, (8568), 18 states have internal predecessors, (8568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:55:39,227 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 476.0) internal successors, (8568), 18 states have internal predecessors, (8568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:55:39,227 INFO L175 Difference]: Start difference. First operand has 192 places, 315 transitions, 3374 flow. Second operand 17 states and 2996 transitions. [2023-08-04 03:55:39,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 713 transitions, 8016 flow [2023-08-04 03:55:42,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 713 transitions, 7738 flow, removed 43 selfloop flow, removed 10 redundant places. [2023-08-04 03:55:42,355 INFO L231 Difference]: Finished difference. Result has 205 places, 349 transitions, 4128 flow [2023-08-04 03:55:42,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=3146, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4128, PETRI_PLACES=205, PETRI_TRANSITIONS=349} [2023-08-04 03:55:42,356 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 137 predicate places. [2023-08-04 03:55:42,356 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 349 transitions, 4128 flow [2023-08-04 03:55:42,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 154.8235294117647) internal successors, (2632), 17 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:55:42,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:55:42,356 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-04 03:55:42,363 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-04 03:55:42,561 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-04 03:55:42,561 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-04 03:55:42,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:55:42,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2039347774, now seen corresponding path program 2 times [2023-08-04 03:55:42,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:55:42,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181841509] [2023-08-04 03:55:42,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:55:42,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:55:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:55:42,819 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-04 03:55:42,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:55:42,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181841509] [2023-08-04 03:55:42,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181841509] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:55:42,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233363748] [2023-08-04 03:55:42,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:55:42,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:55:42,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:55:42,821 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-04 03:55:42,823 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-04 03:55:42,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:55:42,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:55:42,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-04 03:55:42,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:55:42,975 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-04 03:55:43,057 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:55:43,058 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:55:43,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:55:43,117 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:55:43,148 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-04 03:55:43,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:55:43,191 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:55:43,244 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:55:43,244 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-04 03:55:43,278 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-04 03:55:43,302 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-04 03:55:43,302 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:55:43,360 WARN L839 $PredicateComparison]: unable to prove that (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 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |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)))) is different from false [2023-08-04 03:55:43,376 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:55:43,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-04 03:55:43,382 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:55:43,383 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-04 03:55:43,385 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-04 03:55:55,481 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_69| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_932 Int)) (or (= (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_73| v_ArrVal_932) |v_t_funThread1of2ForFork0_~p~0#1.offset_69|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_69| |v_t_funThread2of2ForFork0_~p~0#1.offset_73|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-04 03:55:58,102 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-04 03:55:58,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233363748] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:55:58,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:55:58,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2023-08-04 03:55:58,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985788127] [2023-08-04 03:55:58,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:55:58,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-04 03:55:58,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:55:58,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-04 03:55:58,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=270, Unknown=6, NotChecked=70, Total=420 [2023-08-04 03:55:58,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 476 [2023-08-04 03:55:58,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 349 transitions, 4128 flow. Second operand has 21 states, 21 states have (on average 153.42857142857142) internal successors, (3222), 21 states have internal predecessors, (3222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:55:58,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:55:58,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 476 [2023-08-04 03:55:58,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:56:06,998 INFO L124 PetriNetUnfolderBase]: 19139/36669 cut-off events. [2023-08-04 03:56:06,999 INFO L125 PetriNetUnfolderBase]: For 303034/303153 co-relation queries the response was YES. [2023-08-04 03:56:07,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176195 conditions, 36669 events. 19139/36669 cut-off events. For 303034/303153 co-relation queries the response was YES. Maximal size of possible extension queue 1493. Compared 353347 event pairs, 4541 based on Foata normal form. 106/33622 useless extension candidates. Maximal degree in co-relation 176102. Up to 19482 conditions per place. [2023-08-04 03:56:07,340 INFO L140 encePairwiseOnDemand]: 457/476 looper letters, 498 selfloop transitions, 143 changer transitions 190/840 dead transitions. [2023-08-04 03:56:07,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 840 transitions, 9954 flow [2023-08-04 03:56:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-04 03:56:07,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-04 03:56:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3688 transitions. [2023-08-04 03:56:07,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3689475790316126 [2023-08-04 03:56:07,359 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3688 transitions. [2023-08-04 03:56:07,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3688 transitions. [2023-08-04 03:56:07,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:56:07,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3688 transitions. [2023-08-04 03:56:07,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 175.61904761904762) internal successors, (3688), 21 states have internal predecessors, (3688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:07,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 476.0) internal successors, (10472), 22 states have internal predecessors, (10472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:07,368 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 476.0) internal successors, (10472), 22 states have internal predecessors, (10472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:07,368 INFO L175 Difference]: Start difference. First operand has 205 places, 349 transitions, 4128 flow. Second operand 21 states and 3688 transitions. [2023-08-04 03:56:07,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 840 transitions, 9954 flow [2023-08-04 03:56:10,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 840 transitions, 9682 flow, removed 49 selfloop flow, removed 7 redundant places. [2023-08-04 03:56:10,615 INFO L231 Difference]: Finished difference. Result has 225 places, 388 transitions, 5132 flow [2023-08-04 03:56:10,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=3925, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5132, PETRI_PLACES=225, PETRI_TRANSITIONS=388} [2023-08-04 03:56:10,616 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 157 predicate places. [2023-08-04 03:56:10,616 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 388 transitions, 5132 flow [2023-08-04 03:56:10,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 153.42857142857142) internal successors, (3222), 21 states have internal predecessors, (3222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:10,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:56:10,617 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-04 03:56:10,622 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-04 03:56:10,822 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-04 03:56:10,822 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-04 03:56:10,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:56:10,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1898646590, now seen corresponding path program 3 times [2023-08-04 03:56:10,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:56:10,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915068280] [2023-08-04 03:56:10,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:56:10,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:56:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:56:11,134 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-04 03:56:11,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:56:11,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915068280] [2023-08-04 03:56:11,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915068280] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:56:11,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428841945] [2023-08-04 03:56:11,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 03:56:11,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:56:11,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:56:11,147 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-04 03:56:11,148 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-04 03:56:11,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-04 03:56:11,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:56:11,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-04 03:56:11,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:56:11,271 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-04 03:56:11,346 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:56:11,346 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-04 03:56:11,366 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:56:11,394 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:56:11,421 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-04 03:56:11,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:56:11,466 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:56:11,483 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-04 03:56:11,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:56:11,509 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:56:11,536 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:56:11,537 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-04 03:56:11,563 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-04 03:56:11,563 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:56:11,606 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int)) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_71|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1019) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_71| 4)) 0)))) is different from false [2023-08-04 03:56:11,670 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:56:11,670 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-04 03:56:11,678 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:56:11,678 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-04 03:56:11,681 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-04 03:56:23,801 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-04 03:56:23,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428841945] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:56:23,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:56:23,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-04 03:56:23,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307107476] [2023-08-04 03:56:23,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:56:23,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-04 03:56:23,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:56:23,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-04 03:56:23,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=282, Unknown=3, NotChecked=36, Total=420 [2023-08-04 03:56:23,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 476 [2023-08-04 03:56:23,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 388 transitions, 5132 flow. Second operand has 21 states, 21 states have (on average 153.38095238095238) internal successors, (3221), 21 states have internal predecessors, (3221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:23,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:56:23,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 476 [2023-08-04 03:56:23,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:56:26,133 WARN L539 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] [2023-08-04 03:56:28,137 WARN L539 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] [2023-08-04 03:56:30,645 WARN L539 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] [2023-08-04 03:56:32,650 WARN L539 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] [2023-08-04 03:56:42,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:56:47,130 INFO L124 PetriNetUnfolderBase]: 20394/39008 cut-off events. [2023-08-04 03:56:47,131 INFO L125 PetriNetUnfolderBase]: For 330066/330110 co-relation queries the response was YES. [2023-08-04 03:56:47,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189588 conditions, 39008 events. 20394/39008 cut-off events. For 330066/330110 co-relation queries the response was YES. Maximal size of possible extension queue 1690. Compared 379329 event pairs, 3587 based on Foata normal form. 59/35688 useless extension candidates. Maximal degree in co-relation 189487. Up to 21562 conditions per place. [2023-08-04 03:56:47,532 INFO L140 encePairwiseOnDemand]: 453/476 looper letters, 513 selfloop transitions, 220 changer transitions 138/880 dead transitions. [2023-08-04 03:56:47,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 880 transitions, 11114 flow [2023-08-04 03:56:47,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-04 03:56:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-04 03:56:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3852 transitions. [2023-08-04 03:56:47,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36783804430863254 [2023-08-04 03:56:47,537 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3852 transitions. [2023-08-04 03:56:47,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3852 transitions. [2023-08-04 03:56:47,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:56:47,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3852 transitions. [2023-08-04 03:56:47,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 175.0909090909091) internal successors, (3852), 22 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:47,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 476.0) internal successors, (10948), 23 states have internal predecessors, (10948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:47,546 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 476.0) internal successors, (10948), 23 states have internal predecessors, (10948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:47,546 INFO L175 Difference]: Start difference. First operand has 225 places, 388 transitions, 5132 flow. Second operand 22 states and 3852 transitions. [2023-08-04 03:56:47,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 880 transitions, 11114 flow [2023-08-04 03:56:52,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 880 transitions, 10560 flow, removed 255 selfloop flow, removed 4 redundant places. [2023-08-04 03:56:52,730 INFO L231 Difference]: Finished difference. Result has 247 places, 476 transitions, 6828 flow [2023-08-04 03:56:52,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=4800, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6828, PETRI_PLACES=247, PETRI_TRANSITIONS=476} [2023-08-04 03:56:52,731 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 179 predicate places. [2023-08-04 03:56:52,731 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 476 transitions, 6828 flow [2023-08-04 03:56:52,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 153.38095238095238) internal successors, (3221), 21 states have internal predecessors, (3221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:52,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:56:52,731 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-04 03:56:52,738 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-04 03:56:52,938 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-04 03:56:52,939 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-04 03:56:52,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:56:52,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1012129974, now seen corresponding path program 4 times [2023-08-04 03:56:52,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:56:52,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302602538] [2023-08-04 03:56:52,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:56:52,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:56:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:56:53,386 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-04 03:56:53,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:56:53,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302602538] [2023-08-04 03:56:53,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302602538] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:56:53,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378069602] [2023-08-04 03:56:53,386 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 03:56:53,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:56:53,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:56:53,388 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-04 03:56:53,390 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-04 03:56:53,539 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 03:56:53,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:56:53,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-04 03:56:53,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:56:53,547 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:56:53,644 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:56:53,644 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-04 03:56:53,666 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:56:53,702 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-04 03:56:53,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:56:53,756 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:56:53,788 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-04 03:56:53,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:56:53,822 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:56:53,853 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:56:53,895 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:56:53,895 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-04 03:56:53,928 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-04 03:56:53,929 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:56:54,099 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:56:54,099 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-04 03:56:54,107 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:56:54,108 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-04 03:56:54,112 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-04 03:56:54,136 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_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1103 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1103)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) 0))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1103 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_73| |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1103)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) 0))))) is different from false [2023-08-04 03:56:54,177 WARN L839 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1103 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_1099 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1099))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1103))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|)))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1103 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_1099 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_73| |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1099))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1103))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|))))) is different from false [2023-08-04 03:57:02,251 WARN L233 SmtUtils]: Spent 8.03s 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-04 03:57:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-04 03:57:02,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378069602] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:57:02,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:57:02,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-08-04 03:57:02,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241552802] [2023-08-04 03:57:02,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:57:02,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-04 03:57:02,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:57:02,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-04 03:57:02,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=309, Unknown=9, NotChecked=78, Total=506 [2023-08-04 03:57:02,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 476 [2023-08-04 03:57:02,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 476 transitions, 6828 flow. Second operand has 23 states, 23 states have (on average 153.2173913043478) internal successors, (3524), 23 states have internal predecessors, (3524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:57:02,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:57:02,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 476 [2023-08-04 03:57:02,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:57:04,689 WARN L539 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] [2023-08-04 03:57:06,694 WARN L539 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] [2023-08-04 03:57:08,703 WARN L539 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] [2023-08-04 03:57:08,933 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1105) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_77|)) 0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) 0))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 Int)) (or (= 0 (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1103)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|)) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1105) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_77|)) 0)))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int)) (or (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_77|)) 0)) (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) 0)))) is different from false [2023-08-04 03:57:11,347 WARN L539 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] [2023-08-04 03:57:13,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 [0] [2023-08-04 03:57:15,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 [0] [2023-08-04 03:57:24,967 INFO L124 PetriNetUnfolderBase]: 21031/40391 cut-off events. [2023-08-04 03:57:24,967 INFO L125 PetriNetUnfolderBase]: For 401296/401425 co-relation queries the response was YES. [2023-08-04 03:57:25,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209213 conditions, 40391 events. 21031/40391 cut-off events. For 401296/401425 co-relation queries the response was YES. Maximal size of possible extension queue 1813. Compared 396357 event pairs, 4138 based on Foata normal form. 54/36921 useless extension candidates. Maximal degree in co-relation 209103. Up to 22736 conditions per place. [2023-08-04 03:57:25,347 INFO L140 encePairwiseOnDemand]: 448/476 looper letters, 519 selfloop transitions, 229 changer transitions 222/979 dead transitions. [2023-08-04 03:57:25,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 979 transitions, 13340 flow [2023-08-04 03:57:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-04 03:57:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-04 03:57:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4434 transitions. [2023-08-04 03:57:25,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35827407886231416 [2023-08-04 03:57:25,351 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4434 transitions. [2023-08-04 03:57:25,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4434 transitions. [2023-08-04 03:57:25,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:57:25,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4434 transitions. [2023-08-04 03:57:25,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 170.53846153846155) internal successors, (4434), 26 states have internal predecessors, (4434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:57:25,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 476.0) internal successors, (12852), 27 states have internal predecessors, (12852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:57:25,363 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 476.0) internal successors, (12852), 27 states have internal predecessors, (12852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:57:25,363 INFO L175 Difference]: Start difference. First operand has 247 places, 476 transitions, 6828 flow. Second operand 26 states and 4434 transitions. [2023-08-04 03:57:25,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 979 transitions, 13340 flow [2023-08-04 03:57:32,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 979 transitions, 12772 flow, removed 254 selfloop flow, removed 7 redundant places. [2023-08-04 03:57:32,537 INFO L231 Difference]: Finished difference. Result has 278 places, 520 transitions, 7806 flow [2023-08-04 03:57:32,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=6268, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=7806, PETRI_PLACES=278, PETRI_TRANSITIONS=520} [2023-08-04 03:57:32,537 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 210 predicate places. [2023-08-04 03:57:32,538 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 520 transitions, 7806 flow [2023-08-04 03:57:32,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 153.2173913043478) internal successors, (3524), 23 states have internal predecessors, (3524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:57:32,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:57:32,538 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-04 03:57:32,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-08-04 03:57:32,739 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-04 03:57:32,740 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:57:32,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:57:32,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1353549348, now seen corresponding path program 1 times [2023-08-04 03:57:32,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:57:32,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260824262] [2023-08-04 03:57:32,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:32,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:57:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:57:33,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:57:33,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260824262] [2023-08-04 03:57:33,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260824262] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:57:33,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661161414] [2023-08-04 03:57:33,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:33,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:57:33,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:57:33,057 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-04 03:57:33,151 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-04 03:57:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:33,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-04 03:57:33,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:57:33,258 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-04 03:57:33,331 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:57:33,331 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-04 03:57:33,351 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:57:33,378 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:57:33,400 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-04 03:57:33,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:57:33,444 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:57:33,491 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-04 03:57:33,491 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 22 treesize of output 15 [2023-08-04 03:57:33,519 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-04 03:57:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:57:33,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:57:35,659 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:57:35,659 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 26 treesize of output 27 [2023-08-04 03:57:35,666 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:57:35,667 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 45 treesize of output 42 [2023-08-04 03:57:35,670 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 25 treesize of output 18 [2023-08-04 03:57:49,815 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_75| Int) (|~#a~0.offset| Int) (v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1192 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_75|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1187) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1192) .cse0) 0))))) is different from false [2023-08-04 03:57:53,335 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-04 03:57:53,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661161414] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:57:53,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:57:53,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-04 03:57:53,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401772034] [2023-08-04 03:57:53,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:57:53,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-04 03:57:53,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:57:53,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-04 03:57:53,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=325, Unknown=6, NotChecked=38, Total=462 [2023-08-04 03:57:53,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 476 [2023-08-04 03:57:53,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 520 transitions, 7806 flow. Second operand has 22 states, 22 states have (on average 151.45454545454547) internal successors, (3332), 22 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:57:53,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:57:53,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 476 [2023-08-04 03:57:53,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:58:41,220 INFO L124 PetriNetUnfolderBase]: 34519/67845 cut-off events. [2023-08-04 03:58:41,220 INFO L125 PetriNetUnfolderBase]: For 775659/775823 co-relation queries the response was YES. [2023-08-04 03:58:42,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381593 conditions, 67845 events. 34519/67845 cut-off events. For 775659/775823 co-relation queries the response was YES. Maximal size of possible extension queue 2852. Compared 728240 event pairs, 7863 based on Foata normal form. 381/62590 useless extension candidates. Maximal degree in co-relation 381469. Up to 26099 conditions per place. [2023-08-04 03:58:42,303 INFO L140 encePairwiseOnDemand]: 455/476 looper letters, 694 selfloop transitions, 358 changer transitions 431/1492 dead transitions. [2023-08-04 03:58:42,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 1492 transitions, 22981 flow [2023-08-04 03:58:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-04 03:58:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-04 03:58:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4615 transitions. [2023-08-04 03:58:42,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35908807967631495 [2023-08-04 03:58:42,308 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4615 transitions. [2023-08-04 03:58:42,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4615 transitions. [2023-08-04 03:58:42,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:58:42,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4615 transitions. [2023-08-04 03:58:42,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 170.92592592592592) internal successors, (4615), 27 states have internal predecessors, (4615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:58:42,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 476.0) internal successors, (13328), 28 states have internal predecessors, (13328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:58:42,330 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 476.0) internal successors, (13328), 28 states have internal predecessors, (13328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:58:42,330 INFO L175 Difference]: Start difference. First operand has 278 places, 520 transitions, 7806 flow. Second operand 27 states and 4615 transitions. [2023-08-04 03:58:42,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 1492 transitions, 22981 flow [2023-08-04 03:59:00,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 1492 transitions, 22412 flow, removed 181 selfloop flow, removed 10 redundant places. [2023-08-04 03:59:00,741 INFO L231 Difference]: Finished difference. Result has 308 places, 721 transitions, 12417 flow [2023-08-04 03:59:00,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=7426, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=12417, PETRI_PLACES=308, PETRI_TRANSITIONS=721} [2023-08-04 03:59:00,742 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 240 predicate places. [2023-08-04 03:59:00,742 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 721 transitions, 12417 flow [2023-08-04 03:59:00,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 151.45454545454547) internal successors, (3332), 22 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:59:00,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:59:00,742 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-04 03:59:00,746 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-04 03:59:00,946 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-04 03:59:00,947 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-04 03:59:00,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:59:00,947 INFO L85 PathProgramCache]: Analyzing trace with hash 2133459604, now seen corresponding path program 1 times [2023-08-04 03:59:00,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:59:00,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967918316] [2023-08-04 03:59:00,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:00,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:59:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:59:10,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:59:10,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967918316] [2023-08-04 03:59:10,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967918316] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:59:10,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938272506] [2023-08-04 03:59:10,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:10,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:59:10,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:59:10,054 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-04 03:59:10,056 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-04 03:59:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:10,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-04 03:59:10,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:59:10,218 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-04 03:59:10,301 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:59:10,301 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-04 03:59:10,339 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:59:10,358 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 03:59:10,391 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-04 03:59:10,471 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-04 03:59:10,471 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 22 treesize of output 15 [2023-08-04 03:59:10,542 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 22 treesize of output 17 [2023-08-04 03:59:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:59:10,599 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:59:10,719 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 18 treesize of output 16 [2023-08-04 03:59:10,723 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 19 treesize of output 12 [2023-08-04 03:59:26,957 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1276 Int) (|~#a~0.offset| Int) (v_ArrVal_1273 (Array Int Int)) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1273) |c_~#a~0.base|) .cse0 v_ArrVal_1276) |v_t_funThread1of2ForFork0_~p~0#1.offset_77|) 0) (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_77|)))) is different from false [2023-08-04 03:59:27,143 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-04 03:59:27,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938272506] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:59:27,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:59:27,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 27 [2023-08-04 03:59:27,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994558659] [2023-08-04 03:59:27,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:59:27,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-04 03:59:27,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:59:27,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-04 03:59:27,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=616, Unknown=9, NotChecked=52, Total=812 [2023-08-04 03:59:27,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 476 [2023-08-04 03:59:27,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 721 transitions, 12417 flow. Second operand has 29 states, 29 states have (on average 146.17241379310346) internal successors, (4239), 29 states have internal predecessors, (4239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:59:27,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:59:27,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 476 [2023-08-04 03:59:27,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:59:52,162 INFO L124 PetriNetUnfolderBase]: 33471/66227 cut-off events. [2023-08-04 03:59:52,163 INFO L125 PetriNetUnfolderBase]: For 1177146/1177300 co-relation queries the response was YES. [2023-08-04 03:59:53,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424373 conditions, 66227 events. 33471/66227 cut-off events. For 1177146/1177300 co-relation queries the response was YES. Maximal size of possible extension queue 2802. Compared 712463 event pairs, 11275 based on Foata normal form. 74/60508 useless extension candidates. Maximal degree in co-relation 424232. Up to 43972 conditions per place. [2023-08-04 03:59:53,386 INFO L140 encePairwiseOnDemand]: 455/476 looper letters, 772 selfloop transitions, 225 changer transitions 157/1163 dead transitions. [2023-08-04 03:59:53,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 1163 transitions, 19142 flow [2023-08-04 03:59:53,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-04 03:59:53,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-04 03:59:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4783 transitions. [2023-08-04 03:59:53,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3349439775910364 [2023-08-04 03:59:53,390 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4783 transitions. [2023-08-04 03:59:53,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4783 transitions. [2023-08-04 03:59:53,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:59:53,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4783 transitions. [2023-08-04 03:59:53,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 159.43333333333334) internal successors, (4783), 30 states have internal predecessors, (4783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:59:53,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 476.0) internal successors, (14756), 31 states have internal predecessors, (14756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:59:53,401 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 476.0) internal successors, (14756), 31 states have internal predecessors, (14756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:59:53,401 INFO L175 Difference]: Start difference. First operand has 308 places, 721 transitions, 12417 flow. Second operand 30 states and 4783 transitions. [2023-08-04 03:59:53,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 1163 transitions, 19142 flow [2023-08-04 04:00:15,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 1163 transitions, 18699 flow, removed 204 selfloop flow, removed 5 redundant places. [2023-08-04 04:00:15,221 INFO L231 Difference]: Finished difference. Result has 337 places, 752 transitions, 13322 flow [2023-08-04 04:00:15,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=12046, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=13322, PETRI_PLACES=337, PETRI_TRANSITIONS=752} [2023-08-04 04:00:15,222 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 269 predicate places. [2023-08-04 04:00:15,223 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 752 transitions, 13322 flow [2023-08-04 04:00:15,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 146.17241379310346) internal successors, (4239), 29 states have internal predecessors, (4239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:15,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:00:15,223 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-04 04:00:15,229 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-04 04:00:15,429 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-04 04:00:15,429 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:00:15,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:00:15,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1634994652, now seen corresponding path program 2 times [2023-08-04 04:00:15,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:00:15,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37199564] [2023-08-04 04:00:15,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:00:15,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:00:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:00:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 04:00:15,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:00:15,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37199564] [2023-08-04 04:00:15,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37199564] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:00:15,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082961690] [2023-08-04 04:00:15,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:00:15,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:00:15,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:00:15,767 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-04 04:00:15,769 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-04 04:00:15,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 04:00:15,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:00:15,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-04 04:00:15,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:00:15,917 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-04 04:00:15,975 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:00:15,975 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-04 04:00:15,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:00:16,007 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 04:00:16,027 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 16 treesize of output 12 [2023-08-04 04:00:16,057 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-04 04:00:16,057 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 22 treesize of output 15 [2023-08-04 04:00:16,100 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-04 04:00:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 04:00:16,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:00:16,185 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 18 treesize of output 16 [2023-08-04 04:00:16,189 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 16 treesize of output 12 [2023-08-04 04:00:30,300 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1361 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1358 (Array Int Int)) (|~#a~0.offset| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_79|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1358) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_79| v_ArrVal_1361) .cse0) 0)))) is different from false [2023-08-04 04:00:30,438 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-04 04:00:30,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082961690] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:00:30,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:00:30,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-08-04 04:00:30,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162970415] [2023-08-04 04:00:30,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:00:30,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-04 04:00:30,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:00:30,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-04 04:00:30,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=231, Unknown=3, NotChecked=32, Total=342 [2023-08-04 04:00:30,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 476 [2023-08-04 04:00:30,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 752 transitions, 13322 flow. Second operand has 19 states, 19 states have (on average 151.94736842105263) internal successors, (2887), 19 states have internal predecessors, (2887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:30,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:00:30,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 476 [2023-08-04 04:00:30,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:00:55,633 INFO L124 PetriNetUnfolderBase]: 37744/75882 cut-off events. [2023-08-04 04:00:55,633 INFO L125 PetriNetUnfolderBase]: For 1460959/1461138 co-relation queries the response was YES. [2023-08-04 04:00:57,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497094 conditions, 75882 events. 37744/75882 cut-off events. For 1460959/1461138 co-relation queries the response was YES. Maximal size of possible extension queue 3073. Compared 842700 event pairs, 12895 based on Foata normal form. 181/69761 useless extension candidates. Maximal degree in co-relation 496935. Up to 39520 conditions per place. [2023-08-04 04:00:57,165 INFO L140 encePairwiseOnDemand]: 457/476 looper letters, 800 selfloop transitions, 263 changer transitions 273/1345 dead transitions. [2023-08-04 04:00:57,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 1345 transitions, 24938 flow [2023-08-04 04:00:57,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-04 04:00:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-04 04:00:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2590 transitions. [2023-08-04 04:00:57,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3627450980392157 [2023-08-04 04:00:57,169 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2590 transitions. [2023-08-04 04:00:57,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2590 transitions. [2023-08-04 04:00:57,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:00:57,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2590 transitions. [2023-08-04 04:00:57,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 172.66666666666666) internal successors, (2590), 15 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:57,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 476.0) internal successors, (7616), 16 states have internal predecessors, (7616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:57,177 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 476.0) internal successors, (7616), 16 states have internal predecessors, (7616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:57,177 INFO L175 Difference]: Start difference. First operand has 337 places, 752 transitions, 13322 flow. Second operand 15 states and 2590 transitions. [2023-08-04 04:00:57,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 1345 transitions, 24938 flow [2023-08-04 04:01:24,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 1345 transitions, 24705 flow, removed 74 selfloop flow, removed 14 redundant places. [2023-08-04 04:01:24,649 INFO L231 Difference]: Finished difference. Result has 347 places, 849 transitions, 16399 flow [2023-08-04 04:01:24,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=13102, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=16399, PETRI_PLACES=347, PETRI_TRANSITIONS=849} [2023-08-04 04:01:24,650 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 279 predicate places. [2023-08-04 04:01:24,650 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 849 transitions, 16399 flow [2023-08-04 04:01:24,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 151.94736842105263) internal successors, (2887), 19 states have internal predecessors, (2887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:24,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:01:24,651 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-04 04:01:24,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-08-04 04:01:24,855 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-04 04:01:24,856 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:01:24,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:01:24,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1954030730, now seen corresponding path program 1 times [2023-08-04 04:01:24,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:01:24,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379083132] [2023-08-04 04:01:24,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:24,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:01:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 04:01:25,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:01:25,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379083132] [2023-08-04 04:01:25,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379083132] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:01:25,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479542177] [2023-08-04 04:01:25,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:25,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:01:25,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:01:25,345 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-04 04:01:25,349 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-04 04:01:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:25,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-04 04:01:25,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:01:25,504 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 04:01:25,599 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:01:25,600 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-04 04:01:25,628 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 04:01:25,653 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 04:01:25,690 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-04 04:01:25,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:01:25,730 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 04:01:25,765 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-04 04:01:25,766 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 22 treesize of output 15 [2023-08-04 04:01:25,794 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-04 04:01:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 04:01:25,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:01:27,951 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:01:27,951 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-08-04 04:01:27,959 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:01:27,960 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 45 treesize of output 42 [2023-08-04 04:01:27,965 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 25 treesize of output 18 [2023-08-04 04:01:40,136 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1443 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_82| Int) (|~#a~0.offset| Int) (v_ArrVal_1448 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1443) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_82| v_ArrVal_1448) .cse0) 0) (= .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_82|)))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-04 04:01:43,615 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-04 04:01:43,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479542177] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:01:43,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:01:43,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2023-08-04 04:01:43,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258746916] [2023-08-04 04:01:43,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:01:43,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-04 04:01:43,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:01:43,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-04 04:01:43,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=386, Unknown=5, NotChecked=42, Total=552 [2023-08-04 04:01:45,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:01:47,718 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-04 04:01:49,813 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-04 04:01:51,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:01:53,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:01:53,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-08-04 04:01:53,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 849 transitions, 16399 flow. Second operand has 24 states, 24 states have (on average 149.375) internal successors, (3585), 24 states have internal predecessors, (3585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:53,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:01:53,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-08-04 04:01:53,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:01:56,495 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (forall ((|~#a~0.offset| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1448 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_1448)) |c_~#a~0.base|) (+ .cse1 |~#a~0.offset|)) 0)) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ .cse1 4 |~#a~0.offset|)) 0))))) (forall ((v_ArrVal_1446 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_1448 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1446) |c_~#a~0.base|) (+ .cse2 4 |~#a~0.offset|)) 0)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1448)) |c_~#a~0.base|) (+ .cse2 |~#a~0.offset|)) 0)))))) is different from false [2023-08-04 04:02:28,506 INFO L124 PetriNetUnfolderBase]: 45720/92174 cut-off events. [2023-08-04 04:02:28,506 INFO L125 PetriNetUnfolderBase]: For 1918322/1918520 co-relation queries the response was YES. [2023-08-04 04:02:30,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611682 conditions, 92174 events. 45720/92174 cut-off events. For 1918322/1918520 co-relation queries the response was YES. Maximal size of possible extension queue 3795. Compared 1055411 event pairs, 15659 based on Foata normal form. 362/84445 useless extension candidates. Maximal degree in co-relation 611522. Up to 42104 conditions per place. [2023-08-04 04:02:30,364 INFO L140 encePairwiseOnDemand]: 444/476 looper letters, 948 selfloop transitions, 394 changer transitions 262/1613 dead transitions. [2023-08-04 04:02:30,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 1613 transitions, 30108 flow [2023-08-04 04:02:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-04 04:02:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-04 04:02:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3238 transitions. [2023-08-04 04:02:30,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35802742149491373 [2023-08-04 04:02:30,387 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3238 transitions. [2023-08-04 04:02:30,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3238 transitions. [2023-08-04 04:02:30,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:02:30,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3238 transitions. [2023-08-04 04:02:30,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 170.42105263157896) internal successors, (3238), 19 states have internal predecessors, (3238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:30,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 476.0) internal successors, (9520), 20 states have internal predecessors, (9520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:30,396 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 476.0) internal successors, (9520), 20 states have internal predecessors, (9520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:30,397 INFO L175 Difference]: Start difference. First operand has 347 places, 849 transitions, 16399 flow. Second operand 19 states and 3238 transitions. [2023-08-04 04:02:30,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 1613 transitions, 30108 flow [2023-08-04 04:03:13,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 1613 transitions, 29956 flow, removed 76 selfloop flow, removed 0 redundant places. [2023-08-04 04:03:13,406 INFO L231 Difference]: Finished difference. Result has 377 places, 1024 transitions, 21276 flow [2023-08-04 04:03:13,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=16299, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=849, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=253, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=21276, PETRI_PLACES=377, PETRI_TRANSITIONS=1024} [2023-08-04 04:03:13,407 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 309 predicate places. [2023-08-04 04:03:13,407 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 1024 transitions, 21276 flow [2023-08-04 04:03:13,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 149.375) internal successors, (3585), 24 states have internal predecessors, (3585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:13,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:03:13,408 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-04 04:03:13,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-08-04 04:03:13,613 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-04 04:03:13,613 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-04 04:03:13,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:03:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1212223344, now seen corresponding path program 2 times [2023-08-04 04:03:13,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:03:13,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977155368] [2023-08-04 04:03:13,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:13,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:03:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 04:03:13,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:03:13,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977155368] [2023-08-04 04:03:13,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977155368] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:03:13,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640847473] [2023-08-04 04:03:13,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:03:13,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:03:13,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:03:13,864 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-04 04:03:13,866 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-04 04:03:14,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 04:03:14,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:03:14,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-04 04:03:14,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:03:14,028 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-04 04:03:14,137 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:03:14,137 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-04 04:03:14,166 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:03:14,194 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:03:14,237 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 16 treesize of output 12 [2023-08-04 04:03:14,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:03:14,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-04 04:03:14,309 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-04 04:03:14,310 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 22 treesize of output 15 [2023-08-04 04:03:14,344 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 22 treesize of output 17 [2023-08-04 04:03:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 04:03:14,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:03:14,459 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:03:14,460 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-08-04 04:03:14,467 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:03:14,467 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 42 treesize of output 39 [2023-08-04 04:03:14,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 22 treesize of output 18 [2023-08-04 04:03:16,623 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1529 (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_1529) |c_~#a~0.base|)))) is different from false [2023-08-04 04:03:19,564 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-04 04:03:19,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640847473] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:03:19,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:03:19,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2023-08-04 04:03:19,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348692547] [2023-08-04 04:03:19,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:03:19,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-04 04:03:19,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:03:19,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-04 04:03:19,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=278, Unknown=1, NotChecked=34, Total=380 [2023-08-04 04:03:19,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 476 [2023-08-04 04:03:19,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 1024 transitions, 21276 flow. Second operand has 20 states, 20 states have (on average 151.6) internal successors, (3032), 20 states have internal predecessors, (3032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:19,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:03:19,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 476 [2023-08-04 04:03:19,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:03:24,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:03:26,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:03:29,794 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-04 04:03:31,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:03:33,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:03:36,160 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-04 04:03:38,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:03:40,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:03:42,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:03:44,694 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-04 04:03:52,132 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1534 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_82| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1532) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_82| 4)) 0)) (= 0 (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#a~0.offset|) v_ArrVal_1534) |v_t_funThread1of2ForFork0_~p~0#1.offset_82|)))) (= (select (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-04 04:03:55,924 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-04 04:04:21,533 INFO L124 PetriNetUnfolderBase]: 47093/94707 cut-off events. [2023-08-04 04:04:21,533 INFO L125 PetriNetUnfolderBase]: For 2156398/2156825 co-relation queries the response was YES. [2023-08-04 04:04:23,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671683 conditions, 94707 events. 47093/94707 cut-off events. For 2156398/2156825 co-relation queries the response was YES. Maximal size of possible extension queue 3955. Compared 1085774 event pairs, 17417 based on Foata normal form. 118/86317 useless extension candidates. Maximal degree in co-relation 671509. Up to 60746 conditions per place. [2023-08-04 04:04:24,209 INFO L140 encePairwiseOnDemand]: 449/476 looper letters, 1018 selfloop transitions, 362 changer transitions 296/1685 dead transitions. [2023-08-04 04:04:24,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 1685 transitions, 33922 flow [2023-08-04 04:04:24,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-04 04:04:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-04 04:04:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3955 transitions. [2023-08-04 04:04:24,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3612531969309463 [2023-08-04 04:04:24,213 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3955 transitions. [2023-08-04 04:04:24,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3955 transitions. [2023-08-04 04:04:24,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:04:24,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3955 transitions. [2023-08-04 04:04:24,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 171.95652173913044) internal successors, (3955), 23 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:24,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 476.0) internal successors, (11424), 24 states have internal predecessors, (11424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:24,228 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 476.0) internal successors, (11424), 24 states have internal predecessors, (11424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:24,228 INFO L175 Difference]: Start difference. First operand has 377 places, 1024 transitions, 21276 flow. Second operand 23 states and 3955 transitions. [2023-08-04 04:04:24,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 1685 transitions, 33922 flow Received shutdown request... [2023-08-04 04:04:55,639 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 04:04:55,642 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-04 04:04:55,645 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-04 04:04:55,652 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 04:04:55,843 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-04 04:04:55,843 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2023-08-04 04:04:55,843 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 04:04:55,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 04:04:55,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 04:04:55,844 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-08-04 04:04:55,844 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-04 04:04:55,845 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 04:04:55,845 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 04:04:55,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 04:04:55 BasicIcfg [2023-08-04 04:04:55,847 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 04:04:55,848 INFO L158 Benchmark]: Toolchain (without parser) took 793299.65ms. Allocated memory was 585.1MB in the beginning and 14.6GB in the end (delta: 14.1GB). Free memory was 548.7MB in the beginning and 11.8GB in the end (delta: -11.2GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. [2023-08-04 04:04:55,848 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 411.0MB. Free memory is still 368.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 04:04:55,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.64ms. Allocated memory is still 585.1MB. Free memory was 548.7MB in the beginning and 519.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-04 04:04:55,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.67ms. Allocated memory is still 585.1MB. Free memory was 519.3MB in the beginning and 516.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 04:04:55,848 INFO L158 Benchmark]: Boogie Preprocessor took 25.37ms. Allocated memory is still 585.1MB. Free memory was 516.7MB in the beginning and 514.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 04:04:55,848 INFO L158 Benchmark]: RCFGBuilder took 510.56ms. Allocated memory is still 585.1MB. Free memory was 514.6MB in the beginning and 494.2MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-04 04:04:55,848 INFO L158 Benchmark]: TraceAbstraction took 792193.53ms. Allocated memory was 585.1MB in the beginning and 14.6GB in the end (delta: 14.1GB). Free memory was 493.6MB in the beginning and 11.8GB in the end (delta: -11.3GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. [2023-08-04 04:04:55,849 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 411.0MB. Free memory is still 368.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 530.64ms. Allocated memory is still 585.1MB. Free memory was 548.7MB in the beginning and 519.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.67ms. Allocated memory is still 585.1MB. Free memory was 519.3MB in the beginning and 516.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.37ms. Allocated memory is still 585.1MB. Free memory was 516.7MB in the beginning and 514.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 510.56ms. Allocated memory is still 585.1MB. Free memory was 514.6MB in the beginning and 494.2MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 792193.53ms. Allocated memory was 585.1MB in the beginning and 14.6GB in the end (delta: 14.1GB). Free memory was 493.6MB in the beginning and 11.8GB in the end (delta: -11.3GB). Peak memory consumption was 8.3GB. 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.4s, 158 PlacesBefore, 45 PlacesAfterwards, 185 TransitionsBefore, 65 TransitionsAfterwards, 10336 CoEnabledTransitionPairs, 5 FixpointIterations, 35 TrivialSequentialCompositions, 88 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 16 ConcurrentYvCompositions, 7 ChoiceCompositions, 151 TotalNumberOfCompositions, 15158 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8146, independent: 7914, independent conditional: 0, independent unconditional: 7914, dependent: 232, dependent conditional: 0, dependent unconditional: 232, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5129, independent: 5073, independent conditional: 0, independent unconditional: 5073, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8146, independent: 2841, independent conditional: 0, independent unconditional: 2841, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 5129, unknown conditional: 0, unknown unconditional: 5129] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 201, Positive conditional cache size: 0, Positive unconditional cache size: 201, 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: 1.7s, 158 PlacesBefore, 45 PlacesAfterwards, 185 TransitionsBefore, 66 TransitionsAfterwards, 10336 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 90 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 150 TotalNumberOfCompositions, 16649 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8305, independent: 8033, independent conditional: 0, independent unconditional: 8033, dependent: 272, dependent conditional: 0, dependent unconditional: 272, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5080, independent: 5023, independent conditional: 0, independent unconditional: 5023, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8305, independent: 3010, independent conditional: 0, independent unconditional: 3010, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 5080, unknown conditional: 0, unknown unconditional: 5080] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 199, Positive conditional cache size: 0, Positive unconditional cache size: 199, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 220 PlacesBefore, 68 PlacesAfterwards, 260 TransitionsBefore, 101 TransitionsAfterwards, 31416 CoEnabledTransitionPairs, 5 FixpointIterations, 37 TrivialSequentialCompositions, 141 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 27 ConcurrentYvCompositions, 7 ChoiceCompositions, 216 TotalNumberOfCompositions, 49651 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25177, independent: 24830, independent conditional: 0, independent unconditional: 24830, dependent: 347, dependent conditional: 0, dependent unconditional: 347, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15630, independent: 15542, independent conditional: 0, independent unconditional: 15542, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25177, independent: 9288, independent conditional: 0, independent unconditional: 9288, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 15630, unknown conditional: 0, unknown unconditional: 15630] , Statistics on independence cache: Total cache size (in pairs): 542, Positive cache size: 501, Positive conditional cache size: 0, Positive unconditional cache size: 501, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 216 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.8s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 396 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 300 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 856 IncrementalHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 21 mSDtfsCounter, 856 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=4, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 100 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 303 SizeOfPredicates, 5 NumberOfNonLiveVariables, 530 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 23/58 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 272 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 783.4s, OverallIterations: 20, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 589.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 262 mSolverCounterUnknown, 11047 SdHoareTripleChecker+Valid, 185.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10615 mSDsluCounter, 1930 SdHoareTripleChecker+Invalid, 182.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8163 IncrementalHoareTripleChecker+Unchecked, 1842 mSDsCounter, 1298 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26114 IncrementalHoareTripleChecker+Invalid, 35837 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1298 mSolverCounterUnsat, 88 mSDtfsCounter, 26114 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1197 GetRequests, 714 SyntacticMatches, 13 SemanticMatches, 470 ConstructedPredicates, 17 IntricatePredicates, 3 DeprecatedPredicates, 3022 ImplicationChecksByTransitivity, 222.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21276occurred in iteration=19, InterpolantAutomatonStates: 298, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 184.5s InterpolantComputationTime, 934 NumberOfCodeBlocks, 914 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1311 ConstructedInterpolants, 366 QuantifiedInterpolants, 24315 SizeOfPredicates, 121 NumberOfNonLiveVariables, 3788 ConjunctsInSsa, 490 ConjunctsInUnsatCore, 54 InterpolantComputations, 4 PerfectInterpolantSequences, 2310/2569 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 216 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 344 IncrementalHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 9 mSDtfsCounter, 344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 14/47 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown