/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-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/triangular-longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:05:56,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:05:56,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:05:56,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:05:56,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:05:56,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:05:56,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:05:56,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:05:56,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:05:56,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:05:56,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:05:56,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:05:56,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:05:56,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:05:56,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:05:56,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:05:56,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:05:56,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:05:56,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:05:56,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:05:56,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:05:56,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:05:56,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:05:56,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:05:56,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:05:56,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:05:56,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:05:56,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:05:56,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:05:56,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:05:56,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:05:56,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:05:56,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:05:56,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:05:56,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:05:56,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:05:56,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:05:56,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:05:56,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:05:56,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:05:56,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:05:56,959 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-NoLbe-Before.epf [2022-01-19 04:05:56,993 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:05:56,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:05:56,995 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:05:56,995 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:05:56,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:05:56,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:05:56,995 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:05:56,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:05:56,996 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:05:56,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:05:56,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:05:56,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:05:56,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:05:56,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:05:56,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:05:56,997 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:05:56,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:05:56,998 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:05:56,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:05:56,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:05:56,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:05:56,998 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:05:56,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:05:56,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:05:56,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:05:56,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:05:56,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:05:56,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:05:56,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:05:56,999 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:05:57,000 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:05:57,000 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:05:57,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-01-19 04:05:57,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:05:57,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:05:57,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:05:57,272 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:05:57,272 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:05:57,273 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2022-01-19 04:05:57,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33faeab29/8c1c989c14c041e68c5701f4f08569ba/FLAGbca182169 [2022-01-19 04:05:57,754 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:05:57,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2022-01-19 04:05:57,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33faeab29/8c1c989c14c041e68c5701f4f08569ba/FLAGbca182169 [2022-01-19 04:05:58,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33faeab29/8c1c989c14c041e68c5701f4f08569ba [2022-01-19 04:05:58,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:05:58,102 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:05:58,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:05:58,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:05:58,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:05:58,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:05:58" (1/1) ... [2022-01-19 04:05:58,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e5fef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:05:58, skipping insertion in model container [2022-01-19 04:05:58,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:05:58" (1/1) ... [2022-01-19 04:05:58,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:05:58,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:05:58,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2022-01-19 04:05:58,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:05:58,523 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:05:58,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2022-01-19 04:05:58,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:05:58,598 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:05:58,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:05:58 WrapperNode [2022-01-19 04:05:58,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:05:58,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:05:58,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:05:58,601 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:05:58,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:05:58" (1/1) ... [2022-01-19 04:05:58,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:05:58" (1/1) ... [2022-01-19 04:05:58,645 INFO L137 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-01-19 04:05:58,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:05:58,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:05:58,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:05:58,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:05:58,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:05:58" (1/1) ... [2022-01-19 04:05:58,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:05:58" (1/1) ... [2022-01-19 04:05:58,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:05:58" (1/1) ... [2022-01-19 04:05:58,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:05:58" (1/1) ... [2022-01-19 04:05:58,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:05:58" (1/1) ... [2022-01-19 04:05:58,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:05:58" (1/1) ... [2022-01-19 04:05:58,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:05:58" (1/1) ... [2022-01-19 04:05:58,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:05:58,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:05:58,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:05:58,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:05:58,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:05:58" (1/1) ... [2022-01-19 04:05:58,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:05:58,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:05:58,724 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) [2022-01-19 04:05:58,737 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 [2022-01-19 04:05:58,761 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-01-19 04:05:58,761 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-01-19 04:05:58,762 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-01-19 04:05:58,762 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-01-19 04:05:58,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:05:58,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 04:05:58,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:05:58,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:05:58,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:05:58,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:05:58,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 04:05:58,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:05:58,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:05:58,764 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 04:05:58,846 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:05:58,847 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:05:59,018 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:05:59,023 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:05:59,023 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-19 04:05:59,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:05:59 BoogieIcfgContainer [2022-01-19 04:05:59,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:05:59,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:05:59,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:05:59,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:05:59,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:05:58" (1/3) ... [2022-01-19 04:05:59,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfac9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:05:59, skipping insertion in model container [2022-01-19 04:05:59,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:05:58" (2/3) ... [2022-01-19 04:05:59,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfac9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:05:59, skipping insertion in model container [2022-01-19 04:05:59,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:05:59" (3/3) ... [2022-01-19 04:05:59,035 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2022-01-19 04:05:59,039 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:05:59,039 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 04:05:59,039 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:05:59,070 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,071 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,071 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,071 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,071 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,071 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,071 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,071 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,072 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,072 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,072 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,072 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,073 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,073 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,073 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,073 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,073 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,073 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,074 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,074 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,074 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,074 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,074 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,074 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,074 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,075 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,075 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,075 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,075 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,075 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,075 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,076 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,076 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,076 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,076 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,076 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,076 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,076 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,077 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,077 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,077 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,077 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,078 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,078 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,078 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,078 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,078 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,078 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,079 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,079 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,079 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,079 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,079 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,079 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,079 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,080 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,084 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,084 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,084 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,089 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,090 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,090 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:05:59,090 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:05:59,121 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:05:59,128 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 04:05:59,128 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 04:05:59,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 70 transitions, 150 flow [2022-01-19 04:05:59,185 INFO L129 PetriNetUnfolder]: 5/68 cut-off events. [2022-01-19 04:05:59,185 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:05:59,189 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 68 events. 5/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-01-19 04:05:59,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 70 transitions, 150 flow [2022-01-19 04:05:59,195 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 68 transitions, 142 flow [2022-01-19 04:05:59,223 INFO L129 PetriNetUnfolder]: 4/58 cut-off events. [2022-01-19 04:05:59,223 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:05:59,224 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:05:59,224 INFO L254 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] [2022-01-19 04:05:59,225 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 04:05:59,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:05:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash 398220865, now seen corresponding path program 1 times [2022-01-19 04:05:59,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:05:59,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279116857] [2022-01-19 04:05:59,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:05:59,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:05:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:05:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:05:59,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:05:59,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279116857] [2022-01-19 04:05:59,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279116857] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:05:59,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:05:59,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:05:59,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700947265] [2022-01-19 04:05:59,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:05:59,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:05:59,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:05:59,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:05:59,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:05:59,641 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 04:05:59,660 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 56.333333333333336) internal successors, (338), 6 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:05:59,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:05:59,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 04:05:59,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:05:59,805 INFO L129 PetriNetUnfolder]: 42/210 cut-off events. [2022-01-19 04:05:59,806 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 04:05:59,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 210 events. 42/210 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 816 event pairs, 3 based on Foata normal form. 46/240 useless extension candidates. Maximal degree in co-relation 257. Up to 28 conditions per place. [2022-01-19 04:05:59,809 INFO L132 encePairwiseOnDemand]: 59/70 looper letters, 22 selfloop transitions, 17 changer transitions 0/92 dead transitions. [2022-01-19 04:05:59,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 92 transitions, 271 flow [2022-01-19 04:05:59,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:05:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:05:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 613 transitions. [2022-01-19 04:05:59,842 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8757142857142857 [2022-01-19 04:05:59,843 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 613 transitions. [2022-01-19 04:05:59,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 613 transitions. [2022-01-19 04:05:59,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:05:59,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 613 transitions. [2022-01-19 04:05:59,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 61.3) internal successors, (613), 10 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:05:59,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 70.0) internal successors, (770), 11 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:05:59,863 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 70.0) internal successors, (770), 11 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:05:59,864 INFO L186 Difference]: Start difference. First operand has 70 places, 68 transitions, 142 flow. Second operand 10 states and 613 transitions. [2022-01-19 04:05:59,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 92 transitions, 271 flow [2022-01-19 04:05:59,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 92 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:05:59,871 INFO L242 Difference]: Finished difference. Result has 85 places, 85 transitions, 276 flow [2022-01-19 04:05:59,873 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=276, PETRI_PLACES=85, PETRI_TRANSITIONS=85} [2022-01-19 04:05:59,876 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 15 predicate places. [2022-01-19 04:05:59,876 INFO L470 AbstractCegarLoop]: Abstraction has has 85 places, 85 transitions, 276 flow [2022-01-19 04:05:59,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.333333333333336) internal successors, (338), 6 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:05:59,877 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:05:59,877 INFO L254 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, 1] [2022-01-19 04:05:59,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:05:59,877 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 04:05:59,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:05:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash 245149124, now seen corresponding path program 1 times [2022-01-19 04:05:59,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:05:59,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6867204] [2022-01-19 04:05:59,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:05:59,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:05:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:05:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:05:59,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:05:59,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6867204] [2022-01-19 04:05:59,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6867204] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:05:59,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:05:59,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:05:59,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470894348] [2022-01-19 04:05:59,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:06:00,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:06:00,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:00,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:06:00,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:06:00,004 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 04:06:00,005 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 85 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:00,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 04:06:00,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:00,246 INFO L129 PetriNetUnfolder]: 46/218 cut-off events. [2022-01-19 04:06:00,246 INFO L130 PetriNetUnfolder]: For 111/114 co-relation queries the response was YES. [2022-01-19 04:06:00,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 218 events. 46/218 cut-off events. For 111/114 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 848 event pairs, 0 based on Foata normal form. 3/205 useless extension candidates. Maximal degree in co-relation 377. Up to 35 conditions per place. [2022-01-19 04:06:00,250 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 16 selfloop transitions, 9 changer transitions 40/110 dead transitions. [2022-01-19 04:06:00,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 110 transitions, 508 flow [2022-01-19 04:06:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 04:06:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 04:06:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 475 transitions. [2022-01-19 04:06:00,257 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8482142857142857 [2022-01-19 04:06:00,258 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 475 transitions. [2022-01-19 04:06:00,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 475 transitions. [2022-01-19 04:06:00,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:00,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 475 transitions. [2022-01-19 04:06:00,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 59.375) internal successors, (475), 8 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,264 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,265 INFO L186 Difference]: Start difference. First operand has 85 places, 85 transitions, 276 flow. Second operand 8 states and 475 transitions. [2022-01-19 04:06:00,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 110 transitions, 508 flow [2022-01-19 04:06:00,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 110 transitions, 508 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 04:06:00,271 INFO L242 Difference]: Finished difference. Result has 96 places, 67 transitions, 237 flow [2022-01-19 04:06:00,271 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=237, PETRI_PLACES=96, PETRI_TRANSITIONS=67} [2022-01-19 04:06:00,272 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 26 predicate places. [2022-01-19 04:06:00,272 INFO L470 AbstractCegarLoop]: Abstraction has has 96 places, 67 transitions, 237 flow [2022-01-19 04:06:00,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,273 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:00,273 INFO L254 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, 1] [2022-01-19 04:06:00,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:06:00,273 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 04:06:00,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:00,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1444168350, now seen corresponding path program 1 times [2022-01-19 04:06:00,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:00,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263211587] [2022-01-19 04:06:00,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:00,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:06:00,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:00,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263211587] [2022-01-19 04:06:00,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263211587] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:06:00,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:06:00,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:06:00,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010673902] [2022-01-19 04:06:00,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:06:00,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:06:00,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:00,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:06:00,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:06:00,412 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 04:06:00,412 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 67 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,412 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:00,413 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 04:06:00,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:00,520 INFO L129 PetriNetUnfolder]: 37/188 cut-off events. [2022-01-19 04:06:00,521 INFO L130 PetriNetUnfolder]: For 251/258 co-relation queries the response was YES. [2022-01-19 04:06:00,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 188 events. 37/188 cut-off events. For 251/258 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 602 event pairs, 0 based on Foata normal form. 10/180 useless extension candidates. Maximal degree in co-relation 354. Up to 35 conditions per place. [2022-01-19 04:06:00,525 INFO L132 encePairwiseOnDemand]: 64/70 looper letters, 23 selfloop transitions, 11 changer transitions 8/87 dead transitions. [2022-01-19 04:06:00,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 87 transitions, 457 flow [2022-01-19 04:06:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:06:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:06:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 530 transitions. [2022-01-19 04:06:00,530 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8412698412698413 [2022-01-19 04:06:00,530 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 530 transitions. [2022-01-19 04:06:00,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 530 transitions. [2022-01-19 04:06:00,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:00,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 530 transitions. [2022-01-19 04:06:00,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 58.888888888888886) internal successors, (530), 9 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 70.0) internal successors, (700), 10 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,536 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 70.0) internal successors, (700), 10 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,536 INFO L186 Difference]: Start difference. First operand has 96 places, 67 transitions, 237 flow. Second operand 9 states and 530 transitions. [2022-01-19 04:06:00,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 87 transitions, 457 flow [2022-01-19 04:06:00,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 87 transitions, 387 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-01-19 04:06:00,541 INFO L242 Difference]: Finished difference. Result has 86 places, 72 transitions, 289 flow [2022-01-19 04:06:00,541 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=289, PETRI_PLACES=86, PETRI_TRANSITIONS=72} [2022-01-19 04:06:00,541 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 16 predicate places. [2022-01-19 04:06:00,542 INFO L470 AbstractCegarLoop]: Abstraction has has 86 places, 72 transitions, 289 flow [2022-01-19 04:06:00,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,542 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:00,542 INFO L254 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, 1] [2022-01-19 04:06:00,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 04:06:00,542 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 04:06:00,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:00,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1245653052, now seen corresponding path program 2 times [2022-01-19 04:06:00,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:00,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458793449] [2022-01-19 04:06:00,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:00,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:06:00,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:00,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458793449] [2022-01-19 04:06:00,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458793449] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:06:00,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:06:00,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:06:00,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647110834] [2022-01-19 04:06:00,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:06:00,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:06:00,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:00,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:06:00,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:06:00,624 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 04:06:00,624 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 72 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:00,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 04:06:00,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:00,712 INFO L129 PetriNetUnfolder]: 30/177 cut-off events. [2022-01-19 04:06:00,712 INFO L130 PetriNetUnfolder]: For 232/248 co-relation queries the response was YES. [2022-01-19 04:06:00,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 177 events. 30/177 cut-off events. For 232/248 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 550 event pairs, 0 based on Foata normal form. 16/176 useless extension candidates. Maximal degree in co-relation 365. Up to 32 conditions per place. [2022-01-19 04:06:00,714 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 19 selfloop transitions, 12 changer transitions 11/87 dead transitions. [2022-01-19 04:06:00,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 87 transitions, 487 flow [2022-01-19 04:06:00,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:06:00,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:06:00,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 524 transitions. [2022-01-19 04:06:00,715 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8317460317460318 [2022-01-19 04:06:00,716 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 524 transitions. [2022-01-19 04:06:00,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 524 transitions. [2022-01-19 04:06:00,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:00,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 524 transitions. [2022-01-19 04:06:00,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 70.0) internal successors, (700), 10 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,719 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 70.0) internal successors, (700), 10 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,719 INFO L186 Difference]: Start difference. First operand has 86 places, 72 transitions, 289 flow. Second operand 9 states and 524 transitions. [2022-01-19 04:06:00,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 87 transitions, 487 flow [2022-01-19 04:06:00,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 87 transitions, 467 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-01-19 04:06:00,724 INFO L242 Difference]: Finished difference. Result has 93 places, 73 transitions, 332 flow [2022-01-19 04:06:00,724 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=332, PETRI_PLACES=93, PETRI_TRANSITIONS=73} [2022-01-19 04:06:00,725 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 23 predicate places. [2022-01-19 04:06:00,725 INFO L470 AbstractCegarLoop]: Abstraction has has 93 places, 73 transitions, 332 flow [2022-01-19 04:06:00,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,726 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:00,726 INFO L254 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, 1, 1, 1, 1, 1] [2022-01-19 04:06:00,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 04:06:00,727 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 04:06:00,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:00,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1734522485, now seen corresponding path program 1 times [2022-01-19 04:06:00,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:00,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357702729] [2022-01-19 04:06:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:00,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:06:00,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:00,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357702729] [2022-01-19 04:06:00,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357702729] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:06:00,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:06:00,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:06:00,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43633757] [2022-01-19 04:06:00,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:06:00,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:06:00,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:00,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:06:00,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:06:00,802 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 04:06:00,802 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 73 transitions, 332 flow. Second operand has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 7 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:00,802 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 04:06:00,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:00,945 INFO L129 PetriNetUnfolder]: 32/173 cut-off events. [2022-01-19 04:06:00,945 INFO L130 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-01-19 04:06:00,946 INFO L84 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 173 events. 32/173 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 519 event pairs, 1 based on Foata normal form. 15/173 useless extension candidates. Maximal degree in co-relation 404. Up to 36 conditions per place. [2022-01-19 04:06:00,947 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 19 selfloop transitions, 19 changer transitions 8/91 dead transitions. [2022-01-19 04:06:00,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 91 transitions, 584 flow [2022-01-19 04:06:00,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 04:06:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 04:06:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 638 transitions. [2022-01-19 04:06:00,950 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2022-01-19 04:06:00,950 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 638 transitions. [2022-01-19 04:06:00,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 638 transitions. [2022-01-19 04:06:00,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:00,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 638 transitions. [2022-01-19 04:06:00,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 58.0) internal successors, (638), 11 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 70.0) internal successors, (840), 12 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,954 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 70.0) internal successors, (840), 12 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,955 INFO L186 Difference]: Start difference. First operand has 93 places, 73 transitions, 332 flow. Second operand 11 states and 638 transitions. [2022-01-19 04:06:00,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 91 transitions, 584 flow [2022-01-19 04:06:00,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 91 transitions, 498 flow, removed 30 selfloop flow, removed 10 redundant places. [2022-01-19 04:06:00,960 INFO L242 Difference]: Finished difference. Result has 96 places, 77 transitions, 390 flow [2022-01-19 04:06:00,960 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=390, PETRI_PLACES=96, PETRI_TRANSITIONS=77} [2022-01-19 04:06:00,963 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 26 predicate places. [2022-01-19 04:06:00,963 INFO L470 AbstractCegarLoop]: Abstraction has has 96 places, 77 transitions, 390 flow [2022-01-19 04:06:00,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 7 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:00,964 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:00,964 INFO L254 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, 1, 1, 1, 1, 1] [2022-01-19 04:06:00,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 04:06:00,964 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 04:06:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:00,965 INFO L85 PathProgramCache]: Analyzing trace with hash -949175033, now seen corresponding path program 2 times [2022-01-19 04:06:00,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:00,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178673088] [2022-01-19 04:06:00,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:00,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:06:01,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:01,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178673088] [2022-01-19 04:06:01,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178673088] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:06:01,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:06:01,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:06:01,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165586938] [2022-01-19 04:06:01,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:06:01,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:06:01,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:01,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:06:01,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:06:01,089 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 04:06:01,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 77 transitions, 390 flow. Second operand has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 7 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:01,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:01,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 04:06:01,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:01,211 INFO L129 PetriNetUnfolder]: 35/207 cut-off events. [2022-01-19 04:06:01,212 INFO L130 PetriNetUnfolder]: For 550/576 co-relation queries the response was YES. [2022-01-19 04:06:01,213 INFO L84 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 207 events. 35/207 cut-off events. For 550/576 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 783 event pairs, 0 based on Foata normal form. 24/212 useless extension candidates. Maximal degree in co-relation 512. Up to 41 conditions per place. [2022-01-19 04:06:01,214 INFO L132 encePairwiseOnDemand]: 64/70 looper letters, 25 selfloop transitions, 16 changer transitions 5/91 dead transitions. [2022-01-19 04:06:01,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 91 transitions, 633 flow [2022-01-19 04:06:01,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:06:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:06:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 526 transitions. [2022-01-19 04:06:01,217 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.834920634920635 [2022-01-19 04:06:01,217 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 526 transitions. [2022-01-19 04:06:01,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 526 transitions. [2022-01-19 04:06:01,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:01,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 526 transitions. [2022-01-19 04:06:01,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 58.44444444444444) internal successors, (526), 9 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:01,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 70.0) internal successors, (700), 10 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:01,221 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 70.0) internal successors, (700), 10 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:01,221 INFO L186 Difference]: Start difference. First operand has 96 places, 77 transitions, 390 flow. Second operand 9 states and 526 transitions. [2022-01-19 04:06:01,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 91 transitions, 633 flow [2022-01-19 04:06:01,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 91 transitions, 591 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-01-19 04:06:01,226 INFO L242 Difference]: Finished difference. Result has 99 places, 82 transitions, 466 flow [2022-01-19 04:06:01,227 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=466, PETRI_PLACES=99, PETRI_TRANSITIONS=82} [2022-01-19 04:06:01,227 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 29 predicate places. [2022-01-19 04:06:01,227 INFO L470 AbstractCegarLoop]: Abstraction has has 99 places, 82 transitions, 466 flow [2022-01-19 04:06:01,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 7 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:01,228 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:01,228 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:06:01,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 04:06:01,229 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 04:06:01,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:01,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1110018853, now seen corresponding path program 1 times [2022-01-19 04:06:01,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:01,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902397399] [2022-01-19 04:06:01,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:01,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:06:01,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:01,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902397399] [2022-01-19 04:06:01,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902397399] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:06:01,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677092300] [2022-01-19 04:06:01,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:01,331 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:06:01,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:06:01,333 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) [2022-01-19 04:06:01,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 04:06:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:01,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 04:06:01,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:06:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:06:01,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:06:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:06:01,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677092300] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:06:01,919 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:06:01,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-01-19 04:06:01,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065098230] [2022-01-19 04:06:01,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:06:01,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 04:06:01,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:01,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 04:06:01,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-01-19 04:06:01,922 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 04:06:01,923 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 82 transitions, 466 flow. Second operand has 13 states, 13 states have (on average 56.61538461538461) internal successors, (736), 13 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:01,923 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:01,924 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 04:06:01,924 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:02,225 INFO L129 PetriNetUnfolder]: 53/306 cut-off events. [2022-01-19 04:06:02,225 INFO L130 PetriNetUnfolder]: For 935/972 co-relation queries the response was YES. [2022-01-19 04:06:02,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 306 events. 53/306 cut-off events. For 935/972 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1196 event pairs, 1 based on Foata normal form. 25/301 useless extension candidates. Maximal degree in co-relation 790. Up to 63 conditions per place. [2022-01-19 04:06:02,229 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 26 selfloop transitions, 36 changer transitions 14/121 dead transitions. [2022-01-19 04:06:02,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 121 transitions, 1080 flow [2022-01-19 04:06:02,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 04:06:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 04:06:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1159 transitions. [2022-01-19 04:06:02,233 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8278571428571428 [2022-01-19 04:06:02,233 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1159 transitions. [2022-01-19 04:06:02,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1159 transitions. [2022-01-19 04:06:02,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:02,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1159 transitions. [2022-01-19 04:06:02,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 57.95) internal successors, (1159), 20 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:02,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 70.0) internal successors, (1470), 21 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:02,241 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 70.0) internal successors, (1470), 21 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:02,241 INFO L186 Difference]: Start difference. First operand has 99 places, 82 transitions, 466 flow. Second operand 20 states and 1159 transitions. [2022-01-19 04:06:02,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 121 transitions, 1080 flow [2022-01-19 04:06:02,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 121 transitions, 1059 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-01-19 04:06:02,250 INFO L242 Difference]: Finished difference. Result has 123 places, 98 transitions, 782 flow [2022-01-19 04:06:02,250 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=782, PETRI_PLACES=123, PETRI_TRANSITIONS=98} [2022-01-19 04:06:02,251 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 53 predicate places. [2022-01-19 04:06:02,251 INFO L470 AbstractCegarLoop]: Abstraction has has 123 places, 98 transitions, 782 flow [2022-01-19 04:06:02,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 56.61538461538461) internal successors, (736), 13 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:02,252 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:02,252 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:06:02,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 04:06:02,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:06:02,466 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 04:06:02,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:02,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2058188618, now seen corresponding path program 1 times [2022-01-19 04:06:02,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:02,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239745098] [2022-01-19 04:06:02,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:02,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:06:02,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:02,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239745098] [2022-01-19 04:06:02,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239745098] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:06:02,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453589476] [2022-01-19 04:06:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:02,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:06:02,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:06:02,620 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:06:02,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 04:06:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:02,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 04:06:02,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:06:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:06:02,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:06:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:06:03,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453589476] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:06:03,240 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:06:03,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2022-01-19 04:06:03,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706447223] [2022-01-19 04:06:03,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:06:03,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-19 04:06:03,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:03,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-19 04:06:03,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-01-19 04:06:03,243 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 04:06:03,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 98 transitions, 782 flow. Second operand has 17 states, 17 states have (on average 56.64705882352941) internal successors, (963), 17 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:03,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:03,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 04:06:03,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:03,628 INFO L129 PetriNetUnfolder]: 75/459 cut-off events. [2022-01-19 04:06:03,628 INFO L130 PetriNetUnfolder]: For 2790/2837 co-relation queries the response was YES. [2022-01-19 04:06:03,631 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 459 events. 75/459 cut-off events. For 2790/2837 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1873 event pairs, 0 based on Foata normal form. 27/439 useless extension candidates. Maximal degree in co-relation 1419. Up to 99 conditions per place. [2022-01-19 04:06:03,635 INFO L132 encePairwiseOnDemand]: 64/70 looper letters, 55 selfloop transitions, 27 changer transitions 26/153 dead transitions. [2022-01-19 04:06:03,635 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 153 transitions, 1906 flow [2022-01-19 04:06:03,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 04:06:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 04:06:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1450 transitions. [2022-01-19 04:06:03,639 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2022-01-19 04:06:03,639 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1450 transitions. [2022-01-19 04:06:03,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1450 transitions. [2022-01-19 04:06:03,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:03,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1450 transitions. [2022-01-19 04:06:03,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 58.0) internal successors, (1450), 25 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:03,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 70.0) internal successors, (1820), 26 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:03,647 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 70.0) internal successors, (1820), 26 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:03,647 INFO L186 Difference]: Start difference. First operand has 123 places, 98 transitions, 782 flow. Second operand 25 states and 1450 transitions. [2022-01-19 04:06:03,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 153 transitions, 1906 flow [2022-01-19 04:06:03,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 153 transitions, 1498 flow, removed 182 selfloop flow, removed 13 redundant places. [2022-01-19 04:06:03,659 INFO L242 Difference]: Finished difference. Result has 148 places, 112 transitions, 887 flow [2022-01-19 04:06:03,659 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=887, PETRI_PLACES=148, PETRI_TRANSITIONS=112} [2022-01-19 04:06:03,661 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 78 predicate places. [2022-01-19 04:06:03,661 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 112 transitions, 887 flow [2022-01-19 04:06:03,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 56.64705882352941) internal successors, (963), 17 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:03,662 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:03,662 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:06:03,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 04:06:03,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-01-19 04:06:03,884 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 04:06:03,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:03,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1596067542, now seen corresponding path program 2 times [2022-01-19 04:06:03,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:03,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506872761] [2022-01-19 04:06:03,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:03,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:06:04,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:04,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506872761] [2022-01-19 04:06:04,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506872761] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:06:04,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430530934] [2022-01-19 04:06:04,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 04:06:04,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:06:04,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:06:04,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:06:04,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 04:06:04,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 04:06:04,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:06:04,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 04:06:04,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:06:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:06:04,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:06:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:06:04,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430530934] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:06:04,567 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:06:04,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2022-01-19 04:06:04,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332453570] [2022-01-19 04:06:04,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:06:04,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 04:06:04,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:04,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 04:06:04,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-01-19 04:06:04,571 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 04:06:04,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 112 transitions, 887 flow. Second operand has 18 states, 18 states have (on average 56.666666666666664) internal successors, (1020), 18 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:04,573 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:04,573 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 04:06:04,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:05,145 INFO L129 PetriNetUnfolder]: 113/740 cut-off events. [2022-01-19 04:06:05,146 INFO L130 PetriNetUnfolder]: For 10926/11057 co-relation queries the response was YES. [2022-01-19 04:06:05,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2810 conditions, 740 events. 113/740 cut-off events. For 10926/11057 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4456 event pairs, 0 based on Foata normal form. 27/691 useless extension candidates. Maximal degree in co-relation 2734. Up to 147 conditions per place. [2022-01-19 04:06:05,188 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 56 selfloop transitions, 74 changer transitions 26/201 dead transitions. [2022-01-19 04:06:05,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 201 transitions, 3065 flow [2022-01-19 04:06:05,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-19 04:06:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-01-19 04:06:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 1851 transitions. [2022-01-19 04:06:05,192 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8263392857142857 [2022-01-19 04:06:05,192 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 1851 transitions. [2022-01-19 04:06:05,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 1851 transitions. [2022-01-19 04:06:05,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:05,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 1851 transitions. [2022-01-19 04:06:05,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 57.84375) internal successors, (1851), 32 states have internal predecessors, (1851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:05,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 70.0) internal successors, (2310), 33 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:05,212 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 70.0) internal successors, (2310), 33 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:05,212 INFO L186 Difference]: Start difference. First operand has 148 places, 112 transitions, 887 flow. Second operand 32 states and 1851 transitions. [2022-01-19 04:06:05,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 201 transitions, 3065 flow [2022-01-19 04:06:05,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 201 transitions, 2600 flow, removed 223 selfloop flow, removed 13 redundant places. [2022-01-19 04:06:05,238 INFO L242 Difference]: Finished difference. Result has 180 places, 150 transitions, 1612 flow [2022-01-19 04:06:05,238 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1612, PETRI_PLACES=180, PETRI_TRANSITIONS=150} [2022-01-19 04:06:05,239 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 110 predicate places. [2022-01-19 04:06:05,239 INFO L470 AbstractCegarLoop]: Abstraction has has 180 places, 150 transitions, 1612 flow [2022-01-19 04:06:05,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 56.666666666666664) internal successors, (1020), 18 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:05,239 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:05,240 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:06:05,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-19 04:06:05,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:06:05,456 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 04:06:05,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:05,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1413150414, now seen corresponding path program 3 times [2022-01-19 04:06:05,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:05,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475922980] [2022-01-19 04:06:05,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:05,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:06:05,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:05,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475922980] [2022-01-19 04:06:05,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475922980] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:06:05,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566902208] [2022-01-19 04:06:05,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 04:06:05,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:06:05,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:06:05,544 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:06:05,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 04:06:05,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-19 04:06:05,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:06:05,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 04:06:05,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:06:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:06:05,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:06:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:06:05,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566902208] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:06:05,952 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:06:05,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2022-01-19 04:06:05,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174113816] [2022-01-19 04:06:05,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:06:05,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-19 04:06:05,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:05,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-19 04:06:05,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-01-19 04:06:05,954 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 04:06:05,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 150 transitions, 1612 flow. Second operand has 17 states, 17 states have (on average 56.64705882352941) internal successors, (963), 17 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:05,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:05,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 04:06:05,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:06,602 INFO L129 PetriNetUnfolder]: 173/1099 cut-off events. [2022-01-19 04:06:06,602 INFO L130 PetriNetUnfolder]: For 34172/34429 co-relation queries the response was YES. [2022-01-19 04:06:06,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5375 conditions, 1099 events. 173/1099 cut-off events. For 34172/34429 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7692 event pairs, 0 based on Foata normal form. 40/1027 useless extension candidates. Maximal degree in co-relation 5283. Up to 223 conditions per place. [2022-01-19 04:06:06,620 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 55 selfloop transitions, 136 changer transitions 29/265 dead transitions. [2022-01-19 04:06:06,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 265 transitions, 5434 flow [2022-01-19 04:06:06,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-19 04:06:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-01-19 04:06:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2204 transitions. [2022-01-19 04:06:06,624 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2022-01-19 04:06:06,624 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 2204 transitions. [2022-01-19 04:06:06,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 2204 transitions. [2022-01-19 04:06:06,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:06,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2204 transitions. [2022-01-19 04:06:06,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 58.0) internal successors, (2204), 38 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:06,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 70.0) internal successors, (2730), 39 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:06,633 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 70.0) internal successors, (2730), 39 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:06,633 INFO L186 Difference]: Start difference. First operand has 180 places, 150 transitions, 1612 flow. Second operand 38 states and 2204 transitions. [2022-01-19 04:06:06,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 265 transitions, 5434 flow [2022-01-19 04:06:06,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 265 transitions, 4597 flow, removed 409 selfloop flow, removed 14 redundant places. [2022-01-19 04:06:06,691 INFO L242 Difference]: Finished difference. Result has 219 places, 203 transitions, 2830 flow [2022-01-19 04:06:06,691 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=2830, PETRI_PLACES=219, PETRI_TRANSITIONS=203} [2022-01-19 04:06:06,692 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 149 predicate places. [2022-01-19 04:06:06,692 INFO L470 AbstractCegarLoop]: Abstraction has has 219 places, 203 transitions, 2830 flow [2022-01-19 04:06:06,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 56.64705882352941) internal successors, (963), 17 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:06,693 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:06,693 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:06:06,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 04:06:06,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:06:06,907 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 04:06:06,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:06,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1640875958, now seen corresponding path program 4 times [2022-01-19 04:06:06,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:06,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523289978] [2022-01-19 04:06:06,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:06,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:06:07,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:07,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523289978] [2022-01-19 04:06:07,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523289978] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:06:07,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007730646] [2022-01-19 04:06:07,002 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 04:06:07,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:06:07,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:06:07,004 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:06:07,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 04:06:07,073 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 04:06:07,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:06:07,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 04:06:07,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:06:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:06:07,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:06:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:06:07,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007730646] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:06:07,388 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:06:07,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 19 [2022-01-19 04:06:07,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666995403] [2022-01-19 04:06:07,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:06:07,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 04:06:07,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:07,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 04:06:07,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-01-19 04:06:07,391 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 04:06:07,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 203 transitions, 2830 flow. Second operand has 19 states, 19 states have (on average 56.526315789473685) internal successors, (1074), 19 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:07,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:07,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 04:06:07,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:08,381 INFO L129 PetriNetUnfolder]: 209/1375 cut-off events. [2022-01-19 04:06:08,381 INFO L130 PetriNetUnfolder]: For 80868/81151 co-relation queries the response was YES. [2022-01-19 04:06:08,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8392 conditions, 1375 events. 209/1375 cut-off events. For 80868/81151 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 10117 event pairs, 0 based on Foata normal form. 57/1292 useless extension candidates. Maximal degree in co-relation 8284. Up to 277 conditions per place. [2022-01-19 04:06:08,405 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 52 selfloop transitions, 178 changer transitions 36/311 dead transitions. [2022-01-19 04:06:08,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 311 transitions, 8523 flow [2022-01-19 04:06:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-19 04:06:08,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-01-19 04:06:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 2374 transitions. [2022-01-19 04:06:08,409 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8271777003484321 [2022-01-19 04:06:08,409 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 2374 transitions. [2022-01-19 04:06:08,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 2374 transitions. [2022-01-19 04:06:08,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:08,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 2374 transitions. [2022-01-19 04:06:08,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 57.90243902439025) internal successors, (2374), 41 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:08,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 70.0) internal successors, (2940), 42 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:08,419 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 70.0) internal successors, (2940), 42 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:08,419 INFO L186 Difference]: Start difference. First operand has 219 places, 203 transitions, 2830 flow. Second operand 41 states and 2374 transitions. [2022-01-19 04:06:08,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 311 transitions, 8523 flow [2022-01-19 04:06:08,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 311 transitions, 6156 flow, removed 1157 selfloop flow, removed 20 redundant places. [2022-01-19 04:06:08,531 INFO L242 Difference]: Finished difference. Result has 254 places, 247 transitions, 3779 flow [2022-01-19 04:06:08,532 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=2183, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=3779, PETRI_PLACES=254, PETRI_TRANSITIONS=247} [2022-01-19 04:06:08,532 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 184 predicate places. [2022-01-19 04:06:08,532 INFO L470 AbstractCegarLoop]: Abstraction has has 254 places, 247 transitions, 3779 flow [2022-01-19 04:06:08,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 56.526315789473685) internal successors, (1074), 19 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:08,533 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:08,533 INFO L254 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1] [2022-01-19 04:06:08,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 04:06:08,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-19 04:06:08,757 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 04:06:08,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:08,757 INFO L85 PathProgramCache]: Analyzing trace with hash -86455090, now seen corresponding path program 5 times [2022-01-19 04:06:08,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:08,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891648968] [2022-01-19 04:06:08,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:08,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:06:08,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:08,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891648968] [2022-01-19 04:06:08,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891648968] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:06:08,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546565881] [2022-01-19 04:06:08,941 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 04:06:08,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:06:08,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:06:08,942 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:06:08,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 04:06:09,014 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-01-19 04:06:09,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:06:09,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-19 04:06:09,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:06:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:06:09,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:06:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:06:09,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546565881] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:06:09,611 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:06:09,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 30 [2022-01-19 04:06:09,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165824223] [2022-01-19 04:06:09,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:06:09,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-19 04:06:09,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:09,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-19 04:06:09,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2022-01-19 04:06:09,614 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 04:06:09,616 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 247 transitions, 3779 flow. Second operand has 30 states, 30 states have (on average 56.333333333333336) internal successors, (1690), 30 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:09,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:09,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 04:06:09,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:11,190 INFO L129 PetriNetUnfolder]: 247/1564 cut-off events. [2022-01-19 04:06:11,190 INFO L130 PetriNetUnfolder]: For 101504/101914 co-relation queries the response was YES. [2022-01-19 04:06:11,204 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10214 conditions, 1564 events. 247/1564 cut-off events. For 101504/101914 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 10813 event pairs, 0 based on Foata normal form. 50/1455 useless extension candidates. Maximal degree in co-relation 10091. Up to 317 conditions per place. [2022-01-19 04:06:11,219 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 74 selfloop transitions, 218 changer transitions 35/372 dead transitions. [2022-01-19 04:06:11,219 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 372 transitions, 11348 flow [2022-01-19 04:06:11,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-01-19 04:06:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-01-19 04:06:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 3528 transitions. [2022-01-19 04:06:11,225 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8262295081967214 [2022-01-19 04:06:11,226 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 3528 transitions. [2022-01-19 04:06:11,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 3528 transitions. [2022-01-19 04:06:11,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:11,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 3528 transitions. [2022-01-19 04:06:11,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 62 states, 61 states have (on average 57.83606557377049) internal successors, (3528), 61 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:11,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 62 states, 62 states have (on average 70.0) internal successors, (4340), 62 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:11,248 INFO L81 ComplementDD]: Finished complementDD. Result has 62 states, 62 states have (on average 70.0) internal successors, (4340), 62 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:11,248 INFO L186 Difference]: Start difference. First operand has 254 places, 247 transitions, 3779 flow. Second operand 61 states and 3528 transitions. [2022-01-19 04:06:11,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 372 transitions, 11348 flow [2022-01-19 04:06:11,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 372 transitions, 9657 flow, removed 813 selfloop flow, removed 22 redundant places. [2022-01-19 04:06:11,422 INFO L242 Difference]: Finished difference. Result has 316 places, 287 transitions, 5192 flow [2022-01-19 04:06:11,423 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=3124, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=5192, PETRI_PLACES=316, PETRI_TRANSITIONS=287} [2022-01-19 04:06:11,424 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 246 predicate places. [2022-01-19 04:06:11,424 INFO L470 AbstractCegarLoop]: Abstraction has has 316 places, 287 transitions, 5192 flow [2022-01-19 04:06:11,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 56.333333333333336) internal successors, (1690), 30 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:11,431 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:11,431 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 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, 1] [2022-01-19 04:06:11,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 04:06:11,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:06:11,647 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 04:06:11,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:11,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1659924766, now seen corresponding path program 6 times [2022-01-19 04:06:11,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:11,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583368797] [2022-01-19 04:06:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:11,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:06:11,684 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:06:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:06:11,746 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:06:11,746 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:06:11,748 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 04:06:11,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-01-19 04:06:11,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-01-19 04:06:11,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 04:06:11,752 INFO L732 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1] [2022-01-19 04:06:11,756 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 04:06:11,756 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:06:11,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:06:11 BasicIcfg [2022-01-19 04:06:11,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:06:11,853 INFO L158 Benchmark]: Toolchain (without parser) took 13751.75ms. Allocated memory was 415.2MB in the beginning and 595.6MB in the end (delta: 180.4MB). Free memory was 359.0MB in the beginning and 387.7MB in the end (delta: -28.7MB). Peak memory consumption was 153.7MB. Max. memory is 16.0GB. [2022-01-19 04:06:11,854 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 415.2MB. Free memory is still 376.2MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:06:11,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.44ms. Allocated memory is still 415.2MB. Free memory was 358.8MB in the beginning and 374.1MB in the end (delta: -15.3MB). Peak memory consumption was 11.1MB. Max. memory is 16.0GB. [2022-01-19 04:06:11,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.79ms. Allocated memory is still 415.2MB. Free memory was 374.1MB in the beginning and 372.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:06:11,854 INFO L158 Benchmark]: Boogie Preprocessor took 32.98ms. Allocated memory is still 415.2MB. Free memory was 372.0MB in the beginning and 370.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:06:11,854 INFO L158 Benchmark]: RCFGBuilder took 345.89ms. Allocated memory is still 415.2MB. Free memory was 370.9MB in the beginning and 358.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2022-01-19 04:06:11,855 INFO L158 Benchmark]: TraceAbstraction took 12826.70ms. Allocated memory was 415.2MB in the beginning and 595.6MB in the end (delta: 180.4MB). Free memory was 357.3MB in the beginning and 387.7MB in the end (delta: -30.4MB). Peak memory consumption was 151.0MB. Max. memory is 16.0GB. [2022-01-19 04:06:11,856 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.11ms. Allocated memory is still 415.2MB. Free memory is still 376.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 496.44ms. Allocated memory is still 415.2MB. Free memory was 358.8MB in the beginning and 374.1MB in the end (delta: -15.3MB). Peak memory consumption was 11.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.79ms. Allocated memory is still 415.2MB. Free memory was 374.1MB in the beginning and 372.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.98ms. Allocated memory is still 415.2MB. Free memory was 372.0MB in the beginning and 370.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 345.89ms. Allocated memory is still 415.2MB. Free memory was 370.9MB in the beginning and 358.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 12826.70ms. Allocated memory was 415.2MB in the beginning and 595.6MB in the end (delta: 180.4MB). Free memory was 357.3MB in the beginning and 387.7MB in the end (delta: -30.4MB). Peak memory consumption was 151.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; VAL [i=3, j=6] [L712] 0 pthread_t id1, id2; VAL [\old(argc)=49, argc=49, argv={51:50}, argv={51:50}, i=3, id1={5:0}, id2={3:0}, j=6] [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, i=3, id1={5:0}, id2={3:0}, j=6, pthread_create(&id1, ((void *)0), t1, ((void *)0))=6] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, i=7, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, i=7, id1={5:0}, id2={3:0}, j=6, k=0, pthread_create(&id2, ((void *)0), t2, ((void *)0))=7] [L716] 0 int condI = i >= (2*10 +6); VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, condI=0, i=7, id1={5:0}, id2={3:0}, j=6, k=0] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=0] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=0] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=0] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=0, k=1] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=1] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=1] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=2] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=2] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=2] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=2] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=3] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=3] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=4] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=4, k=5] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=6, k=4] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=6, k=4] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=6, k=5] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=5, k=6] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=6] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=6] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=7] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=7] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=7] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=8] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=8] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=8] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=8, k=9] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L719] 0 int condJ = j >= (2*10 +6); VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, condI=0, condJ=1, i=25, id1={5:0}, id2={3:0}, j=26, k=9, k=9] [L721] COND TRUE 0 condI || condJ VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, condI=0, condJ=1, i=25, id1={5:0}, id2={3:0}, j=26, k=9, k=9] [L722] 0 reach_error() VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, condI=0, condJ=1, i=25, id1={5:0}, id2={3:0}, j=26, k=9, k=9] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 88 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.6s, OverallIterations: 13, TraceHistogramMax: 10, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 560 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 560 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 227 mSDsCounter, 604 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1348 IncrementalHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 604 mSolverCounterUnsat, 56 mSDtfsCounter, 1348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1094 GetRequests, 755 SyntacticMatches, 5 SemanticMatches, 334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4709 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5192occurred in iteration=12, InterpolantAutomatonStates: 273, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1167 NumberOfCodeBlocks, 1162 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1408 ConstructedInterpolants, 0 QuantifiedInterpolants, 4880 SizeOfPredicates, 42 NumberOfNonLiveVariables, 984 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 60/663 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 proved your program to be incorrect! [2022-01-19 04:06:11,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...