/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 22:00:30,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 22:00:30,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 22:00:30,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 22:00:30,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 22:00:30,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 22:00:30,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 22:00:30,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 22:00:30,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 22:00:30,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 22:00:30,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 22:00:30,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 22:00:30,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 22:00:30,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 22:00:30,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 22:00:30,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 22:00:30,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 22:00:30,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 22:00:30,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 22:00:30,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 22:00:30,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 22:00:30,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 22:00:30,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 22:00:30,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 22:00:30,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 22:00:30,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 22:00:30,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 22:00:30,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 22:00:30,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 22:00:30,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 22:00:30,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 22:00:30,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 22:00:30,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 22:00:30,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 22:00:30,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 22:00:30,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 22:00:30,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 22:00:30,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 22:00:30,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 22:00:30,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 22:00:30,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 22:00:30,379 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 22:00:30,396 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 22:00:30,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 22:00:30,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 22:00:30,397 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 22:00:30,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 22:00:30,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 22:00:30,397 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 22:00:30,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 22:00:30,398 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 22:00:30,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 22:00:30,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 22:00:30,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 22:00:30,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 22:00:30,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 22:00:30,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 22:00:30,398 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 22:00:30,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 22:00:30,399 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 22:00:30,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 22:00:30,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 22:00:30,399 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 22:00:30,399 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 22:00:30,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 22:00:30,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 22:00:30,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 22:00:30,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 22:00:30,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 22:00:30,400 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 22:00:30,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 22:00:30,400 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 22:00:30,401 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 22:00:30,401 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-01-27 22:00:30,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 22:00:30,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 22:00:30,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 22:00:30,602 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 22:00:30,603 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 22:00:30,603 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2023-01-27 22:00:31,609 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 22:00:31,867 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 22:00:31,868 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2023-01-27 22:00:31,872 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b431ff320/fa265b5a6c7240eaafcb4cd49417dafa/FLAGfeab4c196 [2023-01-27 22:00:31,884 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b431ff320/fa265b5a6c7240eaafcb4cd49417dafa [2023-01-27 22:00:31,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 22:00:31,887 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 22:00:31,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 22:00:31,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 22:00:31,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 22:00:31,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 10:00:31" (1/1) ... [2023-01-27 22:00:31,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@490a5d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:00:31, skipping insertion in model container [2023-01-27 22:00:31,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 10:00:31" (1/1) ... [2023-01-27 22:00:31,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 22:00:31,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 22:00:32,035 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2023-01-27 22:00:32,041 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 22:00:32,048 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 22:00:32,064 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2023-01-27 22:00:32,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 22:00:32,073 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 22:00:32,073 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 22:00:32,078 INFO L208 MainTranslator]: Completed translation [2023-01-27 22:00:32,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:00:32 WrapperNode [2023-01-27 22:00:32,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 22:00:32,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 22:00:32,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 22:00:32,080 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 22:00:32,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:00:32" (1/1) ... [2023-01-27 22:00:32,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:00:32" (1/1) ... [2023-01-27 22:00:32,116 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 196 [2023-01-27 22:00:32,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 22:00:32,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 22:00:32,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 22:00:32,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 22:00:32,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:00:32" (1/1) ... [2023-01-27 22:00:32,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:00:32" (1/1) ... [2023-01-27 22:00:32,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:00:32" (1/1) ... [2023-01-27 22:00:32,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:00:32" (1/1) ... [2023-01-27 22:00:32,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:00:32" (1/1) ... [2023-01-27 22:00:32,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:00:32" (1/1) ... [2023-01-27 22:00:32,137 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:00:32" (1/1) ... [2023-01-27 22:00:32,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:00:32" (1/1) ... [2023-01-27 22:00:32,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 22:00:32,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 22:00:32,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 22:00:32,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 22:00:32,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:00:32" (1/1) ... [2023-01-27 22:00:32,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 22:00:32,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:00:32,182 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-01-27 22:00:32,198 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-01-27 22:00:32,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 22:00:32,219 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 22:00:32,220 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 22:00:32,220 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 22:00:32,221 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 22:00:32,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 22:00:32,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 22:00:32,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 22:00:32,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 22:00:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 22:00:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-27 22:00:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 22:00:32,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 22:00:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 22:00:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 22:00:32,226 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 22:00:32,304 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 22:00:32,305 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 22:00:32,658 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 22:00:32,735 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 22:00:32,735 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-27 22:00:32,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 10:00:32 BoogieIcfgContainer [2023-01-27 22:00:32,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 22:00:32,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 22:00:32,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 22:00:32,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 22:00:32,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 10:00:31" (1/3) ... [2023-01-27 22:00:32,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b2ff5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 10:00:32, skipping insertion in model container [2023-01-27 22:00:32,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:00:32" (2/3) ... [2023-01-27 22:00:32,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b2ff5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 10:00:32, skipping insertion in model container [2023-01-27 22:00:32,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 10:00:32" (3/3) ... [2023-01-27 22:00:32,746 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2023-01-27 22:00:32,762 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 22:00:32,763 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 22:00:32,763 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 22:00:32,849 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-27 22:00:32,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 178 transitions, 372 flow [2023-01-27 22:00:32,943 INFO L130 PetriNetUnfolder]: 15/176 cut-off events. [2023-01-27 22:00:32,943 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 22:00:32,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 176 events. 15/176 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2023-01-27 22:00:32,948 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 178 transitions, 372 flow [2023-01-27 22:00:32,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 168 transitions, 348 flow [2023-01-27 22:00:32,955 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 22:00:32,962 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 168 transitions, 348 flow [2023-01-27 22:00:32,965 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 168 transitions, 348 flow [2023-01-27 22:00:32,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 168 transitions, 348 flow [2023-01-27 22:00:33,032 INFO L130 PetriNetUnfolder]: 15/168 cut-off events. [2023-01-27 22:00:33,032 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 22:00:33,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 168 events. 15/168 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2023-01-27 22:00:33,034 INFO L119 LiptonReduction]: Number of co-enabled transitions 690 [2023-01-27 22:00:38,127 INFO L134 LiptonReduction]: Checked pairs total: 1199 [2023-01-27 22:00:38,128 INFO L136 LiptonReduction]: Total number of compositions: 174 [2023-01-27 22:00:38,139 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 22:00:38,144 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@892920d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 22:00:38,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-27 22:00:38,149 INFO L130 PetriNetUnfolder]: 5/22 cut-off events. [2023-01-27 22:00:38,149 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 22:00:38,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:00:38,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:00:38,150 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:00:38,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:00:38,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1033780346, now seen corresponding path program 1 times [2023-01-27 22:00:38,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:00:38,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521499752] [2023-01-27 22:00:38,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:00:38,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:00:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:00:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:00:38,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:00:38,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521499752] [2023-01-27 22:00:38,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521499752] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:00:38,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:00:38,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 22:00:38,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064182448] [2023-01-27 22:00:38,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:00:38,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 22:00:38,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:00:38,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 22:00:38,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 22:00:38,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 352 [2023-01-27 22:00:38,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:38,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:00:38,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 352 [2023-01-27 22:00:38,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:00:38,710 INFO L130 PetriNetUnfolder]: 91/155 cut-off events. [2023-01-27 22:00:38,710 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-01-27 22:00:38,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 155 events. 91/155 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 392 event pairs, 57 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 270. Up to 155 conditions per place. [2023-01-27 22:00:38,712 INFO L137 encePairwiseOnDemand]: 349/352 looper letters, 22 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2023-01-27 22:00:38,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 108 flow [2023-01-27 22:00:38,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 22:00:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 22:00:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-01-27 22:00:38,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39299242424242425 [2023-01-27 22:00:38,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-01-27 22:00:38,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-01-27 22:00:38,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:00:38,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-01-27 22:00:38,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:38,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:38,739 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:38,740 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 3 states and 415 transitions. [2023-01-27 22:00:38,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 108 flow [2023-01-27 22:00:38,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 22:00:38,743 INFO L231 Difference]: Finished difference. Result has 24 places, 24 transitions, 62 flow [2023-01-27 22:00:38,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=24, PETRI_TRANSITIONS=24} [2023-01-27 22:00:38,748 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-01-27 22:00:38,748 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 24 transitions, 62 flow [2023-01-27 22:00:38,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:38,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:00:38,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:00:38,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 22:00:38,749 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:00:38,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:00:38,750 INFO L85 PathProgramCache]: Analyzing trace with hash -164115016, now seen corresponding path program 1 times [2023-01-27 22:00:38,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:00:38,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181106663] [2023-01-27 22:00:38,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:00:38,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:00:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:00:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:00:38,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:00:38,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181106663] [2023-01-27 22:00:38,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181106663] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:00:38,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785517244] [2023-01-27 22:00:38,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:00:38,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:00:38,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:00:38,889 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-01-27 22:00:38,896 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-01-27 22:00:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:00:39,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-27 22:00:39,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:00:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:00:39,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:00:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:00:39,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785517244] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 22:00:39,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 22:00:39,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 9 [2023-01-27 22:00:39,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532872597] [2023-01-27 22:00:39,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:00:39,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 22:00:39,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:00:39,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 22:00:39,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-01-27 22:00:39,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 352 [2023-01-27 22:00:39,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 24 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:39,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:00:39,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 352 [2023-01-27 22:00:39,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:00:39,276 INFO L130 PetriNetUnfolder]: 157/261 cut-off events. [2023-01-27 22:00:39,276 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-01-27 22:00:39,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 261 events. 157/261 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 789 event pairs, 39 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 526. Up to 97 conditions per place. [2023-01-27 22:00:39,278 INFO L137 encePairwiseOnDemand]: 345/352 looper letters, 35 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2023-01-27 22:00:39,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 43 transitions, 188 flow [2023-01-27 22:00:39,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 22:00:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 22:00:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 806 transitions. [2023-01-27 22:00:39,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3816287878787879 [2023-01-27 22:00:39,282 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 806 transitions. [2023-01-27 22:00:39,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 806 transitions. [2023-01-27 22:00:39,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:00:39,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 806 transitions. [2023-01-27 22:00:39,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:39,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:39,291 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:39,291 INFO L175 Difference]: Start difference. First operand has 24 places, 24 transitions, 62 flow. Second operand 6 states and 806 transitions. [2023-01-27 22:00:39,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 43 transitions, 188 flow [2023-01-27 22:00:39,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 43 transitions, 184 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-27 22:00:39,292 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 93 flow [2023-01-27 22:00:39,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=93, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2023-01-27 22:00:39,293 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2023-01-27 22:00:39,294 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 93 flow [2023-01-27 22:00:39,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:39,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:00:39,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:00:39,303 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-01-27 22:00:39,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:00:39,501 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:00:39,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:00:39,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1388554985, now seen corresponding path program 1 times [2023-01-27 22:00:39,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:00:39,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316982373] [2023-01-27 22:00:39,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:00:39,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:00:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:00:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:00:39,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:00:39,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316982373] [2023-01-27 22:00:39,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316982373] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:00:39,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:00:39,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 22:00:39,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030675120] [2023-01-27 22:00:39,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:00:39,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 22:00:39,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:00:39,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 22:00:39,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 22:00:39,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 352 [2023-01-27 22:00:39,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 147.25) internal successors, (589), 4 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:39,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:00:39,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 352 [2023-01-27 22:00:39,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:00:39,835 INFO L130 PetriNetUnfolder]: 294/476 cut-off events. [2023-01-27 22:00:39,835 INFO L131 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2023-01-27 22:00:39,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 476 events. 294/476 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1767 event pairs, 55 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 1126. Up to 250 conditions per place. [2023-01-27 22:00:39,839 INFO L137 encePairwiseOnDemand]: 345/352 looper letters, 46 selfloop transitions, 16 changer transitions 0/62 dead transitions. [2023-01-27 22:00:39,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 62 transitions, 336 flow [2023-01-27 22:00:39,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 22:00:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 22:00:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 769 transitions. [2023-01-27 22:00:39,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4369318181818182 [2023-01-27 22:00:39,841 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 769 transitions. [2023-01-27 22:00:39,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 769 transitions. [2023-01-27 22:00:39,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:00:39,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 769 transitions. [2023-01-27 22:00:39,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:39,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:39,847 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:39,847 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 93 flow. Second operand 5 states and 769 transitions. [2023-01-27 22:00:39,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 62 transitions, 336 flow [2023-01-27 22:00:39,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 62 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 22:00:39,850 INFO L231 Difference]: Finished difference. Result has 35 places, 41 transitions, 234 flow [2023-01-27 22:00:39,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=35, PETRI_TRANSITIONS=41} [2023-01-27 22:00:39,851 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2023-01-27 22:00:39,851 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 41 transitions, 234 flow [2023-01-27 22:00:39,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.25) internal successors, (589), 4 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:39,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:00:39,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:00:39,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 22:00:39,852 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:00:39,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:00:39,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1352553143, now seen corresponding path program 2 times [2023-01-27 22:00:39,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:00:39,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136284078] [2023-01-27 22:00:39,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:00:39,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:00:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:00:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 22:00:39,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:00:39,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136284078] [2023-01-27 22:00:39,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136284078] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:00:39,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:00:39,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 22:00:39,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975409008] [2023-01-27 22:00:39,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:00:39,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 22:00:39,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:00:39,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 22:00:39,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 22:00:39,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 352 [2023-01-27 22:00:39,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 41 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:39,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:00:39,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 352 [2023-01-27 22:00:39,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:00:40,067 INFO L130 PetriNetUnfolder]: 477/766 cut-off events. [2023-01-27 22:00:40,067 INFO L131 PetriNetUnfolder]: For 1197/1219 co-relation queries the response was YES. [2023-01-27 22:00:40,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 766 events. 477/766 cut-off events. For 1197/1219 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3156 event pairs, 137 based on Foata normal form. 16/766 useless extension candidates. Maximal degree in co-relation 2675. Up to 433 conditions per place. [2023-01-27 22:00:40,072 INFO L137 encePairwiseOnDemand]: 349/352 looper letters, 62 selfloop transitions, 4 changer transitions 2/70 dead transitions. [2023-01-27 22:00:40,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 70 transitions, 562 flow [2023-01-27 22:00:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 22:00:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 22:00:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2023-01-27 22:00:40,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2023-01-27 22:00:40,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2023-01-27 22:00:40,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2023-01-27 22:00:40,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:00:40,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2023-01-27 22:00:40,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:40,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:40,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:40,079 INFO L175 Difference]: Start difference. First operand has 35 places, 41 transitions, 234 flow. Second operand 3 states and 504 transitions. [2023-01-27 22:00:40,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 70 transitions, 562 flow [2023-01-27 22:00:40,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 70 transitions, 562 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 22:00:40,084 INFO L231 Difference]: Finished difference. Result has 38 places, 44 transitions, 271 flow [2023-01-27 22:00:40,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=38, PETRI_TRANSITIONS=44} [2023-01-27 22:00:40,084 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 13 predicate places. [2023-01-27 22:00:40,084 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 44 transitions, 271 flow [2023-01-27 22:00:40,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:40,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:00:40,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:00:40,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 22:00:40,085 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:00:40,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:00:40,086 INFO L85 PathProgramCache]: Analyzing trace with hash -84645957, now seen corresponding path program 1 times [2023-01-27 22:00:40,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:00:40,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440109805] [2023-01-27 22:00:40,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:00:40,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:00:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:00:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:00:40,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:00:40,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440109805] [2023-01-27 22:00:40,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440109805] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:00:40,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491530764] [2023-01-27 22:00:40,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:00:40,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:00:40,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:00:40,241 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-01-27 22:00:40,250 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-01-27 22:00:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:00:40,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-27 22:00:40,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:00:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:00:40,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-27 22:00:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491530764] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:00:40,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-27 22:00:40,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2023-01-27 22:00:40,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044797708] [2023-01-27 22:00:40,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:00:40,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 22:00:40,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:00:40,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 22:00:40,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 22:00:40,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 352 [2023-01-27 22:00:40,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 44 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:40,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:00:40,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 352 [2023-01-27 22:00:40,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:00:40,439 INFO L130 PetriNetUnfolder]: 421/703 cut-off events. [2023-01-27 22:00:40,439 INFO L131 PetriNetUnfolder]: For 985/985 co-relation queries the response was YES. [2023-01-27 22:00:40,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2535 conditions, 703 events. 421/703 cut-off events. For 985/985 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2734 event pairs, 94 based on Foata normal form. 22/724 useless extension candidates. Maximal degree in co-relation 2506. Up to 587 conditions per place. [2023-01-27 22:00:40,443 INFO L137 encePairwiseOnDemand]: 349/352 looper letters, 51 selfloop transitions, 2 changer transitions 5/58 dead transitions. [2023-01-27 22:00:40,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 58 transitions, 448 flow [2023-01-27 22:00:40,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 22:00:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 22:00:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2023-01-27 22:00:40,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715909090909091 [2023-01-27 22:00:40,445 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 498 transitions. [2023-01-27 22:00:40,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions. [2023-01-27 22:00:40,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:00:40,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions. [2023-01-27 22:00:40,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:40,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:40,449 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:40,449 INFO L175 Difference]: Start difference. First operand has 38 places, 44 transitions, 271 flow. Second operand 3 states and 498 transitions. [2023-01-27 22:00:40,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 58 transitions, 448 flow [2023-01-27 22:00:40,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 58 transitions, 444 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 22:00:40,452 INFO L231 Difference]: Finished difference. Result has 40 places, 44 transitions, 273 flow [2023-01-27 22:00:40,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=273, PETRI_PLACES=40, PETRI_TRANSITIONS=44} [2023-01-27 22:00:40,453 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 15 predicate places. [2023-01-27 22:00:40,453 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 44 transitions, 273 flow [2023-01-27 22:00:40,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:40,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:00:40,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:00:40,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-27 22:00:40,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:00:40,665 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:00:40,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:00:40,666 INFO L85 PathProgramCache]: Analyzing trace with hash 286694240, now seen corresponding path program 1 times [2023-01-27 22:00:40,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:00:40,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292447320] [2023-01-27 22:00:40,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:00:40,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:00:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:00:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 22:00:40,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:00:40,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292447320] [2023-01-27 22:00:40,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292447320] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:00:40,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:00:40,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 22:00:40,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385706366] [2023-01-27 22:00:40,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:00:40,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 22:00:40,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:00:40,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 22:00:40,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 22:00:40,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 352 [2023-01-27 22:00:40,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 44 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:40,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:00:40,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 352 [2023-01-27 22:00:40,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:00:40,870 INFO L130 PetriNetUnfolder]: 448/776 cut-off events. [2023-01-27 22:00:40,871 INFO L131 PetriNetUnfolder]: For 1574/1606 co-relation queries the response was YES. [2023-01-27 22:00:40,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2933 conditions, 776 events. 448/776 cut-off events. For 1574/1606 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3252 event pairs, 242 based on Foata normal form. 42/807 useless extension candidates. Maximal degree in co-relation 2509. Up to 660 conditions per place. [2023-01-27 22:00:40,876 INFO L137 encePairwiseOnDemand]: 347/352 looper letters, 41 selfloop transitions, 2 changer transitions 20/65 dead transitions. [2023-01-27 22:00:40,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 505 flow [2023-01-27 22:00:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 22:00:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 22:00:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 714 transitions. [2023-01-27 22:00:40,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4056818181818182 [2023-01-27 22:00:40,879 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 714 transitions. [2023-01-27 22:00:40,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 714 transitions. [2023-01-27 22:00:40,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:00:40,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 714 transitions. [2023-01-27 22:00:40,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:40,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:40,885 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:40,885 INFO L175 Difference]: Start difference. First operand has 40 places, 44 transitions, 273 flow. Second operand 5 states and 714 transitions. [2023-01-27 22:00:40,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 505 flow [2023-01-27 22:00:40,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 65 transitions, 503 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 22:00:40,891 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 287 flow [2023-01-27 22:00:40,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2023-01-27 22:00:40,893 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 21 predicate places. [2023-01-27 22:00:40,893 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 287 flow [2023-01-27 22:00:40,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:40,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:00:40,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:00:40,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 22:00:40,894 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:00:40,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:00:40,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1802696178, now seen corresponding path program 1 times [2023-01-27 22:00:40,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:00:40,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159878508] [2023-01-27 22:00:40,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:00:40,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:00:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:00:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:00:42,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:00:42,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159878508] [2023-01-27 22:00:42,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159878508] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:00:42,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861477864] [2023-01-27 22:00:42,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:00:42,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:00:42,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:00:42,041 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-01-27 22:00:42,044 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-01-27 22:00:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:00:42,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 48 conjunts are in the unsatisfiable core [2023-01-27 22:00:42,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:00:42,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:00:42,375 INFO L350 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 18 treesize of output 20 [2023-01-27 22:00:42,763 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-01-27 22:00:42,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2023-01-27 22:00:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:00:42,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:00:43,188 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (let ((.cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse3 (+ c_~A~0.offset (* c_~i~0 4)))) (and (forall ((v_ArrVal_173 (Array Int Int)) (~queue~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse0 (select .cse2 ~queue~0.base))) (or (< (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (+ c_~v_old~0 1)) (not (= (select .cse0 .cse1) (select (select .cse2 c_~A~0.base) .cse3))))))) (or (forall ((v_ArrVal_173 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (= (select (select .cse4 ~queue~0.base) .cse1) (select (select .cse4 c_~A~0.base) .cse3))))) (not (= (mod c_~ok~0 256) 0))))) (<= (+ c_~end~0 1) c_~start~0) (< c_~start~0 0) (< c_~last~0 |c_thread1Thread1of1ForFork1_#t~mem1#1|)) is different from false [2023-01-27 22:00:43,296 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2023-01-27 22:00:43,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 251 [2023-01-27 22:00:43,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:00:43,329 INFO L350 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 174 treesize of output 185 [2023-01-27 22:00:43,351 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:00:43,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 137 [2023-01-27 22:00:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:00:44,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861477864] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:00:44,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:00:44,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-01-27 22:00:44,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228734054] [2023-01-27 22:00:44,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:00:44,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-01-27 22:00:44,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:00:44,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-01-27 22:00:44,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=696, Unknown=1, NotChecked=56, Total=930 [2023-01-27 22:00:44,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 352 [2023-01-27 22:00:44,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 287 flow. Second operand has 31 states, 31 states have (on average 86.12903225806451) internal successors, (2670), 31 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:44,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:00:44,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 352 [2023-01-27 22:00:44,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:00:45,779 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse2 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse7 (+ c_~A~0.offset (* c_~i~0 4))) (.cse10 (< c_~last~0 |c_thread1Thread1of1ForFork1_#t~mem1#1|)) (.cse0 (<= c_~n~0 c_~end~0)) (.cse8 (<= (+ c_~end~0 1) c_~start~0)) (.cse5 (+ c_~v_old~0 1)) (.cse6 (not (= (mod c_~ok~0 256) 0))) (.cse11 (= c_~start~0 c_~end~0)) (.cse9 (< c_~start~0 0))) (and (or .cse0 (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) .cse7))) (and (forall ((~queue~0.base Int)) (let ((.cse1 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse1 .cse2) .cse3)) (< (select .cse1 .cse4) .cse5)))) (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse2) .cse3))) .cse6))) .cse8 .cse9 .cse10) (or .cse0 .cse8 .cse9 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1)) .cse6 .cse11)) (= c_~ok~0 1) (or .cse0 .cse8 (and .cse6 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse11) .cse9) (or .cse0 (and (forall ((v_ArrVal_173 (Array Int Int)) (~queue~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse12 (select .cse13 ~queue~0.base))) (or (< (select .cse12 .cse4) .cse5) (not (= (select .cse12 .cse2) (select (select .cse13 c_~A~0.base) .cse7))))))) (or (forall ((v_ArrVal_173 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (= (select (select .cse14 ~queue~0.base) .cse2) (select (select .cse14 c_~A~0.base) .cse7))))) .cse6)) .cse8 .cse9 .cse10) (or .cse0 .cse8 (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (< c_~last~0 .cse5) .cse6 .cse11) .cse9))) is different from false [2023-01-27 22:00:49,280 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse6 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse8 (+ c_~A~0.offset (* c_~i~0 4))) (.cse10 (< c_~last~0 |c_thread1Thread1of1ForFork1_#t~mem1#1|)) (.cse4 (<= c_~n~0 c_~end~0)) (.cse9 (<= (+ c_~end~0 1) c_~start~0)) (.cse1 (+ c_~v_old~0 1)) (.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse11 (= c_~start~0 c_~end~0)) (.cse3 (< c_~start~0 0))) (and (or (and (< (select (select |c_#memory_int| c_~queue~0.base) .cse0) .cse1) .cse2) .cse3 (<= c_~end~0 c_~start~0) (<= c_~n~0 c_~start~0)) (or .cse4 (let ((.cse7 (select (select |c_#memory_int| c_~A~0.base) .cse8))) (and (forall ((~queue~0.base Int)) (let ((.cse5 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse5 .cse6) .cse7)) (< (select .cse5 .cse0) .cse1)))) (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse6) .cse7))) .cse2))) .cse9 .cse3 .cse10) (= c_~new~0 c_~v_old~0) (or .cse4 .cse9 .cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1)) .cse2 .cse11)) (= c_~ok~0 1) (or .cse4 .cse9 (and .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse11) .cse3) (or .cse4 (and (forall ((v_ArrVal_173 (Array Int Int)) (~queue~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse12 (select .cse13 ~queue~0.base))) (or (< (select .cse12 .cse0) .cse1) (not (= (select .cse12 .cse6) (select (select .cse13 c_~A~0.base) .cse8))))))) (or (forall ((v_ArrVal_173 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (= (select (select .cse14 ~queue~0.base) .cse6) (select (select .cse14 c_~A~0.base) .cse8))))) .cse2)) .cse9 .cse3 .cse10) (or .cse4 .cse9 (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (< c_~last~0 .cse1) .cse2 .cse11) .cse3))) is different from false [2023-01-27 22:00:52,408 INFO L130 PetriNetUnfolder]: 2935/4953 cut-off events. [2023-01-27 22:00:52,408 INFO L131 PetriNetUnfolder]: For 8246/8246 co-relation queries the response was YES. [2023-01-27 22:00:52,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18685 conditions, 4953 events. 2935/4953 cut-off events. For 8246/8246 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 30338 event pairs, 178 based on Foata normal form. 62/5011 useless extension candidates. Maximal degree in co-relation 18660. Up to 1611 conditions per place. [2023-01-27 22:00:52,440 INFO L137 encePairwiseOnDemand]: 334/352 looper letters, 368 selfloop transitions, 278 changer transitions 126/772 dead transitions. [2023-01-27 22:00:52,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 772 transitions, 6088 flow [2023-01-27 22:00:52,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-01-27 22:00:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2023-01-27 22:00:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 6512 transitions. [2023-01-27 22:00:52,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2605633802816901 [2023-01-27 22:00:52,461 INFO L72 ComplementDD]: Start complementDD. Operand 71 states and 6512 transitions. [2023-01-27 22:00:52,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 6512 transitions. [2023-01-27 22:00:52,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:00:52,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 71 states and 6512 transitions. [2023-01-27 22:00:52,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 72 states, 71 states have (on average 91.71830985915493) internal successors, (6512), 71 states have internal predecessors, (6512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:52,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 72 states, 72 states have (on average 352.0) internal successors, (25344), 72 states have internal predecessors, (25344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:52,515 INFO L81 ComplementDD]: Finished complementDD. Result has 72 states, 72 states have (on average 352.0) internal successors, (25344), 72 states have internal predecessors, (25344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:52,515 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 287 flow. Second operand 71 states and 6512 transitions. [2023-01-27 22:00:52,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 772 transitions, 6088 flow [2023-01-27 22:00:52,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 772 transitions, 6050 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-01-27 22:00:52,542 INFO L231 Difference]: Finished difference. Result has 166 places, 343 transitions, 3769 flow [2023-01-27 22:00:52,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=3769, PETRI_PLACES=166, PETRI_TRANSITIONS=343} [2023-01-27 22:00:52,544 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 141 predicate places. [2023-01-27 22:00:52,544 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 343 transitions, 3769 flow [2023-01-27 22:00:52,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 86.12903225806451) internal successors, (2670), 31 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:52,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:00:52,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:00:52,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-27 22:00:52,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:00:52,753 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:00:52,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:00:52,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1490303590, now seen corresponding path program 2 times [2023-01-27 22:00:52,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:00:52,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590872511] [2023-01-27 22:00:52,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:00:52,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:00:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:00:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:00:53,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:00:53,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590872511] [2023-01-27 22:00:53,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590872511] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:00:53,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727425980] [2023-01-27 22:00:53,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:00:53,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:00:53,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:00:53,654 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-01-27 22:00:53,655 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-01-27 22:00:53,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:00:53,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:00:53,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 36 conjunts are in the unsatisfiable core [2023-01-27 22:00:53,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:00:54,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:00:54,040 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-01-27 22:00:54,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2023-01-27 22:00:54,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-01-27 22:00:54,161 INFO L350 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 23 treesize of output 7 [2023-01-27 22:00:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:00:54,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:00:54,356 WARN L839 $PredicateComparison]: unable to prove that (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_212 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) (+ c_~v_old~0 1)))) is different from false [2023-01-27 22:00:54,470 INFO L321 Elim1Store]: treesize reduction 19, result has 59.6 percent of original size [2023-01-27 22:00:54,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 73 treesize of output 68 [2023-01-27 22:00:54,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2023-01-27 22:00:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:00:54,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727425980] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:00:54,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:00:54,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2023-01-27 22:00:54,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011870328] [2023-01-27 22:00:54,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:00:54,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-27 22:00:54,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:00:54,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-27 22:00:54,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=664, Unknown=1, NotChecked=54, Total=870 [2023-01-27 22:00:54,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 352 [2023-01-27 22:00:54,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 343 transitions, 3769 flow. Second operand has 30 states, 30 states have (on average 90.2) internal successors, (2706), 30 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:00:54,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:00:54,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 352 [2023-01-27 22:00:54,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:01:05,669 INFO L130 PetriNetUnfolder]: 5763/9633 cut-off events. [2023-01-27 22:01:05,669 INFO L131 PetriNetUnfolder]: For 232410/232410 co-relation queries the response was YES. [2023-01-27 22:01:05,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79274 conditions, 9633 events. 5763/9633 cut-off events. For 232410/232410 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 64509 event pairs, 326 based on Foata normal form. 40/9673 useless extension candidates. Maximal degree in co-relation 79174. Up to 3306 conditions per place. [2023-01-27 22:01:05,774 INFO L137 encePairwiseOnDemand]: 335/352 looper letters, 548 selfloop transitions, 478 changer transitions 103/1129 dead transitions. [2023-01-27 22:01:05,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1129 transitions, 16117 flow [2023-01-27 22:01:05,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-01-27 22:01:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-01-27 22:01:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3375 transitions. [2023-01-27 22:01:05,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2739448051948052 [2023-01-27 22:01:05,783 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3375 transitions. [2023-01-27 22:01:05,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3375 transitions. [2023-01-27 22:01:05,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:01:05,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3375 transitions. [2023-01-27 22:01:05,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 96.42857142857143) internal successors, (3375), 35 states have internal predecessors, (3375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:05,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 352.0) internal successors, (12672), 36 states have internal predecessors, (12672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:05,806 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 352.0) internal successors, (12672), 36 states have internal predecessors, (12672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:05,806 INFO L175 Difference]: Start difference. First operand has 166 places, 343 transitions, 3769 flow. Second operand 35 states and 3375 transitions. [2023-01-27 22:01:05,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 1129 transitions, 16117 flow [2023-01-27 22:01:06,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 1129 transitions, 15107 flow, removed 503 selfloop flow, removed 12 redundant places. [2023-01-27 22:01:06,730 INFO L231 Difference]: Finished difference. Result has 200 places, 742 transitions, 10089 flow [2023-01-27 22:01:06,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=3487, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=10089, PETRI_PLACES=200, PETRI_TRANSITIONS=742} [2023-01-27 22:01:06,731 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 175 predicate places. [2023-01-27 22:01:06,731 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 742 transitions, 10089 flow [2023-01-27 22:01:06,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 90.2) internal successors, (2706), 30 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:06,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:01:06,733 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:01:06,740 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-01-27 22:01:06,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:01:06,938 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:01:06,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:01:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2047725600, now seen corresponding path program 3 times [2023-01-27 22:01:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:01:06,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610479837] [2023-01-27 22:01:06,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:01:06,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:01:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:01:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:01:08,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:01:08,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610479837] [2023-01-27 22:01:08,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610479837] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:01:08,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600168174] [2023-01-27 22:01:08,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:01:08,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:01:08,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:01:08,097 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-01-27 22:01:08,101 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-01-27 22:01:08,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 22:01:08,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:01:08,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 34 conjunts are in the unsatisfiable core [2023-01-27 22:01:08,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:01:08,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:01:08,493 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-01-27 22:01:08,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2023-01-27 22:01:08,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-01-27 22:01:08,573 INFO L350 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 23 treesize of output 7 [2023-01-27 22:01:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 22:01:08,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:01:08,772 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_255 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_255) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) (+ c_~v_old~0 1))) (not (= (mod c_~ok~0 256) 0))) is different from false [2023-01-27 22:01:08,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:01:08,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 135 [2023-01-27 22:01:08,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2023-01-27 22:01:09,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 22:01:09,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600168174] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:01:09,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:01:09,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 28 [2023-01-27 22:01:09,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328572057] [2023-01-27 22:01:09,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:01:09,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-27 22:01:09,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:01:09,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-27 22:01:09,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=659, Unknown=1, NotChecked=54, Total=870 [2023-01-27 22:01:09,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 352 [2023-01-27 22:01:09,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 742 transitions, 10089 flow. Second operand has 30 states, 30 states have (on average 90.2) internal successors, (2706), 30 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:09,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:01:09,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 352 [2023-01-27 22:01:09,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:01:12,794 INFO L130 PetriNetUnfolder]: 6981/11613 cut-off events. [2023-01-27 22:01:12,794 INFO L131 PetriNetUnfolder]: For 295341/295341 co-relation queries the response was YES. [2023-01-27 22:01:12,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105404 conditions, 11613 events. 6981/11613 cut-off events. For 295341/295341 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 80029 event pairs, 308 based on Foata normal form. 2/11615 useless extension candidates. Maximal degree in co-relation 105294. Up to 3973 conditions per place. [2023-01-27 22:01:13,056 INFO L137 encePairwiseOnDemand]: 339/352 looper letters, 727 selfloop transitions, 401 changer transitions 23/1151 dead transitions. [2023-01-27 22:01:13,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 1151 transitions, 18775 flow [2023-01-27 22:01:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-01-27 22:01:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-01-27 22:01:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1911 transitions. [2023-01-27 22:01:13,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2714488636363636 [2023-01-27 22:01:13,060 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1911 transitions. [2023-01-27 22:01:13,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1911 transitions. [2023-01-27 22:01:13,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:01:13,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1911 transitions. [2023-01-27 22:01:13,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 95.55) internal successors, (1911), 20 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:13,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 352.0) internal successors, (7392), 21 states have internal predecessors, (7392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:13,070 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 352.0) internal successors, (7392), 21 states have internal predecessors, (7392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:13,071 INFO L175 Difference]: Start difference. First operand has 200 places, 742 transitions, 10089 flow. Second operand 20 states and 1911 transitions. [2023-01-27 22:01:13,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 1151 transitions, 18775 flow [2023-01-27 22:01:14,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 1151 transitions, 18050 flow, removed 353 selfloop flow, removed 9 redundant places. [2023-01-27 22:01:14,711 INFO L231 Difference]: Finished difference. Result has 210 places, 871 transitions, 12888 flow [2023-01-27 22:01:14,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=9699, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=278, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=12888, PETRI_PLACES=210, PETRI_TRANSITIONS=871} [2023-01-27 22:01:14,712 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 185 predicate places. [2023-01-27 22:01:14,712 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 871 transitions, 12888 flow [2023-01-27 22:01:14,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 90.2) internal successors, (2706), 30 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:14,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:01:14,712 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:01:14,718 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-01-27 22:01:14,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:01:14,914 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:01:14,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:01:14,915 INFO L85 PathProgramCache]: Analyzing trace with hash 845325723, now seen corresponding path program 1 times [2023-01-27 22:01:14,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:01:14,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311296820] [2023-01-27 22:01:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:01:14,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:01:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:01:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:01:15,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:01:15,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311296820] [2023-01-27 22:01:15,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311296820] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:01:15,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745702804] [2023-01-27 22:01:15,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:01:15,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:01:15,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:01:15,034 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-01-27 22:01:15,037 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-01-27 22:01:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:01:15,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 22:01:15,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:01:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:01:15,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:01:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:01:15,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745702804] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:01:15,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:01:15,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-01-27 22:01:15,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309039633] [2023-01-27 22:01:15,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:01:15,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-27 22:01:15,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:01:15,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-27 22:01:15,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2023-01-27 22:01:15,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 352 [2023-01-27 22:01:15,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 871 transitions, 12888 flow. Second operand has 15 states, 15 states have (on average 130.53333333333333) internal successors, (1958), 15 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:15,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:01:15,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 352 [2023-01-27 22:01:15,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:01:18,401 INFO L130 PetriNetUnfolder]: 6903/11791 cut-off events. [2023-01-27 22:01:18,401 INFO L131 PetriNetUnfolder]: For 315830/315830 co-relation queries the response was YES. [2023-01-27 22:01:18,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105784 conditions, 11791 events. 6903/11791 cut-off events. For 315830/315830 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 84930 event pairs, 916 based on Foata normal form. 271/12062 useless extension candidates. Maximal degree in co-relation 105674. Up to 5998 conditions per place. [2023-01-27 22:01:18,534 INFO L137 encePairwiseOnDemand]: 344/352 looper letters, 1230 selfloop transitions, 76 changer transitions 22/1328 dead transitions. [2023-01-27 22:01:18,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 1328 transitions, 22117 flow [2023-01-27 22:01:18,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 22:01:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 22:01:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1214 transitions. [2023-01-27 22:01:18,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3832070707070707 [2023-01-27 22:01:18,539 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1214 transitions. [2023-01-27 22:01:18,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1214 transitions. [2023-01-27 22:01:18,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:01:18,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1214 transitions. [2023-01-27 22:01:18,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.88888888888889) internal successors, (1214), 9 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:18,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:18,545 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:18,545 INFO L175 Difference]: Start difference. First operand has 210 places, 871 transitions, 12888 flow. Second operand 9 states and 1214 transitions. [2023-01-27 22:01:18,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 1328 transitions, 22117 flow [2023-01-27 22:01:19,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 1328 transitions, 21984 flow, removed 47 selfloop flow, removed 5 redundant places. [2023-01-27 22:01:19,941 INFO L231 Difference]: Finished difference. Result has 215 places, 854 transitions, 12638 flow [2023-01-27 22:01:19,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=12128, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=782, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12638, PETRI_PLACES=215, PETRI_TRANSITIONS=854} [2023-01-27 22:01:19,942 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 190 predicate places. [2023-01-27 22:01:19,942 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 854 transitions, 12638 flow [2023-01-27 22:01:19,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 130.53333333333333) internal successors, (1958), 15 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:19,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:01:19,943 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:01:19,948 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-01-27 22:01:20,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:01:20,144 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:01:20,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:01:20,144 INFO L85 PathProgramCache]: Analyzing trace with hash 43072444, now seen corresponding path program 4 times [2023-01-27 22:01:20,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:01:20,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315509821] [2023-01-27 22:01:20,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:01:20,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:01:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:01:20,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:01:20,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:01:20,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315509821] [2023-01-27 22:01:20,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315509821] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:01:20,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111271951] [2023-01-27 22:01:20,248 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 22:01:20,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:01:20,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:01:20,249 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:01:20,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-27 22:01:20,343 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 22:01:20,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:01:20,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-27 22:01:20,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:01:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:01:20,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:01:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:01:20,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111271951] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:01:20,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:01:20,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-01-27 22:01:20,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189409277] [2023-01-27 22:01:20,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:01:20,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-27 22:01:20,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:01:20,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-27 22:01:20,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-01-27 22:01:20,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 352 [2023-01-27 22:01:20,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 854 transitions, 12638 flow. Second operand has 9 states, 9 states have (on average 146.55555555555554) internal successors, (1319), 9 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:20,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:01:20,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 352 [2023-01-27 22:01:20,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:01:23,775 INFO L130 PetriNetUnfolder]: 7729/13155 cut-off events. [2023-01-27 22:01:23,775 INFO L131 PetriNetUnfolder]: For 343624/343624 co-relation queries the response was YES. [2023-01-27 22:01:23,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120693 conditions, 13155 events. 7729/13155 cut-off events. For 343624/343624 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 95145 event pairs, 705 based on Foata normal form. 78/13233 useless extension candidates. Maximal degree in co-relation 115974. Up to 4607 conditions per place. [2023-01-27 22:01:23,935 INFO L137 encePairwiseOnDemand]: 345/352 looper letters, 596 selfloop transitions, 679 changer transitions 0/1275 dead transitions. [2023-01-27 22:01:23,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 1275 transitions, 21263 flow [2023-01-27 22:01:23,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 22:01:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 22:01:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1207 transitions. [2023-01-27 22:01:23,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4286221590909091 [2023-01-27 22:01:23,937 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1207 transitions. [2023-01-27 22:01:23,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1207 transitions. [2023-01-27 22:01:23,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:01:23,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1207 transitions. [2023-01-27 22:01:23,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 150.875) internal successors, (1207), 8 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:23,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:23,942 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:23,942 INFO L175 Difference]: Start difference. First operand has 215 places, 854 transitions, 12638 flow. Second operand 8 states and 1207 transitions. [2023-01-27 22:01:23,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 1275 transitions, 21263 flow [2023-01-27 22:01:25,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 1275 transitions, 21206 flow, removed 25 selfloop flow, removed 2 redundant places. [2023-01-27 22:01:25,499 INFO L231 Difference]: Finished difference. Result has 226 places, 1158 transitions, 20561 flow [2023-01-27 22:01:25,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=12595, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=854, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=415, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=20561, PETRI_PLACES=226, PETRI_TRANSITIONS=1158} [2023-01-27 22:01:25,500 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 201 predicate places. [2023-01-27 22:01:25,500 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 1158 transitions, 20561 flow [2023-01-27 22:01:25,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 146.55555555555554) internal successors, (1319), 9 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:25,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:01:25,500 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:01:25,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-27 22:01:25,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:01:25,702 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:01:25,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:01:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1392447874, now seen corresponding path program 5 times [2023-01-27 22:01:25,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:01:25,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311308158] [2023-01-27 22:01:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:01:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:01:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:01:25,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 22:01:25,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:01:25,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311308158] [2023-01-27 22:01:25,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311308158] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:01:25,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833371447] [2023-01-27 22:01:25,868 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 22:01:25,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:01:25,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:01:25,870 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:01:25,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-27 22:01:25,970 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-27 22:01:25,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:01:25,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 22:01:25,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:01:25,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 22:01:25,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:01:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 22:01:26,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833371447] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:01:26,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:01:26,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 9 [2023-01-27 22:01:26,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827487789] [2023-01-27 22:01:26,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:01:26,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 22:01:26,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:01:26,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 22:01:26,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2023-01-27 22:01:26,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 352 [2023-01-27 22:01:26,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 1158 transitions, 20561 flow. Second operand has 10 states, 10 states have (on average 148.1) internal successors, (1481), 10 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:26,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:01:26,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 352 [2023-01-27 22:01:26,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:01:30,625 INFO L130 PetriNetUnfolder]: 8426/14709 cut-off events. [2023-01-27 22:01:30,625 INFO L131 PetriNetUnfolder]: For 500757/500757 co-relation queries the response was YES. [2023-01-27 22:01:30,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151473 conditions, 14709 events. 8426/14709 cut-off events. For 500757/500757 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 109241 event pairs, 765 based on Foata normal form. 584/15293 useless extension candidates. Maximal degree in co-relation 145913. Up to 4973 conditions per place. [2023-01-27 22:01:30,782 INFO L137 encePairwiseOnDemand]: 346/352 looper letters, 952 selfloop transitions, 273 changer transitions 263/1488 dead transitions. [2023-01-27 22:01:30,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 1488 transitions, 30075 flow [2023-01-27 22:01:30,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 22:01:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 22:01:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1079 transitions. [2023-01-27 22:01:30,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43790584415584416 [2023-01-27 22:01:30,784 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1079 transitions. [2023-01-27 22:01:30,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1079 transitions. [2023-01-27 22:01:30,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:01:30,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1079 transitions. [2023-01-27 22:01:30,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 154.14285714285714) internal successors, (1079), 7 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:30,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:30,788 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:30,788 INFO L175 Difference]: Start difference. First operand has 226 places, 1158 transitions, 20561 flow. Second operand 7 states and 1079 transitions. [2023-01-27 22:01:30,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 1488 transitions, 30075 flow [2023-01-27 22:01:33,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 1488 transitions, 28612 flow, removed 702 selfloop flow, removed 9 redundant places. [2023-01-27 22:01:33,969 INFO L231 Difference]: Finished difference. Result has 219 places, 897 transitions, 16604 flow [2023-01-27 22:01:33,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=15111, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=883, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=16604, PETRI_PLACES=219, PETRI_TRANSITIONS=897} [2023-01-27 22:01:33,971 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 194 predicate places. [2023-01-27 22:01:33,971 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 897 transitions, 16604 flow [2023-01-27 22:01:33,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 148.1) internal successors, (1481), 10 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:33,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:01:33,971 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:01:33,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-27 22:01:34,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-01-27 22:01:34,172 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:01:34,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:01:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash 233657423, now seen corresponding path program 2 times [2023-01-27 22:01:34,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:01:34,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355925168] [2023-01-27 22:01:34,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:01:34,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:01:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:01:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 22:01:34,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:01:34,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355925168] [2023-01-27 22:01:34,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355925168] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:01:34,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:01:34,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 22:01:34,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920704122] [2023-01-27 22:01:34,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:01:34,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 22:01:34,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:01:34,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 22:01:34,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 22:01:34,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 352 [2023-01-27 22:01:34,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 897 transitions, 16604 flow. Second operand has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:34,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:01:34,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 352 [2023-01-27 22:01:34,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:01:37,596 INFO L130 PetriNetUnfolder]: 7092/12399 cut-off events. [2023-01-27 22:01:37,597 INFO L131 PetriNetUnfolder]: For 360420/360420 co-relation queries the response was YES. [2023-01-27 22:01:37,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127246 conditions, 12399 events. 7092/12399 cut-off events. For 360420/360420 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 89870 event pairs, 336 based on Foata normal form. 32/12431 useless extension candidates. Maximal degree in co-relation 123982. Up to 8267 conditions per place. [2023-01-27 22:01:37,713 INFO L137 encePairwiseOnDemand]: 348/352 looper letters, 1031 selfloop transitions, 39 changer transitions 18/1088 dead transitions. [2023-01-27 22:01:37,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 1088 transitions, 22180 flow [2023-01-27 22:01:37,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 22:01:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 22:01:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 781 transitions. [2023-01-27 22:01:37,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44375 [2023-01-27 22:01:37,715 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 781 transitions. [2023-01-27 22:01:37,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 781 transitions. [2023-01-27 22:01:37,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:01:37,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 781 transitions. [2023-01-27 22:01:37,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 156.2) internal successors, (781), 5 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:37,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:37,719 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:37,719 INFO L175 Difference]: Start difference. First operand has 219 places, 897 transitions, 16604 flow. Second operand 5 states and 781 transitions. [2023-01-27 22:01:37,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 1088 transitions, 22180 flow [2023-01-27 22:01:39,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 1088 transitions, 21785 flow, removed 164 selfloop flow, removed 2 redundant places. [2023-01-27 22:01:39,427 INFO L231 Difference]: Finished difference. Result has 223 places, 905 transitions, 16515 flow [2023-01-27 22:01:39,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=16201, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=860, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=16515, PETRI_PLACES=223, PETRI_TRANSITIONS=905} [2023-01-27 22:01:39,428 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 198 predicate places. [2023-01-27 22:01:39,428 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 905 transitions, 16515 flow [2023-01-27 22:01:39,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:39,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:01:39,428 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:01:39,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 22:01:39,428 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:01:39,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:01:39,429 INFO L85 PathProgramCache]: Analyzing trace with hash -402810445, now seen corresponding path program 3 times [2023-01-27 22:01:39,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:01:39,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634865893] [2023-01-27 22:01:39,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:01:39,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:01:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:01:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:01:40,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:01:40,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634865893] [2023-01-27 22:01:40,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634865893] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:01:40,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559352760] [2023-01-27 22:01:40,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:01:40,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:01:40,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:01:40,319 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:01:40,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-27 22:01:40,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-27 22:01:40,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:01:40,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 50 conjunts are in the unsatisfiable core [2023-01-27 22:01:40,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:01:40,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:01:40,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-27 22:01:40,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:01:40,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-27 22:01:40,905 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:01:40,907 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-27 22:01:40,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2023-01-27 22:01:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:01:40,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:01:41,436 INFO L321 Elim1Store]: treesize reduction 11, result has 92.0 percent of original size [2023-01-27 22:01:41,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1886 treesize of output 1736 [2023-01-27 22:01:41,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:01:41,543 INFO L350 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 792 treesize of output 731 [2023-01-27 22:01:41,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:01:41,592 INFO L350 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 690 treesize of output 623 [2023-01-27 22:01:41,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:01:41,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 582 treesize of output 503 [2023-01-27 22:01:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:01:49,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559352760] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:01:49,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:01:49,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 27 [2023-01-27 22:01:49,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707652938] [2023-01-27 22:01:49,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:01:49,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-01-27 22:01:49,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:01:49,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-01-27 22:01:49,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=672, Unknown=4, NotChecked=0, Total=812 [2023-01-27 22:01:49,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 352 [2023-01-27 22:01:49,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 905 transitions, 16515 flow. Second operand has 29 states, 29 states have (on average 82.41379310344827) internal successors, (2390), 29 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:01:49,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:01:49,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 352 [2023-01-27 22:01:49,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:01:59,073 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (not (= c_~start~0 0))) (.cse11 (<= c_~n~0 1)) (.cse12 (<= c_~end~0 0)) (.cse13 (= c_~i~0 0)) (.cse14 (= c_~start~0 c_~end~0)) (.cse0 (<= c_~n~0 c_~end~0)) (.cse7 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse8 (+ c_~v_old~0 1)) (.cse4 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse5 (+ c_~A~0.offset (* c_~i~0 4))) (.cse1 (< c_~end~0 0)) (.cse15 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (and (or (< 0 (+ c_~start~0 1)) (<= c_~end~0 c_~start~0)) (or .cse0 .cse1 (and (or .cse2 (forall ((~queue~0.base Int) (v_ArrVal_434 (Array Int Int))) (not (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_434))) (= (select (select .cse3 ~queue~0.base) .cse4) (select (select .cse3 c_~A~0.base) .cse5)))))) (forall ((~queue~0.base Int) (v_ArrVal_434 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_434))) (let ((.cse6 (select .cse9 ~queue~0.base))) (or (< (select .cse6 .cse7) .cse8) (not (= (select .cse6 .cse4) (select (select .cse9 c_~A~0.base) .cse5))))))))) (or (and (< (select (select |c_#memory_int| c_~queue~0.base) .cse7) .cse8) .cse2) (= (mod |c_thread2Thread1of1ForFork0_~cond~0#1| 256) 0) (<= c_~N~0 c_~i~0)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (or .cse10 (and (or (not (= c_~end~0 0)) (= c_~v_old~0 c_~last~0)) (or .cse11 .cse12))) (or (<= c_~start~0 0) (<= (+ c_~start~0 c_~n~0) (+ c_~end~0 1))) (or .cse0 .cse1 (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse13 .cse2 .cse14 .cse15)) (or .cse10 .cse11 .cse12) (<= c_~new~0 c_~v_old~0) (= c_~ok~0 1) (or (and .cse13 .cse2 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse14 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)) .cse0 .cse1 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (= c_~queue~0.offset 0) (or .cse0 (let ((.cse17 (select (select |c_#memory_int| c_~A~0.base) .cse5))) (and (forall ((~queue~0.base Int)) (let ((.cse16 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse16 .cse4) .cse17)) (< (select .cse16 .cse7) .cse8)))) (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse4) .cse17))) .cse2))) .cse1) .cse15)) is different from false [2023-01-27 22:02:04,393 INFO L130 PetriNetUnfolder]: 10656/18966 cut-off events. [2023-01-27 22:02:04,394 INFO L131 PetriNetUnfolder]: For 541426/541426 co-relation queries the response was YES. [2023-01-27 22:02:04,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194229 conditions, 18966 events. 10656/18966 cut-off events. For 541426/541426 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 150133 event pairs, 645 based on Foata normal form. 15/18981 useless extension candidates. Maximal degree in co-relation 189930. Up to 5643 conditions per place. [2023-01-27 22:02:04,566 INFO L137 encePairwiseOnDemand]: 332/352 looper letters, 873 selfloop transitions, 988 changer transitions 177/2038 dead transitions. [2023-01-27 22:02:04,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 2038 transitions, 41495 flow [2023-01-27 22:02:04,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2023-01-27 22:02:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2023-01-27 22:02:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 6776 transitions. [2023-01-27 22:02:04,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24367088607594936 [2023-01-27 22:02:04,577 INFO L72 ComplementDD]: Start complementDD. Operand 79 states and 6776 transitions. [2023-01-27 22:02:04,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 6776 transitions. [2023-01-27 22:02:04,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:02:04,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 79 states and 6776 transitions. [2023-01-27 22:02:04,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 80 states, 79 states have (on average 85.77215189873418) internal successors, (6776), 79 states have internal predecessors, (6776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:02:04,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 80 states, 80 states have (on average 352.0) internal successors, (28160), 80 states have internal predecessors, (28160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:02:04,608 INFO L81 ComplementDD]: Finished complementDD. Result has 80 states, 80 states have (on average 352.0) internal successors, (28160), 80 states have internal predecessors, (28160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:02:04,609 INFO L175 Difference]: Start difference. First operand has 223 places, 905 transitions, 16515 flow. Second operand 79 states and 6776 transitions. [2023-01-27 22:02:04,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 2038 transitions, 41495 flow [2023-01-27 22:02:07,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 2038 transitions, 41453 flow, removed 21 selfloop flow, removed 0 redundant places. [2023-01-27 22:02:07,700 INFO L231 Difference]: Finished difference. Result has 335 places, 1556 transitions, 32997 flow [2023-01-27 22:02:07,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=16505, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=905, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=435, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=79, PETRI_FLOW=32997, PETRI_PLACES=335, PETRI_TRANSITIONS=1556} [2023-01-27 22:02:07,702 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 310 predicate places. [2023-01-27 22:02:07,702 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 1556 transitions, 32997 flow [2023-01-27 22:02:07,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 82.41379310344827) internal successors, (2390), 29 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:02:07,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:02:07,703 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:02:07,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-27 22:02:07,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-27 22:02:07,909 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:02:07,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:02:07,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2133277279, now seen corresponding path program 4 times [2023-01-27 22:02:07,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:02:07,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154741076] [2023-01-27 22:02:07,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:02:07,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:02:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:02:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:02:09,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:02:09,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154741076] [2023-01-27 22:02:09,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154741076] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:02:09,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487891987] [2023-01-27 22:02:09,064 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 22:02:09,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:02:09,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:02:09,065 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:02:09,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-27 22:02:09,171 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 22:02:09,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:02:09,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 66 conjunts are in the unsatisfiable core [2023-01-27 22:02:09,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:02:09,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:02:09,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:02:09,207 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-27 22:02:09,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-01-27 22:02:09,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 22:02:09,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:02:09,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:02:09,331 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:02:09,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-01-27 22:02:09,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 22:02:09,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 22:02:09,438 INFO L350 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 6 treesize of output 5 [2023-01-27 22:02:09,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:02:09,570 INFO L350 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 14 treesize of output 16 [2023-01-27 22:02:09,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2023-01-27 22:02:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 22:02:09,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:02:10,145 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (< c_~end~0 0) (and (<= c_~N~0 c_~i~0) (<= c_~end~0 c_~start~0)) (< c_~last~0 |c_thread1Thread1of1ForFork1_#t~mem1#1|) (let ((.cse2 (+ c_~A~0.offset (* c_~i~0 4))) (.cse3 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (forall ((v_ArrVal_485 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485))) (let ((.cse0 (select .cse1 c_~queue~0.base))) (or (< (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (+ c_~v_old~0 1)) (not (= (select (select .cse1 c_~A~0.base) .cse2) (select .cse0 .cse3))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_485 (Array Int Int))) (not (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485))) (= (select (select .cse4 c_~A~0.base) .cse2) (select (select .cse4 c_~queue~0.base) .cse3))))))))) is different from false [2023-01-27 22:02:10,182 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset (* c_~i~0 4)))) (or (<= c_~n~0 c_~end~0) (< c_~end~0 0) (< c_~last~0 (select (select |c_#memory_int| c_~A~0.base) .cse0)) (let ((.cse3 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (forall ((v_ArrVal_485 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485))) (let ((.cse1 (select .cse2 c_~queue~0.base))) (or (< (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) (+ c_~v_old~0 1)) (not (= (select (select .cse2 c_~A~0.base) .cse0) (select .cse1 .cse3))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_485 (Array Int Int))) (not (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485))) (= (select (select .cse4 c_~A~0.base) .cse0) (select (select .cse4 c_~queue~0.base) .cse3)))))))))) is different from false [2023-01-27 22:02:10,356 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (< c_~end~0 0) (let ((.cse1 (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (or (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (not (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485))) (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) (select (select .cse0 c_~queue~0.base) .cse2))))) (not (= (mod c_~ok~0 256) 0))) (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484))) (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485))) (let ((.cse3 (select .cse5 c_~queue~0.base))) (or (< (select .cse3 (+ (* c_~start~0 4) c_~queue~0.offset)) (+ 1 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1))) (not (= (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) (select .cse3 .cse2))))))))))) is different from false [2023-01-27 22:02:10,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:02:10,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 83 [2023-01-27 22:02:10,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:02:10,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1160 treesize of output 1120 [2023-01-27 22:02:10,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:02:10,622 INFO L350 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 1112 treesize of output 940 [2023-01-27 22:02:10,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:02:10,652 INFO L350 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 904 treesize of output 804 [2023-01-27 22:02:10,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:02:10,686 INFO L350 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 768 treesize of output 704 [2023-01-27 22:02:13,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:02:13,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 49 [2023-01-27 22:02:13,239 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:02:13,241 INFO L350 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 766 treesize of output 734 [2023-01-27 22:02:13,273 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:02:13,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 362 treesize of output 321 [2023-01-27 22:02:13,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 258 [2023-01-27 22:02:13,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:02:13,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 229 [2023-01-27 22:02:13,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2023-01-27 22:02:13,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487891987] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:02:13,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:02:13,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 33 [2023-01-27 22:02:13,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471235772] [2023-01-27 22:02:13,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:02:13,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-27 22:02:13,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:02:13,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-27 22:02:13,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=804, Unknown=13, NotChecked=186, Total=1190 [2023-01-27 22:02:13,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 352 [2023-01-27 22:02:13,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 1556 transitions, 32997 flow. Second operand has 35 states, 35 states have (on average 79.08571428571429) internal successors, (2768), 35 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:02:13,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:02:13,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 352 [2023-01-27 22:02:13,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:02:25,015 INFO L130 PetriNetUnfolder]: 11719/20212 cut-off events. [2023-01-27 22:02:25,015 INFO L131 PetriNetUnfolder]: For 790978/790978 co-relation queries the response was YES. [2023-01-27 22:02:25,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236805 conditions, 20212 events. 11719/20212 cut-off events. For 790978/790978 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 154551 event pairs, 1556 based on Foata normal form. 1/20213 useless extension candidates. Maximal degree in co-relation 236631. Up to 8776 conditions per place. [2023-01-27 22:02:25,247 INFO L137 encePairwiseOnDemand]: 337/352 looper letters, 1304 selfloop transitions, 648 changer transitions 18/1970 dead transitions. [2023-01-27 22:02:25,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 1970 transitions, 46301 flow [2023-01-27 22:02:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-01-27 22:02:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-01-27 22:02:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2894 transitions. [2023-01-27 22:02:25,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2349025974025974 [2023-01-27 22:02:25,253 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 2894 transitions. [2023-01-27 22:02:25,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 2894 transitions. [2023-01-27 22:02:25,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:02:25,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2894 transitions. [2023-01-27 22:02:25,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 82.68571428571428) internal successors, (2894), 35 states have internal predecessors, (2894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:02:25,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 352.0) internal successors, (12672), 36 states have internal predecessors, (12672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:02:25,266 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 352.0) internal successors, (12672), 36 states have internal predecessors, (12672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:02:25,266 INFO L175 Difference]: Start difference. First operand has 335 places, 1556 transitions, 32997 flow. Second operand 35 states and 2894 transitions. [2023-01-27 22:02:25,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 1970 transitions, 46301 flow [2023-01-27 22:02:31,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 1970 transitions, 43874 flow, removed 632 selfloop flow, removed 29 redundant places. [2023-01-27 22:02:31,221 INFO L231 Difference]: Finished difference. Result has 328 places, 1758 transitions, 37981 flow [2023-01-27 22:02:31,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=31102, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=451, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=962, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=37981, PETRI_PLACES=328, PETRI_TRANSITIONS=1758} [2023-01-27 22:02:31,222 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 303 predicate places. [2023-01-27 22:02:31,222 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 1758 transitions, 37981 flow [2023-01-27 22:02:31,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 79.08571428571429) internal successors, (2768), 35 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:02:31,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:02:31,223 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:02:31,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-27 22:02:31,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-01-27 22:02:31,424 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:02:31,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:02:31,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1960233746, now seen corresponding path program 6 times [2023-01-27 22:02:31,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:02:31,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504177275] [2023-01-27 22:02:31,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:02:31,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:02:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:02:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:02:32,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:02:32,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504177275] [2023-01-27 22:02:32,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504177275] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:02:32,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432060659] [2023-01-27 22:02:32,950 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 22:02:32,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:02:32,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:02:32,951 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:02:32,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-27 22:02:33,073 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-27 22:02:33,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:02:33,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 48 conjunts are in the unsatisfiable core [2023-01-27 22:02:33,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:02:33,098 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-01-27 22:02:33,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2023-01-27 22:02:33,164 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:02:33,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-27 22:02:33,250 INFO L350 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 18 treesize of output 20 [2023-01-27 22:02:33,422 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-01-27 22:02:33,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2023-01-27 22:02:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-01-27 22:02:33,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:02:36,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:02:36,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 273 [2023-01-27 22:02:36,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:02:36,103 INFO L350 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 174 treesize of output 185 [2023-01-27 22:02:36,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:02:36,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 137 [2023-01-27 22:02:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-01-27 22:02:37,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432060659] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:02:37,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:02:37,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 31 [2023-01-27 22:02:37,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150870475] [2023-01-27 22:02:37,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:02:37,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-27 22:02:37,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:02:37,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-27 22:02:37,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=907, Unknown=1, NotChecked=0, Total=1056 [2023-01-27 22:02:37,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 352 [2023-01-27 22:02:37,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 1758 transitions, 37981 flow. Second operand has 33 states, 33 states have (on average 83.03030303030303) internal successors, (2740), 33 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:02:37,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:02:37,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 352 [2023-01-27 22:02:37,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:02:49,013 INFO L130 PetriNetUnfolder]: 14127/24371 cut-off events. [2023-01-27 22:02:49,013 INFO L131 PetriNetUnfolder]: For 974046/974046 co-relation queries the response was YES. [2023-01-27 22:02:49,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285155 conditions, 24371 events. 14127/24371 cut-off events. For 974046/974046 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 191134 event pairs, 841 based on Foata normal form. 14/24385 useless extension candidates. Maximal degree in co-relation 284998. Up to 7300 conditions per place. [2023-01-27 22:02:49,312 INFO L137 encePairwiseOnDemand]: 336/352 looper letters, 1097 selfloop transitions, 1091 changer transitions 64/2252 dead transitions. [2023-01-27 22:02:49,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 2252 transitions, 52388 flow [2023-01-27 22:02:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-01-27 22:02:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-01-27 22:02:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2016 transitions. [2023-01-27 22:02:49,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2490118577075099 [2023-01-27 22:02:49,316 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2016 transitions. [2023-01-27 22:02:49,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2016 transitions. [2023-01-27 22:02:49,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:02:49,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2016 transitions. [2023-01-27 22:02:49,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 87.65217391304348) internal successors, (2016), 23 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:02:49,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 352.0) internal successors, (8448), 24 states have internal predecessors, (8448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:02:49,324 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 352.0) internal successors, (8448), 24 states have internal predecessors, (8448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:02:49,324 INFO L175 Difference]: Start difference. First operand has 328 places, 1758 transitions, 37981 flow. Second operand 23 states and 2016 transitions. [2023-01-27 22:02:49,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 2252 transitions, 52388 flow [2023-01-27 22:02:55,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 2252 transitions, 51908 flow, removed 212 selfloop flow, removed 12 redundant places. [2023-01-27 22:02:55,608 INFO L231 Difference]: Finished difference. Result has 344 places, 2013 transitions, 46832 flow [2023-01-27 22:02:55,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=37577, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=842, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=747, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=46832, PETRI_PLACES=344, PETRI_TRANSITIONS=2013} [2023-01-27 22:02:55,610 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 319 predicate places. [2023-01-27 22:02:55,610 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 2013 transitions, 46832 flow [2023-01-27 22:02:55,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 83.03030303030303) internal successors, (2740), 33 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:02:55,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:02:55,610 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:02:55,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-27 22:02:55,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-27 22:02:55,816 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:02:55,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:02:55,817 INFO L85 PathProgramCache]: Analyzing trace with hash 424868804, now seen corresponding path program 7 times [2023-01-27 22:02:55,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:02:55,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462999513] [2023-01-27 22:02:55,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:02:55,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:02:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:02:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-27 22:02:55,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:02:55,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462999513] [2023-01-27 22:02:55,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462999513] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:02:55,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697727891] [2023-01-27 22:02:55,929 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 22:02:55,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:02:55,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:02:55,930 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:02:55,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-27 22:02:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:02:56,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 22:02:56,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:02:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-27 22:02:56,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:02:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-27 22:02:56,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697727891] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:02:56,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:02:56,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-01-27 22:02:56,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842480057] [2023-01-27 22:02:56,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:02:56,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-27 22:02:56,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:02:56,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-27 22:02:56,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-01-27 22:02:56,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 352 [2023-01-27 22:02:56,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 2013 transitions, 46832 flow. Second operand has 12 states, 12 states have (on average 134.75) internal successors, (1617), 12 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:02:56,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:02:56,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 352 [2023-01-27 22:02:56,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:03:04,587 INFO L130 PetriNetUnfolder]: 10169/17603 cut-off events. [2023-01-27 22:03:04,588 INFO L131 PetriNetUnfolder]: For 771090/771090 co-relation queries the response was YES. [2023-01-27 22:03:04,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214376 conditions, 17603 events. 10169/17603 cut-off events. For 771090/771090 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 131069 event pairs, 3503 based on Foata normal form. 251/17854 useless extension candidates. Maximal degree in co-relation 214245. Up to 15146 conditions per place. [2023-01-27 22:03:04,788 INFO L137 encePairwiseOnDemand]: 348/352 looper letters, 1045 selfloop transitions, 3 changer transitions 578/1626 dead transitions. [2023-01-27 22:03:04,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 1626 transitions, 41366 flow [2023-01-27 22:03:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 22:03:04,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 22:03:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 836 transitions. [2023-01-27 22:03:04,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2023-01-27 22:03:04,789 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 836 transitions. [2023-01-27 22:03:04,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 836 transitions. [2023-01-27 22:03:04,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:03:04,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 836 transitions. [2023-01-27 22:03:04,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.33333333333334) internal successors, (836), 6 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:03:04,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:03:04,792 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:03:04,792 INFO L175 Difference]: Start difference. First operand has 344 places, 2013 transitions, 46832 flow. Second operand 6 states and 836 transitions. [2023-01-27 22:03:04,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 1626 transitions, 41366 flow [2023-01-27 22:03:09,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 1626 transitions, 39901 flow, removed 334 selfloop flow, removed 17 redundant places. [2023-01-27 22:03:09,153 INFO L231 Difference]: Finished difference. Result has 323 places, 1048 transitions, 23496 flow [2023-01-27 22:03:09,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=36007, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=23496, PETRI_PLACES=323, PETRI_TRANSITIONS=1048} [2023-01-27 22:03:09,154 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 298 predicate places. [2023-01-27 22:03:09,154 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 1048 transitions, 23496 flow [2023-01-27 22:03:09,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 134.75) internal successors, (1617), 12 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:03:09,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:03:09,154 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:03:09,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-27 22:03:09,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-27 22:03:09,361 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:03:09,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:03:09,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1795058258, now seen corresponding path program 8 times [2023-01-27 22:03:09,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:03:09,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772963080] [2023-01-27 22:03:09,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:03:09,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:03:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:03:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:03:10,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:03:10,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772963080] [2023-01-27 22:03:10,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772963080] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:03:10,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169396238] [2023-01-27 22:03:10,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:03:10,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:03:10,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:03:10,769 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:03:10,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-27 22:03:10,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:03:10,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:03:10,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 55 conjunts are in the unsatisfiable core [2023-01-27 22:03:10,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:03:11,795 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:03:11,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:03:11,797 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:03:11,840 INFO L321 Elim1Store]: treesize reduction 111, result has 31.9 percent of original size [2023-01-27 22:03:11,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 67 [2023-01-27 22:03:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:03:11,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:03:13,580 INFO L321 Elim1Store]: treesize reduction 144, result has 85.6 percent of original size [2023-01-27 22:03:13,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 235 treesize of output 913 [2023-01-27 22:05:22,122 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:32,442 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:41,728 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:41,780 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:44,493 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:45,978 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:49,676 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:50,231 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:50,333 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:50,433 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:05:50,481 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:50,493 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:50,609 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:50,762 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:51,356 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:51,924 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:05:52,032 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:53,282 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:54,016 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:54,262 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:54,466 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:54,495 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:05:54,518 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:54,542 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:05:54,567 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:06:11,555 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:06:12,647 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:06:30,492 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:06:34,707 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:07:40,795 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:07:42,311 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:08:32,613 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:08:34,150 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:08:37,322 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:08:54,345 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:08:56,066 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:08:57,318 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:08:59,006 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:03,100 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:04,245 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:16,724 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:26,921 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:27,518 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:09:30,466 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:32,533 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:33,315 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:34,355 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:09:36,968 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:49,703 WARN L222 SmtUtils]: Spent 5.65s on a formula simplification. DAG size of input: 1047 DAG size of output: 1373 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-01-27 22:09:52,040 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:52,145 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:09:52,480 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:52,608 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:09:53,045 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:53,175 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:09:54,348 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:55,906 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:56,160 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:56,724 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:57,824 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:58,497 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:09:58,766 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:59,263 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:09:59,582 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:09:59,729 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:10:00,437 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:10:00,627 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:10:01,056 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:10:02,683 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:10:21,315 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:10:31,397 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:10:32,740 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:10:35,916 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:10:38,772 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:10:49,114 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:10:49,928 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:10:58,838 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:11:00,423 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:11:01,078 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:11:18,315 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:11:24,647 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:11:25,733 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:11:26,079 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:11:26,575 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:11:26,701 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:11:27,067 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:11:27,170 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:11:27,725 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:11:28,460 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:11:30,214 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:11:53,492 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:11:57,302 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:12:05,785 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:12:12,546 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:12:13,569 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:12:24,814 WARN L222 SmtUtils]: Spent 5.18s on a formula simplification. DAG size of input: 1038 DAG size of output: 1362 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-01-27 22:12:27,091 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:12:27,345 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:12:27,668 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:12:27,874 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:12:27,917 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:12:32,044 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:12:46,514 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:12:48,460 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:12:49,052 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:13:00,198 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:13:00,508 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:13:00,604 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:13:01,597 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:13:03,063 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:13:04,293 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:13:05,122 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:13:05,710 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:13:08,195 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:13:12,924 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:13:26,634 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:13:26,852 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:13:27,147 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:13:27,332 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-27 22:13:27,370 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:13:33,058 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-27 22:14:06,271 WARN L222 SmtUtils]: Spent 20.64s on a formula simplification. DAG size of input: 1583 DAG size of output: 2197 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-01-27 22:14:07,388 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 22:14:07,388 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-01-27 22:14:07,393 WARN L238 SmtUtils]: Removed 1 from assertion stack [2023-01-27 22:14:07,395 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-01-27 22:14:07,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-01-27 22:14:07,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-01-27 22:14:07,603 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-3-4-10-7-11-7-9-8-7-7-8-10-6-7-7-7-5-6-4-6-3-6-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-50-7-7-7-11-7-9-7-8-7-7-10-6-7-7-7-5-6-4-6-3-6-2-2-1 context. [2023-01-27 22:14:07,605 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-01-27 22:14:07,605 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-01-27 22:14:07,605 INFO L445 BasicCegarLoop]: Path program histogram: [8, 4, 2, 1, 1, 1, 1] [2023-01-27 22:14:07,608 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 22:14:07,608 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 22:14:07,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 10:14:07 BasicIcfg [2023-01-27 22:14:07,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 22:14:07,612 INFO L158 Benchmark]: Toolchain (without parser) took 815725.31ms. Allocated memory was 388.0MB in the beginning and 9.0GB in the end (delta: 8.6GB). Free memory was 347.5MB in the beginning and 1.7GB in the end (delta: -1.3GB). Peak memory consumption was 8.1GB. Max. memory is 16.0GB. [2023-01-27 22:14:07,612 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 388.0MB. Free memory is still 336.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 22:14:07,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.41ms. Allocated memory is still 388.0MB. Free memory was 347.3MB in the beginning and 335.5MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-27 22:14:07,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.54ms. Allocated memory is still 388.0MB. Free memory was 335.5MB in the beginning and 333.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 22:14:07,614 INFO L158 Benchmark]: Boogie Preprocessor took 23.12ms. Allocated memory is still 388.0MB. Free memory was 333.5MB in the beginning and 331.5MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-27 22:14:07,614 INFO L158 Benchmark]: RCFGBuilder took 596.56ms. Allocated memory is still 388.0MB. Free memory was 331.5MB in the beginning and 306.2MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-27 22:14:07,615 INFO L158 Benchmark]: TraceAbstraction took 814873.05ms. Allocated memory was 388.0MB in the beginning and 9.0GB in the end (delta: 8.6GB). Free memory was 305.6MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 8.0GB. Max. memory is 16.0GB. [2023-01-27 22:14:07,616 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 388.0MB. Free memory is still 336.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 191.41ms. Allocated memory is still 388.0MB. Free memory was 347.3MB in the beginning and 335.5MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 36.54ms. Allocated memory is still 388.0MB. Free memory was 335.5MB in the beginning and 333.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 23.12ms. Allocated memory is still 388.0MB. Free memory was 333.5MB in the beginning and 331.5MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 596.56ms. Allocated memory is still 388.0MB. Free memory was 331.5MB in the beginning and 306.2MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 814873.05ms. Allocated memory was 388.0MB in the beginning and 9.0GB in the end (delta: 8.6GB). Free memory was 305.6MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 8.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 160 PlacesBefore, 25 PlacesAfterwards, 168 TransitionsBefore, 23 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 7 FixpointIterations, 111 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 5 ConcurrentYvCompositions, 10 ChoiceCompositions, 174 TotalNumberOfCompositions, 1199 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 924, independent: 858, independent conditional: 0, independent unconditional: 858, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 386, independent: 376, independent conditional: 0, independent unconditional: 376, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 924, independent: 482, independent conditional: 0, independent unconditional: 482, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 386, unknown conditional: 0, unknown unconditional: 386] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-3-4-10-7-11-7-9-8-7-7-8-10-6-7-7-7-5-6-4-6-3-6-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-50-7-7-7-11-7-9-7-8-7-7-10-6-7-7-7-5-6-4-6-3-6-2-2-1 context. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-3-4-10-7-11-7-9-8-7-7-8-10-6-7-7-7-5-6-4-6-3-6-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-50-7-7-7-11-7-9-7-8-7-7-10-6-7-7-7-5-6-4-6-3-6-2-2-1 context. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-3-4-10-7-11-7-9-8-7-7-8-10-6-7-7-7-5-6-4-6-3-6-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-50-7-7-7-11-7-9-7-8-7-7-10-6-7-7-7-5-6-4-6-3-6-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 188 locations, 3 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: 814.7s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 116.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 94 mSolverCounterUnknown, 2940 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2940 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2013 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 462 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8687 IncrementalHoareTripleChecker+Invalid, 11256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 462 mSolverCounterUnsat, 5 mSDtfsCounter, 8687 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 866 GetRequests, 387 SyntacticMatches, 16 SemanticMatches, 463 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 7899 ImplicationChecksByTransitivity, 32.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46832occurred in iteration=16, InterpolantAutomatonStates: 323, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 866 ConstructedInterpolants, 57 QuantifiedInterpolants, 12375 SizeOfPredicates, 160 NumberOfNonLiveVariables, 3073 ConjunctsInSsa, 327 ConjunctsInUnsatCore, 40 InterpolantComputations, 7 PerfectInterpolantSequences, 153/265 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