/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-min-max-inc-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 21:44:13,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 21:44:13,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 21:44:13,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 21:44:13,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 21:44:13,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 21:44:13,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 21:44:13,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 21:44:13,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 21:44:13,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 21:44:13,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 21:44:13,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 21:44:13,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 21:44:13,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 21:44:13,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 21:44:13,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 21:44:13,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 21:44:13,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 21:44:13,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 21:44:13,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 21:44:13,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 21:44:13,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 21:44:13,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 21:44:13,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 21:44:13,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 21:44:13,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 21:44:13,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 21:44:13,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 21:44:13,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 21:44:13,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 21:44:13,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 21:44:13,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 21:44:13,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 21:44:13,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 21:44:13,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 21:44:13,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 21:44:13,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 21:44:13,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 21:44:13,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 21:44:13,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 21:44:13,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 21:44:13,508 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 21:44:13,529 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 21:44:13,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 21:44:13,530 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 21:44:13,530 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 21:44:13,531 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 21:44:13,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 21:44:13,531 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 21:44:13,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 21:44:13,531 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 21:44:13,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 21:44:13,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 21:44:13,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 21:44:13,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 21:44:13,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 21:44:13,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 21:44:13,532 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 21:44:13,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 21:44:13,532 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 21:44:13,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 21:44:13,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 21:44:13,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 21:44:13,533 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 21:44:13,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 21:44:13,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 21:44:13,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 21:44:13,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 21:44:13,533 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 21:44:13,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 21:44:13,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 21:44:13,534 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 21:44:13,534 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 21:44:13,534 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 21:44:13,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 21:44:13,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 21:44:13,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 21:44:13,750 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 21:44:13,755 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 21:44:13,755 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c [2023-01-27 21:44:14,755 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 21:44:14,880 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 21:44:14,880 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c [2023-01-27 21:44:14,884 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7ad1b45/9e7f68eb04804f65aeecbf363e98b506/FLAG00336510d [2023-01-27 21:44:14,893 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7ad1b45/9e7f68eb04804f65aeecbf363e98b506 [2023-01-27 21:44:14,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 21:44:14,895 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 21:44:14,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 21:44:14,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 21:44:14,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 21:44:14,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 09:44:14" (1/1) ... [2023-01-27 21:44:14,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e66568e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:44:14, skipping insertion in model container [2023-01-27 21:44:14,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 09:44:14" (1/1) ... [2023-01-27 21:44:14,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 21:44:14,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 21:44:15,015 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-min-max-inc-dec.wvr.c[3271,3284] [2023-01-27 21:44:15,020 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 21:44:15,025 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 21:44:15,041 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-min-max-inc-dec.wvr.c[3271,3284] [2023-01-27 21:44:15,043 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 21:44:15,048 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 21:44:15,048 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 21:44:15,052 INFO L208 MainTranslator]: Completed translation [2023-01-27 21:44:15,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:44:15 WrapperNode [2023-01-27 21:44:15,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 21:44:15,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 21:44:15,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 21:44:15,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 21:44:15,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:44:15" (1/1) ... [2023-01-27 21:44:15,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:44:15" (1/1) ... [2023-01-27 21:44:15,077 INFO L138 Inliner]: procedures = 27, calls = 75, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 176 [2023-01-27 21:44:15,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 21:44:15,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 21:44:15,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 21:44:15,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 21:44:15,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:44:15" (1/1) ... [2023-01-27 21:44:15,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:44:15" (1/1) ... [2023-01-27 21:44:15,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:44:15" (1/1) ... [2023-01-27 21:44:15,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:44:15" (1/1) ... [2023-01-27 21:44:15,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:44:15" (1/1) ... [2023-01-27 21:44:15,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:44:15" (1/1) ... [2023-01-27 21:44:15,104 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:44:15" (1/1) ... [2023-01-27 21:44:15,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:44:15" (1/1) ... [2023-01-27 21:44:15,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 21:44:15,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 21:44:15,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 21:44:15,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 21:44:15,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:44:15" (1/1) ... [2023-01-27 21:44:15,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 21:44:15,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:44:15,127 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 21:44:15,133 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 21:44:15,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 21:44:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 21:44:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 21:44:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 21:44:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 21:44:15,153 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 21:44:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 21:44:15,153 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 21:44:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-27 21:44:15,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-27 21:44:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-01-27 21:44:15,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-01-27 21:44:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 21:44:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-01-27 21:44:15,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-01-27 21:44:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 21:44:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 21:44:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-27 21:44:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 21:44:15,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 21:44:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 21:44:15,155 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 21:44:15,223 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 21:44:15,224 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 21:44:15,523 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 21:44:15,633 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 21:44:15,634 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-01-27 21:44:15,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 09:44:15 BoogieIcfgContainer [2023-01-27 21:44:15,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 21:44:15,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 21:44:15,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 21:44:15,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 21:44:15,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 09:44:14" (1/3) ... [2023-01-27 21:44:15,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43510bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 09:44:15, skipping insertion in model container [2023-01-27 21:44:15,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:44:15" (2/3) ... [2023-01-27 21:44:15,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43510bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 09:44:15, skipping insertion in model container [2023-01-27 21:44:15,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 09:44:15" (3/3) ... [2023-01-27 21:44:15,640 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc-dec.wvr.c [2023-01-27 21:44:15,651 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 21:44:15,651 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 21:44:15,652 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 21:44:15,734 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2023-01-27 21:44:15,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 185 transitions, 410 flow [2023-01-27 21:44:15,829 INFO L130 PetriNetUnfolder]: 14/180 cut-off events. [2023-01-27 21:44:15,830 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-01-27 21:44:15,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 180 events. 14/180 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 133 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2023-01-27 21:44:15,835 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 185 transitions, 410 flow [2023-01-27 21:44:15,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 166 transitions, 362 flow [2023-01-27 21:44:15,843 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 21:44:15,852 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 166 transitions, 362 flow [2023-01-27 21:44:15,853 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 166 transitions, 362 flow [2023-01-27 21:44:15,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 166 transitions, 362 flow [2023-01-27 21:44:15,889 INFO L130 PetriNetUnfolder]: 14/166 cut-off events. [2023-01-27 21:44:15,889 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-01-27 21:44:15,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 166 events. 14/166 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 134 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2023-01-27 21:44:15,894 INFO L119 LiptonReduction]: Number of co-enabled transitions 3806 [2023-01-27 21:44:21,639 INFO L134 LiptonReduction]: Checked pairs total: 5582 [2023-01-27 21:44:21,639 INFO L136 LiptonReduction]: Total number of compositions: 149 [2023-01-27 21:44:21,655 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 21:44:21,660 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;@741ed005, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 21:44:21,660 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 21:44:21,683 INFO L130 PetriNetUnfolder]: 5/37 cut-off events. [2023-01-27 21:44:21,683 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-01-27 21:44:21,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:44:21,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:44:21,684 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 21:44:21,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:44:21,687 INFO L85 PathProgramCache]: Analyzing trace with hash 177751736, now seen corresponding path program 1 times [2023-01-27 21:44:21,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:44:21,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012624027] [2023-01-27 21:44:21,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:44:21,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:44:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:44:22,062 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 21:44:22,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:44:22,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012624027] [2023-01-27 21:44:22,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012624027] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:44:22,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:44:22,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 21:44:22,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938415651] [2023-01-27 21:44:22,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:44:22,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 21:44:22,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:44:22,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 21:44:22,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 21:44:22,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 334 [2023-01-27 21:44:22,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 21:44:22,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:44:22,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 334 [2023-01-27 21:44:22,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:44:22,686 INFO L130 PetriNetUnfolder]: 6110/7594 cut-off events. [2023-01-27 21:44:22,686 INFO L131 PetriNetUnfolder]: For 359/359 co-relation queries the response was YES. [2023-01-27 21:44:22,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15782 conditions, 7594 events. 6110/7594 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 30132 event pairs, 2980 based on Foata normal form. 0/5304 useless extension candidates. Maximal degree in co-relation 13404. Up to 6012 conditions per place. [2023-01-27 21:44:22,725 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 52 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2023-01-27 21:44:22,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 266 flow [2023-01-27 21:44:22,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 21:44:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 21:44:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2023-01-27 21:44:22,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47305389221556887 [2023-01-27 21:44:22,739 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 632 transitions. [2023-01-27 21:44:22,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 632 transitions. [2023-01-27 21:44:22,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:44:22,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 632 transitions. [2023-01-27 21:44:22,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 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 21:44:22,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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 21:44:22,753 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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 21:44:22,754 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 106 flow. Second operand 4 states and 632 transitions. [2023-01-27 21:44:22,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 266 flow [2023-01-27 21:44:22,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 10 redundant places. [2023-01-27 21:44:22,767 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 100 flow [2023-01-27 21:44:22,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-01-27 21:44:22,772 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2023-01-27 21:44:22,772 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 100 flow [2023-01-27 21:44:22,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 21:44:22,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:44:22,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:44:22,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 21:44:22,773 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 21:44:22,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:44:22,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2063376111, now seen corresponding path program 1 times [2023-01-27 21:44:22,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:44:22,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883315953] [2023-01-27 21:44:22,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:44:22,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:44:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:44:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:44:22,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:44:22,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883315953] [2023-01-27 21:44:22,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883315953] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:44:22,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:44:22,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 21:44:22,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139590688] [2023-01-27 21:44:22,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:44:22,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 21:44:22,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:44:22,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 21:44:22,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 21:44:22,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 334 [2023-01-27 21:44:22,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 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 21:44:22,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:44:22,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 334 [2023-01-27 21:44:22,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:44:23,412 INFO L130 PetriNetUnfolder]: 7432/9228 cut-off events. [2023-01-27 21:44:23,412 INFO L131 PetriNetUnfolder]: For 1669/1669 co-relation queries the response was YES. [2023-01-27 21:44:23,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20378 conditions, 9228 events. 7432/9228 cut-off events. For 1669/1669 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 37509 event pairs, 3779 based on Foata normal form. 0/6511 useless extension candidates. Maximal degree in co-relation 6677. Up to 7480 conditions per place. [2023-01-27 21:44:23,444 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 54 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2023-01-27 21:44:23,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 268 flow [2023-01-27 21:44:23,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 21:44:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 21:44:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2023-01-27 21:44:23,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47305389221556887 [2023-01-27 21:44:23,445 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 632 transitions. [2023-01-27 21:44:23,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 632 transitions. [2023-01-27 21:44:23,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:44:23,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 632 transitions. [2023-01-27 21:44:23,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 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 21:44:23,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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 21:44:23,449 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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 21:44:23,449 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 100 flow. Second operand 4 states and 632 transitions. [2023-01-27 21:44:23,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 268 flow [2023-01-27 21:44:23,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 258 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-27 21:44:23,451 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 108 flow [2023-01-27 21:44:23,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-01-27 21:44:23,452 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2023-01-27 21:44:23,452 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 108 flow [2023-01-27 21:44:23,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 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 21:44:23,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:44:23,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:44:23,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 21:44:23,453 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 21:44:23,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:44:23,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1327335702, now seen corresponding path program 1 times [2023-01-27 21:44:23,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:44:23,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728037950] [2023-01-27 21:44:23,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:44:23,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:44:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:44:23,520 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 21:44:23,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:44:23,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728037950] [2023-01-27 21:44:23,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728037950] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:44:23,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:44:23,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 21:44:23,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648204328] [2023-01-27 21:44:23,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:44:23,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 21:44:23,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:44:23,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 21:44:23,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 21:44:23,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 334 [2023-01-27 21:44:23,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 152.5) internal successors, (610), 4 states have internal predecessors, (610), 0 states have call successors, (0), 0 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 21:44:23,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:44:23,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 334 [2023-01-27 21:44:23,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:44:24,071 INFO L130 PetriNetUnfolder]: 9317/11685 cut-off events. [2023-01-27 21:44:24,071 INFO L131 PetriNetUnfolder]: For 2961/2961 co-relation queries the response was YES. [2023-01-27 21:44:24,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27111 conditions, 11685 events. 9317/11685 cut-off events. For 2961/2961 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 47277 event pairs, 4111 based on Foata normal form. 0/8912 useless extension candidates. Maximal degree in co-relation 12566. Up to 8724 conditions per place. [2023-01-27 21:44:24,109 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 59 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-01-27 21:44:24,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 298 flow [2023-01-27 21:44:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 21:44:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 21:44:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 635 transitions. [2023-01-27 21:44:24,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4752994011976048 [2023-01-27 21:44:24,111 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 635 transitions. [2023-01-27 21:44:24,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 635 transitions. [2023-01-27 21:44:24,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:44:24,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 635 transitions. [2023-01-27 21:44:24,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 0 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 21:44:24,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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 21:44:24,115 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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 21:44:24,115 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 108 flow. Second operand 4 states and 635 transitions. [2023-01-27 21:44:24,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 298 flow [2023-01-27 21:44:24,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 288 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-27 21:44:24,117 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 116 flow [2023-01-27 21:44:24,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2023-01-27 21:44:24,118 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2023-01-27 21:44:24,118 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 116 flow [2023-01-27 21:44:24,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.5) internal successors, (610), 4 states have internal predecessors, (610), 0 states have call successors, (0), 0 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 21:44:24,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:44:24,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:44:24,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 21:44:24,119 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 21:44:24,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:44:24,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1929929813, now seen corresponding path program 1 times [2023-01-27 21:44:24,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:44:24,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956661723] [2023-01-27 21:44:24,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:44:24,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:44:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:44:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:44:24,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:44:24,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956661723] [2023-01-27 21:44:24,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956661723] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:44:24,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:44:24,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 21:44:24,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797089941] [2023-01-27 21:44:24,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:44:24,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 21:44:24,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:44:24,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 21:44:24,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 21:44:24,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 334 [2023-01-27 21:44:24,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 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 21:44:24,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:44:24,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 334 [2023-01-27 21:44:24,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:44:24,818 INFO L130 PetriNetUnfolder]: 8748/11085 cut-off events. [2023-01-27 21:44:24,818 INFO L131 PetriNetUnfolder]: For 3227/3953 co-relation queries the response was YES. [2023-01-27 21:44:24,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28117 conditions, 11085 events. 8748/11085 cut-off events. For 3227/3953 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 44716 event pairs, 4945 based on Foata normal form. 726/9683 useless extension candidates. Maximal degree in co-relation 9657. Up to 8498 conditions per place. [2023-01-27 21:44:24,848 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 61 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2023-01-27 21:44:24,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 315 flow [2023-01-27 21:44:24,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 21:44:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 21:44:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 635 transitions. [2023-01-27 21:44:24,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4752994011976048 [2023-01-27 21:44:24,850 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 635 transitions. [2023-01-27 21:44:24,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 635 transitions. [2023-01-27 21:44:24,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:44:24,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 635 transitions. [2023-01-27 21:44:24,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 0 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 21:44:24,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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 21:44:24,853 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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 21:44:24,853 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 116 flow. Second operand 4 states and 635 transitions. [2023-01-27 21:44:24,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 315 flow [2023-01-27 21:44:24,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 306 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-27 21:44:24,856 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 124 flow [2023-01-27 21:44:24,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-01-27 21:44:24,856 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2023-01-27 21:44:24,856 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 124 flow [2023-01-27 21:44:24,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 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 21:44:24,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:44:24,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:44:24,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 21:44:24,857 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 21:44:24,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:44:24,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1825103121, now seen corresponding path program 1 times [2023-01-27 21:44:24,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:44:24,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742071644] [2023-01-27 21:44:24,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:44:24,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:44:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:44:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 21:44:24,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:44:24,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742071644] [2023-01-27 21:44:24,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742071644] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:44:24,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:44:24,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 21:44:24,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30377873] [2023-01-27 21:44:24,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:44:24,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 21:44:24,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:44:24,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 21:44:24,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 21:44:24,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 334 [2023-01-27 21:44:24,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 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 21:44:24,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:44:24,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 334 [2023-01-27 21:44:24,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:44:25,407 INFO L130 PetriNetUnfolder]: 6702/8564 cut-off events. [2023-01-27 21:44:25,407 INFO L131 PetriNetUnfolder]: For 2867/3870 co-relation queries the response was YES. [2023-01-27 21:44:25,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22689 conditions, 8564 events. 6702/8564 cut-off events. For 2867/3870 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 34262 event pairs, 4945 based on Foata normal form. 1003/7780 useless extension candidates. Maximal degree in co-relation 7845. Up to 8499 conditions per place. [2023-01-27 21:44:25,434 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 39 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-01-27 21:44:25,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 208 flow [2023-01-27 21:44:25,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 21:44:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 21:44:25,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2023-01-27 21:44:25,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810379241516966 [2023-01-27 21:44:25,436 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 482 transitions. [2023-01-27 21:44:25,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 482 transitions. [2023-01-27 21:44:25,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:44:25,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 482 transitions. [2023-01-27 21:44:25,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 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 21:44:25,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:44:25,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:44:25,439 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 124 flow. Second operand 3 states and 482 transitions. [2023-01-27 21:44:25,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 208 flow [2023-01-27 21:44:25,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 202 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 21:44:25,442 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 130 flow [2023-01-27 21:44:25,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-01-27 21:44:25,443 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2023-01-27 21:44:25,443 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 130 flow [2023-01-27 21:44:25,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 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 21:44:25,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:44:25,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:44:25,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 21:44:25,443 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 21:44:25,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:44:25,444 INFO L85 PathProgramCache]: Analyzing trace with hash 865740571, now seen corresponding path program 1 times [2023-01-27 21:44:25,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:44:25,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615151404] [2023-01-27 21:44:25,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:44:25,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:44:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:44:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:44:25,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:44:25,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615151404] [2023-01-27 21:44:25,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615151404] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:44:25,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773891757] [2023-01-27 21:44:25,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:44:25,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:44:25,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:44:25,923 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 21:44:25,964 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 21:44:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:44:26,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 50 conjunts are in the unsatisfiable core [2023-01-27 21:44:26,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:44:26,166 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 21:44:26,201 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 21:44:26,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:44:26,288 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 21:44:26,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:44:26,403 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 21 treesize of output 21 [2023-01-27 21:44:26,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-01-27 21:44:26,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:44:26,593 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 23 treesize of output 23 [2023-01-27 21:44:26,664 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 26 treesize of output 14 [2023-01-27 21:44:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:44:26,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:44:27,322 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse0 (select .cse1 c_~A~0.base))) (or (<= 2147483647 v_ArrVal_284) (< v_ArrVal_284 (+ (select .cse0 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse1 c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0) (<= c_~min~0 (+ v_ArrVal_284 1)))))) is different from false [2023-01-27 21:44:27,760 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse0 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) (.cse1 (select .cse2 c_~A~0.base))) (or (< .cse0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (<= 2147483647 v_ArrVal_284) (< .cse0 (+ v_ArrVal_284 3)) (< v_ArrVal_284 (+ (select .cse1 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0)))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse5 (select .cse6 c_~A~0.base))) (or (<= 2147483647 v_ArrVal_284) (<= (select (select .cse4 c_~A~0.base) c_~A~0.offset) (+ v_ArrVal_284 1)) (< v_ArrVal_284 (+ (select .cse5 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse6 c_~A~0.base (store .cse5 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0))))))) is different from false [2023-01-27 21:44:27,861 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse1 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< v_ArrVal_284 (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (<= 2147483647 v_ArrVal_284) (<= (+ (select (select (store (store .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648) 0) (<= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ v_ArrVal_284 1))))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_280))) (let ((.cse7 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse4 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< v_ArrVal_284 (+ (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (<= 2147483647 v_ArrVal_284) (< .cse4 (+ v_ArrVal_284 3)) (<= (+ (select (select (store (store .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648) 0) (< .cse4 (+ (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1))))))))) is different from false [2023-01-27 21:44:27,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:44:27,887 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 120 treesize of output 84 [2023-01-27 21:44:27,895 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 826 treesize of output 814 [2023-01-27 21:44:27,923 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 117 treesize of output 109 [2023-01-27 21:44:27,932 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 84 treesize of output 80 [2023-01-27 21:44:27,942 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 246 treesize of output 230 [2023-01-27 21:44:27,952 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 62 treesize of output 54 [2023-01-27 21:44:28,068 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 21:44:28,068 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 1 [2023-01-27 21:44:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-27 21:44:28,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773891757] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:44:28,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:44:28,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 17] total 41 [2023-01-27 21:44:28,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326293291] [2023-01-27 21:44:28,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:44:28,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-01-27 21:44:28,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:44:28,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-01-27 21:44:28,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1295, Unknown=43, NotChecked=234, Total=1806 [2023-01-27 21:44:28,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 334 [2023-01-27 21:44:28,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 130 flow. Second operand has 43 states, 43 states have (on average 100.65116279069767) internal successors, (4328), 43 states have internal predecessors, (4328), 0 states have call successors, (0), 0 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 21:44:28,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:44:28,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 334 [2023-01-27 21:44:28,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:44:51,076 WARN L222 SmtUtils]: Spent 22.26s on a formula simplification. DAG size of input: 102 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:45:13,504 WARN L222 SmtUtils]: Spent 22.23s on a formula simplification. DAG size of input: 104 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:45:38,606 WARN L222 SmtUtils]: Spent 24.24s on a formula simplification. DAG size of input: 133 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:45:47,914 WARN L222 SmtUtils]: Spent 8.64s on a formula simplification. DAG size of input: 78 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:45:54,825 WARN L222 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:45:56,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:45:58,551 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse7 (+ (* c_thread1Thread1of1ForFork3_~i~0 4) c_~A~0.offset))) (.cse6 (+ 2 c_~A~0.base)) (.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (forall ((v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse1 (select .cse2 c_~A~0.base))) (or (<= 2147483647 v_ArrVal_284) (< v_ArrVal_284 (+ (select .cse1 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0) (<= c_~min~0 (+ v_ArrVal_284 1)))))) (<= .cse3 c_~min~0)) (or (forall ((v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse4 (select .cse5 c_~A~0.base))) (or (<= 2147483647 v_ArrVal_284) (< v_ArrVal_284 (+ (select .cse4 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse5 c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0) (<= .cse3 (+ v_ArrVal_284 1)))))) (< c_~min~0 .cse3)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse6 |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~A~0.offset 0) (<= (select .cse7 0) c_~min~0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|)))) is different from false [2023-01-27 21:46:00,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:46:22,984 WARN L222 SmtUtils]: Spent 22.26s on a formula simplification. DAG size of input: 134 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:46:54,706 WARN L222 SmtUtils]: Spent 26.18s on a formula simplification. DAG size of input: 95 DAG size of output: 93 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:46:56,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:47:16,966 WARN L222 SmtUtils]: Spent 15.59s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:47:23,702 WARN L222 SmtUtils]: Spent 6.58s on a formula simplification. DAG size of input: 82 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:48:08,710 WARN L222 SmtUtils]: Spent 14.08s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:48:10,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:48:12,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:49:21,801 WARN L222 SmtUtils]: Spent 1.05m on a formula simplification. DAG size of input: 119 DAG size of output: 117 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:49:23,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:49:25,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:49:27,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:49:29,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:49:56,865 WARN L222 SmtUtils]: Spent 22.25s on a formula simplification. DAG size of input: 104 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:50:22,154 WARN L222 SmtUtils]: Spent 22.21s on a formula simplification. DAG size of input: 90 DAG size of output: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:50:36,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:50:38,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:50:40,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:50:42,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:50:44,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:51:18,206 WARN L222 SmtUtils]: Spent 28.02s on a formula simplification. DAG size of input: 108 DAG size of output: 106 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:51:20,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:51:22,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:51:24,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:51:26,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:51:37,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:51:39,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:51:41,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:52:20,030 WARN L222 SmtUtils]: Spent 36.43s on a formula simplification. DAG size of input: 120 DAG size of output: 94 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:52:22,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:52:24,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:52:26,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:52:28,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:52:30,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:52:32,629 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse7 (+ (* c_thread1Thread1of1ForFork3_~i~0 4) c_~A~0.offset))) (.cse6 (+ 2 c_~A~0.base)) (.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (forall ((v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse1 (select .cse2 c_~A~0.base))) (or (<= 2147483647 v_ArrVal_284) (< v_ArrVal_284 (+ (select .cse1 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0) (<= c_~min~0 (+ v_ArrVal_284 1)))))) (<= .cse3 c_~min~0)) (or (forall ((v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse4 (select .cse5 c_~A~0.base))) (or (<= 2147483647 v_ArrVal_284) (< v_ArrVal_284 (+ (select .cse4 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse5 c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0) (<= .cse3 (+ v_ArrVal_284 1)))))) (< c_~min~0 .cse3)) (= c_~v_assert~0 1) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse6 |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~A~0.offset 0) (<= (select .cse7 0) c_~min~0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|)))) is different from false [2023-01-27 21:52:55,091 WARN L222 SmtUtils]: Spent 22.28s on a formula simplification. DAG size of input: 106 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:52:57,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:53:14,404 WARN L222 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 84 DAG size of output: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:53:20,922 WARN L222 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 96 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:53:37,660 WARN L222 SmtUtils]: Spent 13.59s on a formula simplification. DAG size of input: 125 DAG size of output: 71 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:53:39,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:53:41,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:53:51,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:54:00,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:54:39,324 WARN L222 SmtUtils]: Spent 36.45s on a formula simplification. DAG size of input: 134 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:54:41,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:54:43,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:54:45,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:54:47,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:54:49,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:55:46,209 WARN L222 SmtUtils]: Spent 40.28s on a formula simplification. DAG size of input: 104 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:55:48,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:55:50,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:55:54,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:55:56,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:55:58,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:56:00,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:56:02,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:56:04,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:56:06,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:56:08,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:56:10,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:56:12,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:56:14,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:56:16,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:56:18,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:56:41,450 WARN L222 SmtUtils]: Spent 22.28s on a formula simplification. DAG size of input: 135 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:57:30,179 WARN L222 SmtUtils]: Spent 38.36s on a formula simplification. DAG size of input: 97 DAG size of output: 95 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:57:32,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:58:22,145 WARN L222 SmtUtils]: Spent 37.23s on a formula simplification. DAG size of input: 117 DAG size of output: 115 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:58:24,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:58:26,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:58:30,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:58:40,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-01-27 21:58:54,515 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 21:58:54,515 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 21:58:54,741 WARN L238 SmtUtils]: Removed 6 from assertion stack [2023-01-27 21:58:54,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2023-01-27 21:58:54,743 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 21:58:54,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-27 21:58:54,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-01-27 21:58:54,944 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 56 for 8052ms.. [2023-01-27 21:58:54,945 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2023-01-27 21:58:54,945 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 21:58:54,945 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 21:58:54,945 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 21:58:54,945 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-01-27 21:58:54,946 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-01-27 21:58:54,948 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 21:58:54,948 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 21:58:54,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 09:58:54 BasicIcfg [2023-01-27 21:58:54,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 21:58:54,949 INFO L158 Benchmark]: Toolchain (without parser) took 880054.67ms. Allocated memory was 526.4MB in the beginning and 820.0MB in the end (delta: 293.6MB). Free memory was 487.2MB in the beginning and 537.2MB in the end (delta: -50.0MB). Peak memory consumption was 246.6MB. Max. memory is 16.0GB. [2023-01-27 21:58:54,950 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 375.4MB. Free memory is still 324.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 21:58:54,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.81ms. Allocated memory is still 526.4MB. Free memory was 487.0MB in the beginning and 474.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-27 21:58:54,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.79ms. Allocated memory is still 526.4MB. Free memory was 474.7MB in the beginning and 472.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 21:58:54,950 INFO L158 Benchmark]: Boogie Preprocessor took 29.29ms. Allocated memory is still 526.4MB. Free memory was 472.5MB in the beginning and 470.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 21:58:54,950 INFO L158 Benchmark]: RCFGBuilder took 527.59ms. Allocated memory is still 526.4MB. Free memory was 470.4MB in the beginning and 442.6MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-01-27 21:58:54,950 INFO L158 Benchmark]: TraceAbstraction took 879312.57ms. Allocated memory was 526.4MB in the beginning and 820.0MB in the end (delta: 293.6MB). Free memory was 441.9MB in the beginning and 537.2MB in the end (delta: -95.3MB). Peak memory consumption was 200.4MB. Max. memory is 16.0GB. [2023-01-27 21:58:54,954 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.10ms. Allocated memory is still 375.4MB. Free memory is still 324.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 156.81ms. Allocated memory is still 526.4MB. Free memory was 487.0MB in the beginning and 474.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 24.79ms. Allocated memory is still 526.4MB. Free memory was 474.7MB in the beginning and 472.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.29ms. Allocated memory is still 526.4MB. Free memory was 472.5MB in the beginning and 470.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 527.59ms. Allocated memory is still 526.4MB. Free memory was 470.4MB in the beginning and 442.6MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 879312.57ms. Allocated memory was 526.4MB in the beginning and 820.0MB in the end (delta: 293.6MB). Free memory was 441.9MB in the beginning and 537.2MB in the end (delta: -95.3MB). Peak memory consumption was 200.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 168 PlacesBefore, 49 PlacesAfterwards, 166 TransitionsBefore, 38 TransitionsAfterwards, 3806 CoEnabledTransitionPairs, 7 FixpointIterations, 71 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 15 TrivialYvCompositions, 8 ConcurrentYvCompositions, 9 ChoiceCompositions, 149 TotalNumberOfCompositions, 5582 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4110, independent: 4006, independent conditional: 0, independent unconditional: 4006, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2015, independent: 1975, independent conditional: 0, independent unconditional: 1975, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4110, independent: 2031, independent conditional: 0, independent unconditional: 2031, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 2015, unknown conditional: 0, unknown unconditional: 2015] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 155, Positive conditional cache size: 0, Positive unconditional cache size: 155, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 134]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 56 for 8052ms.. - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 56 for 8052ms.. - TimeoutResultAtElement [Line: 125]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 56 for 8052ms.. - TimeoutResultAtElement [Line: 124]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 56 for 8052ms.. - TimeoutResultAtElement [Line: 123]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 56 for 8052ms.. - TimeoutResultAtElement [Line: 122]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 56 for 8052ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 221 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 879.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 869.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 97 mSolverCounterUnknown, 1398 SdHoareTripleChecker+Valid, 118.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1398 mSDsluCounter, 553 SdHoareTripleChecker+Invalid, 117.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4658 IncrementalHoareTripleChecker+Unchecked, 514 mSDsCounter, 272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5151 IncrementalHoareTripleChecker+Invalid, 10178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 272 mSolverCounterUnsat, 39 mSDtfsCounter, 5151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 47 SyntacticMatches, 27 SemanticMatches, 176 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12311 ImplicationChecksByTransitivity, 734.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=5, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 281 ConstructedInterpolants, 16 QuantifiedInterpolants, 2999 SizeOfPredicates, 20 NumberOfNonLiveVariables, 362 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 14/25 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