/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/increased_bounds/pthread-deagle_circular_buffer_bad_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 04:46:42,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 04:46:42,534 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 04:46:42,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 04:46:42,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 04:46:42,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 04:46:42,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 04:46:42,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 04:46:42,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 04:46:42,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 04:46:42,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 04:46:42,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 04:46:42,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 04:46:42,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 04:46:42,574 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 04:46:42,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 04:46:42,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 04:46:42,575 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 04:46:42,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 04:46:42,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 04:46:42,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 04:46:42,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 04:46:42,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 04:46:42,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 04:46:42,576 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 04:46:42,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 04:46:42,576 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 04:46:42,577 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 04:46:42,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 04:46:42,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 04:46:42,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 04:46:42,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 04:46:42,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 04:46:42,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 04:46:42,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 04:46:42,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 04:46:42,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 04:46:42,579 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 04:46:42,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 04:46:42,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 04:46:42,579 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 04:46:42,579 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 04:46:42,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 04:46:42,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 04:46:42,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 04:46:42,789 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 04:46:42,790 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 04:46:42,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-deagle_circular_buffer_bad_bound2.i [2023-08-04 04:46:43,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 04:46:44,098 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 04:46:44,098 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-deagle_circular_buffer_bad_bound2.i [2023-08-04 04:46:44,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a987ce0db/cf29b48cb30b4a12ba9224bf4f8d1b4a/FLAGf0cbf0af6 [2023-08-04 04:46:44,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a987ce0db/cf29b48cb30b4a12ba9224bf4f8d1b4a [2023-08-04 04:46:44,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 04:46:44,131 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 04:46:44,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 04:46:44,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 04:46:44,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 04:46:44,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 04:46:44" (1/1) ... [2023-08-04 04:46:44,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e669be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:46:44, skipping insertion in model container [2023-08-04 04:46:44,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 04:46:44" (1/1) ... [2023-08-04 04:46:44,169 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 04:46:44,434 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-deagle_circular_buffer_bad_bound2.i[30440,30453] [2023-08-04 04:46:44,444 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-deagle_circular_buffer_bad_bound2.i[30895,30908] [2023-08-04 04:46:44,459 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 04:46:44,472 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 04:46:44,485 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [208] [2023-08-04 04:46:44,486 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [209] [2023-08-04 04:46:44,496 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-deagle_circular_buffer_bad_bound2.i[30440,30453] [2023-08-04 04:46:44,498 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-deagle_circular_buffer_bad_bound2.i[30895,30908] [2023-08-04 04:46:44,502 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 04:46:44,531 INFO L206 MainTranslator]: Completed translation [2023-08-04 04:46:44,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:46:44 WrapperNode [2023-08-04 04:46:44,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 04:46:44,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 04:46:44,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 04:46:44,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 04:46:44,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:46:44" (1/1) ... [2023-08-04 04:46:44,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:46:44" (1/1) ... [2023-08-04 04:46:44,573 INFO L138 Inliner]: procedures = 168, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2023-08-04 04:46:44,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 04:46:44,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 04:46:44,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 04:46:44,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 04:46:44,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:46:44" (1/1) ... [2023-08-04 04:46:44,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:46:44" (1/1) ... [2023-08-04 04:46:44,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:46:44" (1/1) ... [2023-08-04 04:46:44,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:46:44" (1/1) ... [2023-08-04 04:46:44,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:46:44" (1/1) ... [2023-08-04 04:46:44,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:46:44" (1/1) ... [2023-08-04 04:46:44,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:46:44" (1/1) ... [2023-08-04 04:46:44,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:46:44" (1/1) ... [2023-08-04 04:46:44,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 04:46:44,623 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 04:46:44,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 04:46:44,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 04:46:44,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:46:44" (1/1) ... [2023-08-04 04:46:44,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 04:46:44,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:46:44,658 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 04:46:44,673 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 04:46:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 04:46:44,699 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-04 04:46:44,699 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-04 04:46:44,699 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-04 04:46:44,700 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-04 04:46:44,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 04:46:44,700 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-04 04:46:44,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 04:46:44,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 04:46:44,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 04:46:44,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-08-04 04:46:44,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 04:46:44,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 04:46:44,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 04:46:44,702 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 04:46:44,836 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 04:46:44,837 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 04:46:45,056 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 04:46:45,063 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 04:46:45,064 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-04 04:46:45,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 04:46:45 BoogieIcfgContainer [2023-08-04 04:46:45,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 04:46:45,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 04:46:45,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 04:46:45,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 04:46:45,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 04:46:44" (1/3) ... [2023-08-04 04:46:45,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368517f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 04:46:45, skipping insertion in model container [2023-08-04 04:46:45,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:46:44" (2/3) ... [2023-08-04 04:46:45,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368517f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 04:46:45, skipping insertion in model container [2023-08-04 04:46:45,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 04:46:45" (3/3) ... [2023-08-04 04:46:45,072 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-deagle_circular_buffer_bad_bound2.i [2023-08-04 04:46:45,083 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 04:46:45,090 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 04:46:45,090 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 04:46:45,090 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 04:46:45,196 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 04:46:45,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 170 transitions, 362 flow [2023-08-04 04:46:45,283 INFO L124 PetriNetUnfolderBase]: 37/311 cut-off events. [2023-08-04 04:46:45,283 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 04:46:45,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 311 events. 37/311 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1214 event pairs, 0 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 158. Up to 8 conditions per place. [2023-08-04 04:46:45,288 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 170 transitions, 362 flow [2023-08-04 04:46:45,292 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 170 transitions, 362 flow [2023-08-04 04:46:45,294 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:46:45,300 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 170 transitions, 362 flow [2023-08-04 04:46:45,301 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 170 transitions, 362 flow [2023-08-04 04:46:45,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 170 transitions, 362 flow [2023-08-04 04:46:45,378 INFO L124 PetriNetUnfolderBase]: 37/311 cut-off events. [2023-08-04 04:46:45,378 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 04:46:45,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 311 events. 37/311 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1214 event pairs, 0 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 158. Up to 8 conditions per place. [2023-08-04 04:46:45,389 INFO L119 LiptonReduction]: Number of co-enabled transitions 9516 [2023-08-04 04:46:49,067 INFO L134 LiptonReduction]: Checked pairs total: 18703 [2023-08-04 04:46:49,067 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-08-04 04:46:49,085 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 04:46:49,090 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;@42492d9b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:46:49,091 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 04:46:49,098 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:46:49,098 INFO L124 PetriNetUnfolderBase]: 5/50 cut-off events. [2023-08-04 04:46:49,098 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 04:46:49,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:46:49,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:46:49,099 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:46:49,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:46:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash 929312096, now seen corresponding path program 1 times [2023-08-04 04:46:49,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:46:49,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144333948] [2023-08-04 04:46:49,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:46:49,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:46:49,232 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-04 04:46:49,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1157918362] [2023-08-04 04:46:49,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:46:49,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:46:49,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:46:49,257 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 04:46:49,265 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 04:46:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:46:49,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 04:46:49,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:46:49,401 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 04:46:49,402 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:46:49,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:46:49,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144333948] [2023-08-04 04:46:49,402 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-04 04:46:49,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157918362] [2023-08-04 04:46:49,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157918362] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:46:49,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:46:49,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:46:49,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394891851] [2023-08-04 04:46:49,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:46:49,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:46:49,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:46:49,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:46:49,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:46:49,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 309 [2023-08-04 04:46:49,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 50 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states 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:46:49,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:46:49,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 309 [2023-08-04 04:46:49,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:46:49,708 INFO L124 PetriNetUnfolderBase]: 1907/3111 cut-off events. [2023-08-04 04:46:49,708 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2023-08-04 04:46:49,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5944 conditions, 3111 events. 1907/3111 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16224 event pairs, 1379 based on Foata normal form. 0/2198 useless extension candidates. Maximal degree in co-relation 5432. Up to 2758 conditions per place. [2023-08-04 04:46:49,720 INFO L140 encePairwiseOnDemand]: 307/309 looper letters, 37 selfloop transitions, 1 changer transitions 3/49 dead transitions. [2023-08-04 04:46:49,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 200 flow [2023-08-04 04:46:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:46:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:46:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2023-08-04 04:46:49,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5264293419633226 [2023-08-04 04:46:49,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2023-08-04 04:46:49,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2023-08-04 04:46:49,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:46:49,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2023-08-04 04:46:49,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states 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:46:49,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 309.0) internal successors, (1236), 4 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:46:49,745 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 309.0) internal successors, (1236), 4 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:46:49,746 INFO L175 Difference]: Start difference. First operand has 45 places, 50 transitions, 122 flow. Second operand 3 states and 488 transitions. [2023-08-04 04:46:49,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 200 flow [2023-08-04 04:46:49,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:46:49,751 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 108 flow [2023-08-04 04:46:49,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2023-08-04 04:46:49,755 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-08-04 04:46:49,755 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 108 flow [2023-08-04 04:46:49,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states 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:46:49,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:46:49,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:46:49,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 04:46:49,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-08-04 04:46:49,963 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:46:49,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:46:49,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1144555117, now seen corresponding path program 1 times [2023-08-04 04:46:49,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:46:49,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178692742] [2023-08-04 04:46:49,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:46:49,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:46:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:46:50,076 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 04:46:50,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:46:50,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178692742] [2023-08-04 04:46:50,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178692742] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:46:50,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:46:50,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:46:50,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140753287] [2023-08-04 04:46:50,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:46:50,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:46:50,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:46:50,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:46:50,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:46:50,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 309 [2023-08-04 04:46:50,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states 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:46:50,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:46:50,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 309 [2023-08-04 04:46:50,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:46:50,268 INFO L124 PetriNetUnfolderBase]: 1781/2869 cut-off events. [2023-08-04 04:46:50,269 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-08-04 04:46:50,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5519 conditions, 2869 events. 1781/2869 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 14806 event pairs, 616 based on Foata normal form. 0/2027 useless extension candidates. Maximal degree in co-relation 5511. Up to 2579 conditions per place. [2023-08-04 04:46:50,279 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 48 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-04 04:46:50,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 232 flow [2023-08-04 04:46:50,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:46:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:46:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2023-08-04 04:46:50,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.540453074433657 [2023-08-04 04:46:50,281 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2023-08-04 04:46:50,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2023-08-04 04:46:50,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:46:50,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2023-08-04 04:46:50,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states 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:46:50,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 309.0) internal successors, (1236), 4 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:46:50,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 309.0) internal successors, (1236), 4 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:46:50,285 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 108 flow. Second operand 3 states and 501 transitions. [2023-08-04 04:46:50,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 232 flow [2023-08-04 04:46:50,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 04:46:50,286 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 112 flow [2023-08-04 04:46:50,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=112, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2023-08-04 04:46:50,287 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-08-04 04:46:50,287 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 112 flow [2023-08-04 04:46:50,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states 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:46:50,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:46:50,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:46:50,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 04:46:50,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:46:50,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:46:50,288 INFO L85 PathProgramCache]: Analyzing trace with hash 225366710, now seen corresponding path program 1 times [2023-08-04 04:46:50,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:46:50,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560783282] [2023-08-04 04:46:50,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:46:50,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:46:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:46:50,386 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 04:46:50,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:46:50,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560783282] [2023-08-04 04:46:50,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560783282] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:46:50,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603708436] [2023-08-04 04:46:50,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:46:50,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:46:50,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:46:50,401 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 04:46:50,429 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 04:46:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:46:50,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 04:46:50,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:46:50,520 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 04:46:50,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:46:50,531 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 04:46:50,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603708436] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:46:50,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:46:50,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 04:46:50,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290745460] [2023-08-04 04:46:50,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:46:50,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:46:50,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:46:50,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:46:50,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:46:50,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 309 [2023-08-04 04:46:50,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 152.2) internal successors, (761), 5 states have internal predecessors, (761), 0 states have call successors, (0), 0 states 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:46:50,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:46:50,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 309 [2023-08-04 04:46:50,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:46:50,576 INFO L124 PetriNetUnfolderBase]: 25/58 cut-off events. [2023-08-04 04:46:50,576 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 04:46:50,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 58 events. 25/58 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 170 event pairs, 0 based on Foata normal form. 10/59 useless extension candidates. Maximal degree in co-relation 137. Up to 42 conditions per place. [2023-08-04 04:46:50,577 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 0 selfloop transitions, 0 changer transitions 29/29 dead transitions. [2023-08-04 04:46:50,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 29 transitions, 121 flow [2023-08-04 04:46:50,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:46:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:46:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 624 transitions. [2023-08-04 04:46:50,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048543689320388 [2023-08-04 04:46:50,578 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 624 transitions. [2023-08-04 04:46:50,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 624 transitions. [2023-08-04 04:46:50,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:46:50,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 624 transitions. [2023-08-04 04:46:50,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states 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:46:50,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 309.0) internal successors, (1545), 5 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states 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:46:50,582 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 309.0) internal successors, (1545), 5 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states 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:46:50,582 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 112 flow. Second operand 4 states and 624 transitions. [2023-08-04 04:46:50,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 29 transitions, 121 flow [2023-08-04 04:46:50,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 29 transitions, 115 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 04:46:50,582 INFO L231 Difference]: Finished difference. Result has 21 places, 0 transitions, 0 flow [2023-08-04 04:46:50,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=37, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=21, PETRI_TRANSITIONS=0} [2023-08-04 04:46:50,583 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -24 predicate places. [2023-08-04 04:46:50,583 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 0 transitions, 0 flow [2023-08-04 04:46:50,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 152.2) internal successors, (761), 5 states have internal predecessors, (761), 0 states have call successors, (0), 0 states 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:46:50,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 04:46:50,590 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 04:46:50,591 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 04:46:50,591 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 04:46:50,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-04 04:46:50,809 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 04:46:50,810 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 04:46:50,812 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-04 04:46:50,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 170 transitions, 362 flow [2023-08-04 04:46:50,840 INFO L124 PetriNetUnfolderBase]: 37/311 cut-off events. [2023-08-04 04:46:50,840 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 04:46:50,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 311 events. 37/311 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1214 event pairs, 0 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 158. Up to 8 conditions per place. [2023-08-04 04:46:50,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 170 transitions, 362 flow [2023-08-04 04:46:50,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 170 transitions, 362 flow [2023-08-04 04:46:50,844 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:46:50,844 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 170 transitions, 362 flow [2023-08-04 04:46:50,845 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 170 transitions, 362 flow [2023-08-04 04:46:50,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 170 transitions, 362 flow [2023-08-04 04:46:50,862 INFO L124 PetriNetUnfolderBase]: 37/311 cut-off events. [2023-08-04 04:46:50,862 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 04:46:50,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 311 events. 37/311 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1214 event pairs, 0 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 158. Up to 8 conditions per place. [2023-08-04 04:46:50,867 INFO L119 LiptonReduction]: Number of co-enabled transitions 9516 [2023-08-04 04:46:54,595 INFO L134 LiptonReduction]: Checked pairs total: 18093 [2023-08-04 04:46:54,595 INFO L136 LiptonReduction]: Total number of compositions: 138 [2023-08-04 04:46:54,597 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 04:46:54,598 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;@42492d9b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:46:54,598 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 04:46:54,605 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:46:54,605 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2023-08-04 04:46:54,605 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:46:54,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:46:54,605 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 04:46:54,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 04:46:54,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:46:54,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2030090861, now seen corresponding path program 1 times [2023-08-04 04:46:54,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:46:54,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261437437] [2023-08-04 04:46:54,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:46:54,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:46:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 04:46:54,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 04:46:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 04:46:54,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 04:46:54,679 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 04:46:54,679 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 04:46:54,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 04:46:54,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 04:46:54,680 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 04:46:54,680 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 04:46:54,681 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 04:46:54,681 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 04:46:54,707 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 04:46:54,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 250 transitions, 548 flow [2023-08-04 04:46:54,810 INFO L124 PetriNetUnfolderBase]: 141/916 cut-off events. [2023-08-04 04:46:54,811 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 04:46:54,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 916 events. 141/916 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5166 event pairs, 1 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 565. Up to 32 conditions per place. [2023-08-04 04:46:54,819 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 250 transitions, 548 flow [2023-08-04 04:46:54,824 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 250 transitions, 548 flow [2023-08-04 04:46:54,824 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:46:54,824 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 250 transitions, 548 flow [2023-08-04 04:46:54,825 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 227 places, 250 transitions, 548 flow [2023-08-04 04:46:54,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 250 transitions, 548 flow [2023-08-04 04:46:54,928 INFO L124 PetriNetUnfolderBase]: 141/916 cut-off events. [2023-08-04 04:46:54,928 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 04:46:54,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 916 events. 141/916 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5166 event pairs, 1 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 565. Up to 32 conditions per place. [2023-08-04 04:46:54,957 INFO L119 LiptonReduction]: Number of co-enabled transitions 31460 [2023-08-04 04:46:58,341 INFO L134 LiptonReduction]: Checked pairs total: 101951 [2023-08-04 04:46:58,341 INFO L136 LiptonReduction]: Total number of compositions: 194 [2023-08-04 04:46:58,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 04:46:58,343 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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;@42492d9b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:46:58,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-04 04:46:58,350 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:46:58,350 INFO L124 PetriNetUnfolderBase]: 4/57 cut-off events. [2023-08-04 04:46:58,350 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-04 04:46:58,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:46:58,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:46:58,350 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:46:58,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:46:58,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1736845051, now seen corresponding path program 1 times [2023-08-04 04:46:58,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:46:58,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771769817] [2023-08-04 04:46:58,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:46:58,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:46:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:46:58,400 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 04:46:58,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:46:58,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771769817] [2023-08-04 04:46:58,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771769817] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:46:58,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:46:58,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:46:58,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043436004] [2023-08-04 04:46:58,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:46:58,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:46:58,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:46:58,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:46:58,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:46:58,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 444 [2023-08-04 04:46:58,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 95 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states 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:46:58,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:46:58,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 444 [2023-08-04 04:46:58,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:47:40,864 INFO L124 PetriNetUnfolderBase]: 580583/772698 cut-off events. [2023-08-04 04:47:40,864 INFO L125 PetriNetUnfolderBase]: For 33030/33030 co-relation queries the response was YES. [2023-08-04 04:47:42,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495717 conditions, 772698 events. 580583/772698 cut-off events. For 33030/33030 co-relation queries the response was YES. Maximal size of possible extension queue 24878. Compared 5855352 event pairs, 358805 based on Foata normal form. 24467/559372 useless extension candidates. Maximal degree in co-relation 178714. Up to 705243 conditions per place. [2023-08-04 04:47:45,943 INFO L140 encePairwiseOnDemand]: 439/444 looper letters, 83 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2023-08-04 04:47:45,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 107 transitions, 432 flow [2023-08-04 04:47:45,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:47:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:47:45,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 743 transitions. [2023-08-04 04:47:45,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5578078078078078 [2023-08-04 04:47:45,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 743 transitions. [2023-08-04 04:47:45,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 743 transitions. [2023-08-04 04:47:45,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:47:45,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 743 transitions. [2023-08-04 04:47:45,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 states 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:47:45,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 444.0) internal successors, (1776), 4 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states 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:47:45,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 444.0) internal successors, (1776), 4 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states 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:47:45,953 INFO L175 Difference]: Start difference. First operand has 82 places, 95 transitions, 238 flow. Second operand 3 states and 743 transitions. [2023-08-04 04:47:45,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 107 transitions, 432 flow [2023-08-04 04:47:45,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 107 transitions, 432 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:47:45,964 INFO L231 Difference]: Finished difference. Result has 85 places, 94 transitions, 246 flow [2023-08-04 04:47:45,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=444, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=85, PETRI_TRANSITIONS=94} [2023-08-04 04:47:45,965 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 3 predicate places. [2023-08-04 04:47:45,965 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 94 transitions, 246 flow [2023-08-04 04:47:45,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states 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:47:45,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:47:45,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:47:45,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 04:47:45,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:47:45,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:47:45,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1317124164, now seen corresponding path program 1 times [2023-08-04 04:47:45,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:47:45,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837707925] [2023-08-04 04:47:45,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:47:45,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:47:45,975 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-04 04:47:45,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440065550] [2023-08-04 04:47:45,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:47:45,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:47:45,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:47:45,976 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 04:47:45,984 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 04:47:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:47:46,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 04:47:46,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:47:46,226 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 04:47:46,226 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:47:46,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:47:46,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837707925] [2023-08-04 04:47:46,227 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-04 04:47:46,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440065550] [2023-08-04 04:47:46,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440065550] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:47:46,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:47:46,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 04:47:46,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56723736] [2023-08-04 04:47:46,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:47:46,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 04:47:46,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:47:46,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 04:47:46,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 04:47:48,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-08-04 04:47:50,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-08-04 04:47:53,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-08-04 04:47:55,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-08-04 04:47:55,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 444 [2023-08-04 04:47:55,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 94 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 212.25) internal successors, (849), 4 states have internal predecessors, (849), 0 states have call successors, (0), 0 states 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:47:55,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:47:55,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 444 [2023-08-04 04:47:55,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:48:47,131 INFO L124 PetriNetUnfolderBase]: 630773/838229 cut-off events. [2023-08-04 04:48:47,132 INFO L125 PetriNetUnfolderBase]: For 35494/35494 co-relation queries the response was YES. [2023-08-04 04:48:49,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1625732 conditions, 838229 events. 630773/838229 cut-off events. For 35494/35494 co-relation queries the response was YES. Maximal size of possible extension queue 22461. Compared 6219020 event pairs, 497962 based on Foata normal form. 0/597457 useless extension candidates. Maximal degree in co-relation 1625643. Up to 768140 conditions per place. [2023-08-04 04:48:53,033 INFO L140 encePairwiseOnDemand]: 441/444 looper letters, 72 selfloop transitions, 1 changer transitions 1/92 dead transitions. [2023-08-04 04:48:53,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 388 flow [2023-08-04 04:48:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:48:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:48:53,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2023-08-04 04:48:53,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285285285285285 [2023-08-04 04:48:53,035 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2023-08-04 04:48:53,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2023-08-04 04:48:53,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:48:53,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2023-08-04 04:48:53,037 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 04:48:53,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 444.0) internal successors, (1776), 4 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states 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:48:53,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 444.0) internal successors, (1776), 4 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states 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:48:53,039 INFO L175 Difference]: Start difference. First operand has 85 places, 94 transitions, 246 flow. Second operand 3 states and 704 transitions. [2023-08-04 04:48:53,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 92 transitions, 388 flow [2023-08-04 04:48:53,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:48:53,052 INFO L231 Difference]: Finished difference. Result has 84 places, 91 transitions, 236 flow [2023-08-04 04:48:53,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=444, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=84, PETRI_TRANSITIONS=91} [2023-08-04 04:48:53,053 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 2 predicate places. [2023-08-04 04:48:53,053 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 91 transitions, 236 flow [2023-08-04 04:48:53,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 212.25) internal successors, (849), 4 states have internal predecessors, (849), 0 states have call successors, (0), 0 states 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:48:53,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:48:53,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:48:53,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-04 04:48:53,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:48:53,258 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:48:53,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:48:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash -431104798, now seen corresponding path program 1 times [2023-08-04 04:48:53,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:48:53,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788904459] [2023-08-04 04:48:53,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:48:53,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:48:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:48:53,313 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 04:48:53,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:48:53,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788904459] [2023-08-04 04:48:53,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788904459] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:48:53,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323616082] [2023-08-04 04:48:53,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:48:53,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:48:53,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:48:53,314 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 04:48:53,316 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 04:48:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:48:53,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 04:48:53,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:48:53,400 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 04:48:53,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:48:53,413 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 04:48:53,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323616082] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:48:53,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:48:53,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 04:48:53,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132039586] [2023-08-04 04:48:53,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:48:53,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:48:53,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:48:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:48:53,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:48:53,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 444 [2023-08-04 04:48:53,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 91 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 220.2) internal successors, (1101), 5 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states 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:48:53,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:48:53,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 444 [2023-08-04 04:48:53,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:49:28,091 INFO L124 PetriNetUnfolderBase]: 470971/624107 cut-off events. [2023-08-04 04:49:28,092 INFO L125 PetriNetUnfolderBase]: For 28060/28060 co-relation queries the response was YES. [2023-08-04 04:49:29,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1212305 conditions, 624107 events. 470971/624107 cut-off events. For 28060/28060 co-relation queries the response was YES. Maximal size of possible extension queue 18609. Compared 4504008 event pairs, 179072 based on Foata normal form. 10/436750 useless extension candidates. Maximal degree in co-relation 1212293. Up to 572579 conditions per place. [2023-08-04 04:49:32,026 INFO L140 encePairwiseOnDemand]: 440/444 looper letters, 100 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2023-08-04 04:49:32,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 125 transitions, 512 flow [2023-08-04 04:49:32,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:49:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:49:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 973 transitions. [2023-08-04 04:49:32,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5478603603603603 [2023-08-04 04:49:32,028 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 973 transitions. [2023-08-04 04:49:32,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 973 transitions. [2023-08-04 04:49:32,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:49:32,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 973 transitions. [2023-08-04 04:49:32,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 243.25) internal successors, (973), 4 states have internal predecessors, (973), 0 states have call successors, (0), 0 states 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:49:32,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 444.0) internal successors, (2220), 5 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states 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:49:32,034 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 444.0) internal successors, (2220), 5 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states 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:49:32,034 INFO L175 Difference]: Start difference. First operand has 84 places, 91 transitions, 236 flow. Second operand 4 states and 973 transitions. [2023-08-04 04:49:32,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 125 transitions, 512 flow [2023-08-04 04:49:32,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 125 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 04:49:32,049 INFO L231 Difference]: Finished difference. Result has 86 places, 92 transitions, 252 flow [2023-08-04 04:49:32,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=444, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=86, PETRI_TRANSITIONS=92} [2023-08-04 04:49:32,050 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 4 predicate places. [2023-08-04 04:49:32,050 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 92 transitions, 252 flow [2023-08-04 04:49:32,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 220.2) internal successors, (1101), 5 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states 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:49:32,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:49:32,051 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:49:32,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 04:49:32,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:49:32,255 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:49:32,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:49:32,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1104083466, now seen corresponding path program 1 times [2023-08-04 04:49:32,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:49:32,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485311409] [2023-08-04 04:49:32,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:49:32,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:49:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:49:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 04:49:32,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:49:32,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485311409] [2023-08-04 04:49:32,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485311409] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:49:32,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:49:32,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:49:32,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279255356] [2023-08-04 04:49:32,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:49:32,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:49:32,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:49:32,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:49:32,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:49:32,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 444 [2023-08-04 04:49:32,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 92 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states 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:49:32,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:49:32,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 444 [2023-08-04 04:49:32,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:50:42,625 INFO L124 PetriNetUnfolderBase]: 826195/1099871 cut-off events. [2023-08-04 04:50:42,626 INFO L125 PetriNetUnfolderBase]: For 45431/45431 co-relation queries the response was YES. [2023-08-04 04:50:46,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2152187 conditions, 1099871 events. 826195/1099871 cut-off events. For 45431/45431 co-relation queries the response was YES. Maximal size of possible extension queue 20532. Compared 8305818 event pairs, 284697 based on Foata normal form. 0/789902 useless extension candidates. Maximal degree in co-relation 2152172. Up to 592479 conditions per place. [2023-08-04 04:50:50,093 INFO L140 encePairwiseOnDemand]: 437/444 looper letters, 135 selfloop transitions, 5 changer transitions 2/161 dead transitions. [2023-08-04 04:50:50,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 161 transitions, 729 flow [2023-08-04 04:50:50,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:50:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:50:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2023-08-04 04:50:50,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5870870870870871 [2023-08-04 04:50:50,096 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 782 transitions. [2023-08-04 04:50:50,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 782 transitions. [2023-08-04 04:50:50,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:50:50,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 782 transitions. [2023-08-04 04:50:50,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:50:50,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 444.0) internal successors, (1776), 4 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states 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:50:50,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 444.0) internal successors, (1776), 4 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states 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:50:50,100 INFO L175 Difference]: Start difference. First operand has 86 places, 92 transitions, 252 flow. Second operand 3 states and 782 transitions. [2023-08-04 04:50:50,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 161 transitions, 729 flow [2023-08-04 04:50:50,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 161 transitions, 722 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-04 04:50:50,114 INFO L231 Difference]: Finished difference. Result has 89 places, 95 transitions, 282 flow [2023-08-04 04:50:50,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=444, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=89, PETRI_TRANSITIONS=95} [2023-08-04 04:50:50,115 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 7 predicate places. [2023-08-04 04:50:50,115 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 95 transitions, 282 flow [2023-08-04 04:50:50,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states 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:50:50,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:50:50,115 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:50:50,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 04:50:50,115 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:50:50,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:50:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash 210848292, now seen corresponding path program 1 times [2023-08-04 04:50:50,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:50:50,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945033331] [2023-08-04 04:50:50,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:50:50,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:50:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:50:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:50:50,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:50:50,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945033331] [2023-08-04 04:50:50,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945033331] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:50:50,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:50:50,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 04:50:50,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645890034] [2023-08-04 04:50:50,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:50:50,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:50:50,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:50:50,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:50:50,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:50:50,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 444 [2023-08-04 04:50:50,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 95 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states 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:50:50,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:50:50,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 444 [2023-08-04 04:50:50,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:51:01,568 INFO L124 PetriNetUnfolderBase]: 162683/230201 cut-off events. [2023-08-04 04:51:01,569 INFO L125 PetriNetUnfolderBase]: For 25953/25953 co-relation queries the response was YES. [2023-08-04 04:51:02,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463552 conditions, 230201 events. 162683/230201 cut-off events. For 25953/25953 co-relation queries the response was YES. Maximal size of possible extension queue 5247. Compared 1741623 event pairs, 22994 based on Foata normal form. 0/195344 useless extension candidates. Maximal degree in co-relation 463534. Up to 169002 conditions per place. [2023-08-04 04:51:02,878 INFO L140 encePairwiseOnDemand]: 436/444 looper letters, 102 selfloop transitions, 8 changer transitions 0/129 dead transitions. [2023-08-04 04:51:02,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 129 transitions, 614 flow [2023-08-04 04:51:02,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:51:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:51:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2023-08-04 04:51:02,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5615615615615616 [2023-08-04 04:51:02,881 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 748 transitions. [2023-08-04 04:51:02,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 748 transitions. [2023-08-04 04:51:02,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:51:02,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 748 transitions. [2023-08-04 04:51:02,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states 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:51:02,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 444.0) internal successors, (1776), 4 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states 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:51:02,884 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 444.0) internal successors, (1776), 4 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states 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:51:02,884 INFO L175 Difference]: Start difference. First operand has 89 places, 95 transitions, 282 flow. Second operand 3 states and 748 transitions. [2023-08-04 04:51:02,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 129 transitions, 614 flow [2023-08-04 04:51:03,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 129 transitions, 595 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 04:51:03,138 INFO L231 Difference]: Finished difference. Result has 87 places, 93 transitions, 275 flow [2023-08-04 04:51:03,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=444, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=275, PETRI_PLACES=87, PETRI_TRANSITIONS=93} [2023-08-04 04:51:03,139 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 5 predicate places. [2023-08-04 04:51:03,139 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 93 transitions, 275 flow [2023-08-04 04:51:03,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states 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:51:03,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:51:03,140 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:51:03,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 04:51:03,140 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:51:03,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:51:03,140 INFO L85 PathProgramCache]: Analyzing trace with hash 729025460, now seen corresponding path program 1 times [2023-08-04 04:51:03,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:51:03,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145170223] [2023-08-04 04:51:03,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:51:03,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:51:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:51:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:51:03,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:51:03,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145170223] [2023-08-04 04:51:03,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145170223] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:51:03,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:51:03,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:51:03,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764307735] [2023-08-04 04:51:03,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:51:03,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:51:03,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:51:03,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:51:03,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:51:03,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 444 [2023-08-04 04:51:03,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 93 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states 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:51:03,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:51:03,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 444 [2023-08-04 04:51:03,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:51:19,519 INFO L124 PetriNetUnfolderBase]: 201595/284717 cut-off events. [2023-08-04 04:51:19,519 INFO L125 PetriNetUnfolderBase]: For 34350/34350 co-relation queries the response was YES. [2023-08-04 04:51:20,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585159 conditions, 284717 events. 201595/284717 cut-off events. For 34350/34350 co-relation queries the response was YES. Maximal size of possible extension queue 5459. Compared 2116038 event pairs, 51898 based on Foata normal form. 0/251769 useless extension candidates. Maximal degree in co-relation 585144. Up to 198571 conditions per place. [2023-08-04 04:51:21,338 INFO L140 encePairwiseOnDemand]: 439/444 looper letters, 119 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2023-08-04 04:51:21,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 143 transitions, 671 flow [2023-08-04 04:51:21,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:51:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:51:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2023-08-04 04:51:21,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5690690690690691 [2023-08-04 04:51:21,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 758 transitions. [2023-08-04 04:51:21,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 758 transitions. [2023-08-04 04:51:21,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:51:21,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 758 transitions. [2023-08-04 04:51:21,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 252.66666666666666) internal successors, (758), 3 states have internal predecessors, (758), 0 states have call successors, (0), 0 states 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:51:21,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 444.0) internal successors, (1776), 4 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states 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:51:21,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 444.0) internal successors, (1776), 4 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states 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:51:21,359 INFO L175 Difference]: Start difference. First operand has 87 places, 93 transitions, 275 flow. Second operand 3 states and 758 transitions. [2023-08-04 04:51:21,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 143 transitions, 671 flow [2023-08-04 04:51:21,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 143 transitions, 659 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:51:21,439 INFO L231 Difference]: Finished difference. Result has 89 places, 95 transitions, 288 flow [2023-08-04 04:51:21,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=444, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=89, PETRI_TRANSITIONS=95} [2023-08-04 04:51:21,440 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 7 predicate places. [2023-08-04 04:51:21,440 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 95 transitions, 288 flow [2023-08-04 04:51:21,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states 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:51:21,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:51:21,440 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:51:21,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 04:51:21,440 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:51:21,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:51:21,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1090886330, now seen corresponding path program 1 times [2023-08-04 04:51:21,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:51:21,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262928892] [2023-08-04 04:51:21,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:51:21,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:51:21,452 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-04 04:51:21,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1708088634] [2023-08-04 04:51:21,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:51:21,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:51:21,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:51:21,455 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 04:51:21,485 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 04:51:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:51:21,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-04 04:51:21,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:51:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 04:51:21,837 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:51:21,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:51:21,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262928892] [2023-08-04 04:51:21,837 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-04 04:51:21,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708088634] [2023-08-04 04:51:21,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708088634] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:51:21,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:51:21,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 04:51:21,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261896973] [2023-08-04 04:51:21,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:51:21,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 04:51:21,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:51:21,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 04:51:21,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 04:51:21,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 444 [2023-08-04 04:51:21,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 95 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:51:21,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:51:21,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 444 [2023-08-04 04:51:21,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:51:43,074 INFO L124 PetriNetUnfolderBase]: 268437/380943 cut-off events. [2023-08-04 04:51:43,074 INFO L125 PetriNetUnfolderBase]: For 54946/54946 co-relation queries the response was YES. [2023-08-04 04:51:44,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 780515 conditions, 380943 events. 268437/380943 cut-off events. For 54946/54946 co-relation queries the response was YES. Maximal size of possible extension queue 6221. Compared 2898048 event pairs, 51842 based on Foata normal form. 2009/344634 useless extension candidates. Maximal degree in co-relation 780497. Up to 202610 conditions per place. [2023-08-04 04:51:45,317 INFO L140 encePairwiseOnDemand]: 435/444 looper letters, 175 selfloop transitions, 7 changer transitions 0/202 dead transitions. [2023-08-04 04:51:45,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 202 transitions, 970 flow [2023-08-04 04:51:45,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:51:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:51:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1003 transitions. [2023-08-04 04:51:45,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5647522522522522 [2023-08-04 04:51:45,320 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1003 transitions. [2023-08-04 04:51:45,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1003 transitions. [2023-08-04 04:51:45,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:51:45,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1003 transitions. [2023-08-04 04:51:45,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 250.75) internal successors, (1003), 4 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states 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:51:45,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 444.0) internal successors, (2220), 5 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states 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:51:45,323 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 444.0) internal successors, (2220), 5 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states 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:51:45,323 INFO L175 Difference]: Start difference. First operand has 89 places, 95 transitions, 288 flow. Second operand 4 states and 1003 transitions. [2023-08-04 04:51:45,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 202 transitions, 970 flow [2023-08-04 04:51:45,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 202 transitions, 967 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:51:45,340 INFO L231 Difference]: Finished difference. Result has 92 places, 99 transitions, 333 flow [2023-08-04 04:51:45,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=444, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=333, PETRI_PLACES=92, PETRI_TRANSITIONS=99} [2023-08-04 04:51:45,341 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 10 predicate places. [2023-08-04 04:51:45,341 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 99 transitions, 333 flow [2023-08-04 04:51:45,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:51:45,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:51:45,342 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:51:45,350 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 04:51:45,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-04 04:51:45,547 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:51:45,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:51:45,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1471990900, now seen corresponding path program 1 times [2023-08-04 04:51:45,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:51:45,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418697219] [2023-08-04 04:51:45,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:51:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:51:45,559 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-04 04:51:45,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153881298] [2023-08-04 04:51:45,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:51:45,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:51:45,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:51:45,595 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 04:51:45,595 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 04:51:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:51:45,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-04 04:51:45,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:51:45,909 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-04 04:51:45,910 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-04 04:51:45,921 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:51:45,937 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:51:45,965 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:51:46,038 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:46,077 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 51 treesize of output 44 [2023-08-04 04:51:46,217 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 56 treesize of output 50 [2023-08-04 04:51:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:51:46,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:52:58,398 WARN L233 SmtUtils]: Spent 41.31s on a formula simplification. DAG size of input: 121 DAG size of output: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:53:20,748 WARN L233 SmtUtils]: Spent 14.17s on a formula simplification. DAG size of input: 66 DAG size of output: 41 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:53:22,841 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_t1Thread1of2ForFork0_insertLogElement_~b#1| 256))) (and (forall ((v_z_18 Int) (v_ArrVal_475 (Array Int Int))) (or (<= 4294967296 v_z_18) (forall ((v_z_15 Int) (|~#buffer~0.offset| Int)) (or (< v_z_15 1) (< 2147483648 v_z_15) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_475) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| v_z_18 (- 4294967296)) .cse0) (+ |~#buffer~0.offset| (- 1) v_z_15)) 0))) (<= v_z_18 2147483647))) (forall ((v_z_18 Int) (v_ArrVal_475 (Array Int Int))) (or (<= 4294967296 v_z_18) (forall ((v_z_13 Int) (|~#buffer~0.offset| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_475) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| v_z_18 (- 4294967296)) .cse0) (+ |~#buffer~0.offset| v_z_13 (- 4294967297))) 0) (<= 4294967296 v_z_13) (<= v_z_13 2147483648))) (<= v_z_18 2147483647))))) is different from false [2023-08-04 04:53:22,964 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_t1Thread1of2ForFork0_insertLogElement_#in~b#1| 256))) (and (forall ((v_z_18 Int) (v_ArrVal_475 (Array Int Int))) (or (<= 4294967296 v_z_18) (forall ((v_z_15 Int) (|~#buffer~0.offset| Int)) (or (< v_z_15 1) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_475) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| v_z_18 (- 4294967296)) .cse0) (+ |~#buffer~0.offset| (- 1) v_z_15)) 0) (< 2147483648 v_z_15))) (<= v_z_18 2147483647))) (forall ((v_z_18 Int) (v_ArrVal_475 (Array Int Int))) (or (<= 4294967296 v_z_18) (forall ((v_z_13 Int) (|~#buffer~0.offset| Int)) (or (<= 4294967296 v_z_13) (<= v_z_13 2147483648) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_475) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| v_z_18 (- 4294967296)) .cse0) (+ |~#buffer~0.offset| v_z_13 (- 4294967297))) 0))) (<= v_z_18 2147483647))))) is different from false [2023-08-04 04:53:25,132 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_t1Thread1of2ForFork0_~i~0#1| 256))) (and (forall ((v_z_18 Int) (v_ArrVal_475 (Array Int Int))) (or (forall ((v_z_13 Int) (|~#buffer~0.offset| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_475) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| v_z_18 (- 4294967296)) .cse0) (+ |~#buffer~0.offset| v_z_13 (- 4294967297))) 0) (<= 4294967296 v_z_13) (<= v_z_13 2147483648))) (<= 4294967296 v_z_18) (<= v_z_18 2147483647))) (forall ((v_z_18 Int) (v_ArrVal_475 (Array Int Int))) (or (forall ((v_z_15 Int) (|~#buffer~0.offset| Int)) (or (< v_z_15 1) (< 2147483648 v_z_15) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_475) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| v_z_18 (- 4294967296)) .cse0) (+ |~#buffer~0.offset| (- 1) v_z_15)) 0))) (<= 4294967296 v_z_18) (<= v_z_18 2147483647))))) is different from false [2023-08-04 04:53:25,205 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_18 Int) (v_ArrVal_475 (Array Int Int))) (or (<= 4294967296 v_z_18) (forall ((v_z_13 Int) (|~#buffer~0.offset| Int)) (or (<= 4294967296 v_z_13) (<= v_z_13 2147483648) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_475) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| v_z_18 (- 4294967296)) 0) (+ |~#buffer~0.offset| v_z_13 (- 4294967297))) 0))) (<= v_z_18 2147483647))) (forall ((v_z_18 Int) (v_ArrVal_475 (Array Int Int))) (or (<= 4294967296 v_z_18) (forall ((v_z_15 Int) (|~#buffer~0.offset| Int)) (or (< v_z_15 1) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_475) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| v_z_18 (- 4294967296)) 0) (+ |~#buffer~0.offset| (- 1) v_z_15)) 0) (< 2147483648 v_z_15))) (<= v_z_18 2147483647)))) is different from false [2023-08-04 04:53:25,244 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_18 Int) (v_ArrVal_474 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (or (forall ((v_z_15 Int) (|~#buffer~0.offset| Int)) (or (< v_z_15 1) (= (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_474) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_475) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| v_z_18 (- 4294967296)) 0) (+ |~#buffer~0.offset| (- 1) v_z_15)) 0) (< 2147483648 v_z_15))) (<= 4294967296 v_z_18) (<= v_z_18 2147483647))) (forall ((v_z_18 Int) (v_ArrVal_474 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (or (<= 4294967296 v_z_18) (forall ((v_z_13 Int) (|~#buffer~0.offset| Int)) (or (<= 4294967296 v_z_13) (= (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_474) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_475) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| v_z_18 (- 4294967296)) 0) (+ |~#buffer~0.offset| v_z_13 (- 4294967297))) 0) (<= v_z_13 2147483648))) (<= v_z_18 2147483647)))) is different from false [2023-08-04 04:53:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-04 04:53:25,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:53:25,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418697219] [2023-08-04 04:53:25,379 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-04 04:53:25,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153881298] [2023-08-04 04:53:25,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153881298] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:53:25,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-04 04:53:25,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2023-08-04 04:53:25,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069196574] [2023-08-04 04:53:25,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-04 04:53:25,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-04 04:53:25,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:53:25,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-04 04:53:25,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=21, NotChecked=150, Total=380 [2023-08-04 04:53:25,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 444 [2023-08-04 04:53:25,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 99 transitions, 333 flow. Second operand has 20 states, 20 states have (on average 175.4) internal successors, (3508), 20 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states 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:53:25,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:53:25,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 444 [2023-08-04 04:53:25,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:53:49,740 WARN L233 SmtUtils]: Spent 20.18s on a formula simplification. DAG size of input: 57 DAG size of output: 52 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:53:51,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:53:53,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:53:56,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:53:58,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:54:04,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:54:06,744 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:54:08,760 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:54:10,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:54:12,805 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:54:14,821 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:54:16,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:54:18,952 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:54:20,963 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:54:22,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:54:25,008 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:54:27,026 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:55:13,486 WARN L233 SmtUtils]: Spent 42.39s on a formula simplification. DAG size of input: 59 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:55:15,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:55:17,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:55:19,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:55:21,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:55:23,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:55:25,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:55:27,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:55:29,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:55:31,623 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 [0, 1] [2023-08-04 04:55:33,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:55:35,651 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:56:15,964 WARN L233 SmtUtils]: Spent 36.28s on a formula simplification. DAG size of input: 61 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:56:18,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:56:20,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:56:29,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:56:31,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:56:33,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:56:35,182 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:56:40,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:56:43,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:56:45,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:56:47,257 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:56:49,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:56:51,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:56:53,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:56:55,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:56:57,342 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:56:59,361 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:57:01,397 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:57:03,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:57:05,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:57:07,527 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:57:09,545 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 [0, 1] [2023-08-04 04:57:11,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:57:13,728 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:57:15,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:57:17,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:57:19,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:57:21,359 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 [0, 1] [2023-08-04 04:57:23,367 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:57:25,429 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:57:27,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:57:30,061 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:57:32,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:57:34,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:57:36,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:57:38,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:57:39,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:57:41,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:57:43,605 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:57:45,611 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:57:47,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:57:49,627 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:57:51,658 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:57:53,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:57:55,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:57:57,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:57:59,806 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:58:01,837 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:58:03,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:58:05,902 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:58:07,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:58:09,931 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:58:11,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:58:14,010 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:58:16,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:58:18,139 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:58:20,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:58:22,188 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:58:24,239 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:58:26,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 04:58:28,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:58:30,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:58:32,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:58:34,950 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:58:36,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:58:38,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:58:40,982 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:58:42,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:58:44,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:58:46,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:58:48,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:58:50,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:58:52,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:58:54,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:58:56,899 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:58:58,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:59:00,913 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:59:03,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:59:05,519 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:59:07,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:59:09,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:59:11,583 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:59:13,628 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:59:15,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:59:17,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-08-04 04:59:17,900 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:59:17,910 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 04:59:18,919 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 04:59:19,100 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-04 04:59:19,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-04 04:59:19,143 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-04 04:59:19,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-04 04:59:19,143 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-04 04:59:19,143 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-04 04:59:19,143 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-04 04:59:19,143 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-08-04 04:59:19,144 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-08-04 04:59:19,144 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-04 04:59:19,144 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:59:19,145 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-04 04:59:19,145 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 04:59:19,145 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 04:59:19,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 04:59:19 BasicIcfg [2023-08-04 04:59:19,148 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 04:59:19,149 INFO L158 Benchmark]: Toolchain (without parser) took 755017.33ms. Allocated memory was 358.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 313.5MB in the beginning and 10.7GB in the end (delta: -10.4GB). Peak memory consumption was 5.3GB. Max. memory is 16.0GB. [2023-08-04 04:59:19,149 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 358.6MB. Free memory is still 315.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 04:59:19,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.48ms. Allocated memory is still 358.6MB. Free memory was 313.1MB in the beginning and 292.6MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-04 04:59:19,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.96ms. Allocated memory is still 358.6MB. Free memory was 292.6MB in the beginning and 290.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 04:59:19,150 INFO L158 Benchmark]: Boogie Preprocessor took 48.34ms. Allocated memory is still 358.6MB. Free memory was 290.1MB in the beginning and 288.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 04:59:19,150 INFO L158 Benchmark]: RCFGBuilder took 442.89ms. Allocated memory is still 358.6MB. Free memory was 288.4MB in the beginning and 269.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-04 04:59:19,150 INFO L158 Benchmark]: TraceAbstraction took 754080.82ms. Allocated memory was 358.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 268.7MB in the beginning and 10.7GB in the end (delta: -10.4GB). Peak memory consumption was 5.2GB. Max. memory is 16.0GB. [2023-08-04 04:59:19,151 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 358.6MB. Free memory is still 315.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 399.48ms. Allocated memory is still 358.6MB. Free memory was 313.1MB in the beginning and 292.6MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 39.96ms. Allocated memory is still 358.6MB. Free memory was 292.6MB in the beginning and 290.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 48.34ms. Allocated memory is still 358.6MB. Free memory was 290.1MB in the beginning and 288.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 442.89ms. Allocated memory is still 358.6MB. Free memory was 288.4MB in the beginning and 269.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 754080.82ms. Allocated memory was 358.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 268.7MB in the beginning and 10.7GB in the end (delta: -10.4GB). Peak memory consumption was 5.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 208]: Unsoundness Warning unspecified type, defaulting to int C: short [208] - GenericResultAtLocation [Line: 209]: Unsoundness Warning unspecified type, defaulting to int C: short [209] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 157 PlacesBefore, 45 PlacesAfterwards, 170 TransitionsBefore, 50 TransitionsAfterwards, 9516 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 22 ConcurrentYvCompositions, 8 ChoiceCompositions, 139 TotalNumberOfCompositions, 18703 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12380, independent: 12094, independent conditional: 0, independent unconditional: 12094, dependent: 286, dependent conditional: 0, dependent unconditional: 286, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5160, independent: 5114, independent conditional: 0, independent unconditional: 5114, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12380, independent: 6980, independent conditional: 0, independent unconditional: 6980, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 5160, unknown conditional: 0, unknown unconditional: 5160] , Statistics on independence cache: Total cache size (in pairs): 446, Positive cache size: 427, Positive conditional cache size: 0, Positive unconditional cache size: 427, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 157 PlacesBefore, 44 PlacesAfterwards, 170 TransitionsBefore, 49 TransitionsAfterwards, 9516 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 21 ConcurrentYvCompositions, 8 ChoiceCompositions, 138 TotalNumberOfCompositions, 18093 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12081, independent: 11808, independent conditional: 0, independent unconditional: 11808, dependent: 273, dependent conditional: 0, dependent unconditional: 273, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5184, independent: 5140, independent conditional: 0, independent unconditional: 5140, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12081, independent: 6668, independent conditional: 0, independent unconditional: 6668, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 5184, unknown conditional: 0, unknown unconditional: 5184] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 401, Positive conditional cache size: 0, Positive unconditional cache size: 401, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 227 PlacesBefore, 82 PlacesAfterwards, 250 TransitionsBefore, 95 TransitionsAfterwards, 31460 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 111 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 10 ChoiceCompositions, 194 TotalNumberOfCompositions, 101951 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52962, independent: 52139, independent conditional: 0, independent unconditional: 52139, dependent: 823, dependent conditional: 0, dependent unconditional: 823, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 16412, independent: 16299, independent conditional: 0, independent unconditional: 16299, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 52962, independent: 35840, independent conditional: 0, independent unconditional: 35840, dependent: 710, dependent conditional: 0, dependent unconditional: 710, unknown: 16412, unknown conditional: 0, unknown unconditional: 16412] , Statistics on independence cache: Total cache size (in pairs): 1771, Positive cache size: 1719, Positive conditional cache size: 0, Positive unconditional cache size: 1719, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 746]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 713]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 219 locations, 6 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.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 141 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200 IncrementalHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 9 mSDtfsCounter, 200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 80 SizeOfPredicates, 0 NumberOfNonLiveVariables, 335 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 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 7 procedures, 285 locations, 8 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: 744.4s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 639.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 249 mSolverCounterUnknown, 689 SdHoareTripleChecker+Valid, 238.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 536 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 237.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 491 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1948 IncrementalHoareTripleChecker+Invalid, 2765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 29 mSDtfsCounter, 1948 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 223.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=7, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 100.1s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 198 ConstructedInterpolants, 41 QuantifiedInterpolants, 3169 SizeOfPredicates, 16 NumberOfNonLiveVariables, 847 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 26/39 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 5 procedures, 219 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.9s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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