/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-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 10:23:00,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 10:23:00,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 10:23:00,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 10:23:00,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 10:23:00,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 10:23:00,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 10:23:00,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 10:23:00,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 10:23:00,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 10:23:00,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 10:23:00,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 10:23:00,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 10:23:00,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 10:23:00,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 10:23:00,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 10:23:00,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 10:23:00,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 10:23:00,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 10:23:00,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 10:23:00,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 10:23:00,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 10:23:00,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 10:23:00,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 10:23:00,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 10:23:00,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 10:23:00,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 10:23:00,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 10:23:00,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 10:23:00,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 10:23:00,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 10:23:00,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 10:23:00,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 10:23:00,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 10:23:00,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 10:23:00,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 10:23:00,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 10:23:00,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 10:23:00,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 10:23:00,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 10:23:00,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 10:23:00,634 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-After.epf [2022-01-19 10:23:00,645 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 10:23:00,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 10:23:00,646 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 10:23:00,646 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 10:23:00,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 10:23:00,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 10:23:00,647 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 10:23:00,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 10:23:00,647 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 10:23:00,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 10:23:00,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 10:23:00,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 10:23:00,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 10:23:00,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 10:23:00,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 10:23:00,648 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 10:23:00,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 10:23:00,648 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 10:23:00,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 10:23:00,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 10:23:00,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 10:23:00,649 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 10:23:00,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 10:23:00,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 10:23:00,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 10:23:00,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 10:23:00,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 10:23:00,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 10:23:00,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 10:23:00,650 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 10:23:00,650 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 10:23:00,650 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 10:23:00,650 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 10:23:00,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 10:23:00,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 10:23:00,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 10:23:00,793 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 10:23:00,793 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 10:23:00,794 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2022-01-19 10:23:00,847 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/415a407f7/ff1958b42477413badeb237868b98f51/FLAGc4f69864b [2022-01-19 10:23:01,231 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 10:23:01,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2022-01-19 10:23:01,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/415a407f7/ff1958b42477413badeb237868b98f51/FLAGc4f69864b [2022-01-19 10:23:01,246 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/415a407f7/ff1958b42477413badeb237868b98f51 [2022-01-19 10:23:01,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 10:23:01,250 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 10:23:01,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 10:23:01,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 10:23:01,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 10:23:01,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 10:23:01" (1/1) ... [2022-01-19 10:23:01,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f76cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:23:01, skipping insertion in model container [2022-01-19 10:23:01,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 10:23:01" (1/1) ... [2022-01-19 10:23:01,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 10:23:01,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 10:23:01,511 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-longest-2.i[30964,30977] [2022-01-19 10:23:01,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 10:23:01,519 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 10:23:01,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-longest-2.i[30964,30977] [2022-01-19 10:23:01,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 10:23:01,587 INFO L208 MainTranslator]: Completed translation [2022-01-19 10:23:01,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:23:01 WrapperNode [2022-01-19 10:23:01,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 10:23:01,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 10:23:01,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 10:23:01,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 10:23:01,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:23:01" (1/1) ... [2022-01-19 10:23:01,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:23:01" (1/1) ... [2022-01-19 10:23:01,632 INFO L137 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-01-19 10:23:01,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 10:23:01,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 10:23:01,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 10:23:01,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 10:23:01,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:23:01" (1/1) ... [2022-01-19 10:23:01,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:23:01" (1/1) ... [2022-01-19 10:23:01,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:23:01" (1/1) ... [2022-01-19 10:23:01,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:23:01" (1/1) ... [2022-01-19 10:23:01,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:23:01" (1/1) ... [2022-01-19 10:23:01,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:23:01" (1/1) ... [2022-01-19 10:23:01,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:23:01" (1/1) ... [2022-01-19 10:23:01,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 10:23:01,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 10:23:01,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 10:23:01,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 10:23:01,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:23:01" (1/1) ... [2022-01-19 10:23:01,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 10:23:01,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:23:01,689 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 10:23:01,703 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 10:23:01,720 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-01-19 10:23:01,720 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-01-19 10:23:01,720 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-01-19 10:23:01,720 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-01-19 10:23:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 10:23:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 10:23:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 10:23:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 10:23:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 10:23:01,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 10:23:01,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 10:23:01,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 10:23:01,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 10:23:01,723 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 10:23:01,839 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 10:23:01,840 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 10:23:01,973 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 10:23:01,977 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 10:23:01,977 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-19 10:23:01,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 10:23:01 BoogieIcfgContainer [2022-01-19 10:23:01,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 10:23:01,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 10:23:01,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 10:23:01,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 10:23:01,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 10:23:01" (1/3) ... [2022-01-19 10:23:01,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480a486d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 10:23:01, skipping insertion in model container [2022-01-19 10:23:01,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:23:01" (2/3) ... [2022-01-19 10:23:01,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480a486d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 10:23:01, skipping insertion in model container [2022-01-19 10:23:01,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 10:23:01" (3/3) ... [2022-01-19 10:23:01,984 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2022-01-19 10:23:01,987 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 10:23:01,987 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 10:23:01,987 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 10:23:02,007 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,007 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,007 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,007 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,007 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,008 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,008 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,008 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,008 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,008 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,008 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,008 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,009 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,009 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,009 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,009 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,009 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,009 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,010 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,010 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,010 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,010 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,010 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,010 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,010 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,011 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,011 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,011 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,011 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,011 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,011 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,011 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,012 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,012 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,012 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,012 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,012 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,012 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,012 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,013 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,013 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,013 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,013 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,013 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,013 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,014 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,014 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,014 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,014 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,014 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,014 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,014 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,015 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,015 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,015 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,015 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,017 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,017 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,017 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,017 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,017 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,018 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,019 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,019 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,019 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,020 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,020 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,020 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:23:02,020 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 10:23:02,049 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 10:23:02,054 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 10:23:02,054 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 10:23:02,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 70 transitions, 150 flow [2022-01-19 10:23:02,081 INFO L129 PetriNetUnfolder]: 5/68 cut-off events. [2022-01-19 10:23:02,081 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 10:23:02,084 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 10:23:02,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 70 transitions, 150 flow [2022-01-19 10:23:02,087 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 68 transitions, 142 flow [2022-01-19 10:23:02,096 INFO L129 PetriNetUnfolder]: 4/58 cut-off events. [2022-01-19 10:23:02,096 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 10:23:02,096 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:23:02,097 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 10:23:02,097 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 10:23:02,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:23:02,101 INFO L85 PathProgramCache]: Analyzing trace with hash 398220865, now seen corresponding path program 1 times [2022-01-19 10:23:02,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:23:02,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304803215] [2022-01-19 10:23:02,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:02,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:23:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:02,410 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 10:23:02,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:23:02,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304803215] [2022-01-19 10:23:02,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304803215] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:23:02,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:23:02,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 10:23:02,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190296925] [2022-01-19 10:23:02,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:23:02,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 10:23:02,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:23:02,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 10:23:02,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 10:23:02,449 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 10:23:02,452 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 10:23:02,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:23:02,452 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 10:23:02,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:23:02,573 INFO L129 PetriNetUnfolder]: 42/210 cut-off events. [2022-01-19 10:23:02,573 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 10:23:02,574 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 10:23:02,576 INFO L132 encePairwiseOnDemand]: 59/70 looper letters, 22 selfloop transitions, 17 changer transitions 0/92 dead transitions. [2022-01-19 10:23:02,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 92 transitions, 271 flow [2022-01-19 10:23:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 10:23:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 10:23:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 613 transitions. [2022-01-19 10:23:02,587 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8757142857142857 [2022-01-19 10:23:02,587 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 613 transitions. [2022-01-19 10:23:02,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 613 transitions. [2022-01-19 10:23:02,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:23:02,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 613 transitions. [2022-01-19 10:23:02,593 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 10:23:02,599 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 10:23:02,600 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 10:23:02,601 INFO L186 Difference]: Start difference. First operand has 70 places, 68 transitions, 142 flow. Second operand 10 states and 613 transitions. [2022-01-19 10:23:02,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 92 transitions, 271 flow [2022-01-19 10:23:02,603 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 10:23:02,605 INFO L242 Difference]: Finished difference. Result has 85 places, 85 transitions, 276 flow [2022-01-19 10:23:02,606 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 10:23:02,609 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 15 predicate places. [2022-01-19 10:23:02,609 INFO L470 AbstractCegarLoop]: Abstraction has has 85 places, 85 transitions, 276 flow [2022-01-19 10:23:02,609 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 10:23:02,609 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:23:02,609 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 10:23:02,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 10:23:02,610 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 10:23:02,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:23:02,610 INFO L85 PathProgramCache]: Analyzing trace with hash 245149124, now seen corresponding path program 1 times [2022-01-19 10:23:02,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:23:02,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801314192] [2022-01-19 10:23:02,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:02,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:23:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:02,688 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 10:23:02,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:23:02,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801314192] [2022-01-19 10:23:02,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801314192] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:23:02,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:23:02,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 10:23:02,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445646663] [2022-01-19 10:23:02,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:23:02,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 10:23:02,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:23:02,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 10:23:02,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 10:23:02,691 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 10:23:02,691 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 10:23:02,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:23:02,691 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 10:23:02,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:23:02,756 INFO L129 PetriNetUnfolder]: 46/217 cut-off events. [2022-01-19 10:23:02,757 INFO L130 PetriNetUnfolder]: For 109/112 co-relation queries the response was YES. [2022-01-19 10:23:02,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 217 events. 46/217 cut-off events. For 109/112 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 853 event pairs, 0 based on Foata normal form. 3/204 useless extension candidates. Maximal degree in co-relation 376. Up to 35 conditions per place. [2022-01-19 10:23:02,758 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 16 selfloop transitions, 9 changer transitions 40/110 dead transitions. [2022-01-19 10:23:02,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 110 transitions, 508 flow [2022-01-19 10:23:02,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 10:23:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 10:23:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 475 transitions. [2022-01-19 10:23:02,760 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8482142857142857 [2022-01-19 10:23:02,760 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 475 transitions. [2022-01-19 10:23:02,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 475 transitions. [2022-01-19 10:23:02,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:23:02,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 475 transitions. [2022-01-19 10:23:02,762 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 10:23:02,762 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 10:23:02,763 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 10:23:02,763 INFO L186 Difference]: Start difference. First operand has 85 places, 85 transitions, 276 flow. Second operand 8 states and 475 transitions. [2022-01-19 10:23:02,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 110 transitions, 508 flow [2022-01-19 10:23:02,765 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 10:23:02,767 INFO L242 Difference]: Finished difference. Result has 96 places, 67 transitions, 237 flow [2022-01-19 10:23:02,767 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 10:23:02,767 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 26 predicate places. [2022-01-19 10:23:02,768 INFO L470 AbstractCegarLoop]: Abstraction has has 96 places, 67 transitions, 237 flow [2022-01-19 10:23:02,768 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 10:23:02,768 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:23:02,768 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 10:23:02,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 10:23:02,768 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 10:23:02,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:23:02,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1444168350, now seen corresponding path program 1 times [2022-01-19 10:23:02,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:23:02,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739014601] [2022-01-19 10:23:02,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:02,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:23:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:02,861 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 10:23:02,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:23:02,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739014601] [2022-01-19 10:23:02,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739014601] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:23:02,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:23:02,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 10:23:02,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293243838] [2022-01-19 10:23:02,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:23:02,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 10:23:02,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:23:02,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 10:23:02,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 10:23:02,864 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 10:23:02,864 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 10:23:02,864 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:23:02,864 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 10:23:02,864 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:23:02,942 INFO L129 PetriNetUnfolder]: 37/196 cut-off events. [2022-01-19 10:23:02,943 INFO L130 PetriNetUnfolder]: For 258/265 co-relation queries the response was YES. [2022-01-19 10:23:02,944 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 196 events. 37/196 cut-off events. For 258/265 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 651 event pairs, 0 based on Foata normal form. 10/188 useless extension candidates. Maximal degree in co-relation 362. Up to 35 conditions per place. [2022-01-19 10:23:02,945 INFO L132 encePairwiseOnDemand]: 64/70 looper letters, 23 selfloop transitions, 11 changer transitions 8/87 dead transitions. [2022-01-19 10:23:02,945 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 87 transitions, 457 flow [2022-01-19 10:23:02,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 10:23:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 10:23:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 530 transitions. [2022-01-19 10:23:02,947 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8412698412698413 [2022-01-19 10:23:02,948 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 530 transitions. [2022-01-19 10:23:02,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 530 transitions. [2022-01-19 10:23:02,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:23:02,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 530 transitions. [2022-01-19 10:23:02,954 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 10:23:02,955 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 10:23:02,956 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 10:23:02,956 INFO L186 Difference]: Start difference. First operand has 96 places, 67 transitions, 237 flow. Second operand 9 states and 530 transitions. [2022-01-19 10:23:02,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 87 transitions, 457 flow [2022-01-19 10:23:02,961 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 10:23:02,963 INFO L242 Difference]: Finished difference. Result has 86 places, 72 transitions, 289 flow [2022-01-19 10:23:02,963 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 10:23:02,965 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 16 predicate places. [2022-01-19 10:23:02,965 INFO L470 AbstractCegarLoop]: Abstraction has has 86 places, 72 transitions, 289 flow [2022-01-19 10:23:02,965 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 10:23:02,965 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:23:02,965 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 10:23:02,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 10:23:02,965 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 10:23:02,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:23:02,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1245653052, now seen corresponding path program 2 times [2022-01-19 10:23:02,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:23:02,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110434838] [2022-01-19 10:23:02,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:02,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:23:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:03,050 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 10:23:03,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:23:03,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110434838] [2022-01-19 10:23:03,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110434838] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:23:03,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:23:03,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 10:23:03,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133673893] [2022-01-19 10:23:03,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:23:03,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 10:23:03,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:23:03,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 10:23:03,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 10:23:03,056 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 10:23:03,056 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 10:23:03,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:23:03,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 10:23:03,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:23:03,135 INFO L129 PetriNetUnfolder]: 30/185 cut-off events. [2022-01-19 10:23:03,135 INFO L130 PetriNetUnfolder]: For 246/265 co-relation queries the response was YES. [2022-01-19 10:23:03,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 185 events. 30/185 cut-off events. For 246/265 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 614 event pairs, 0 based on Foata normal form. 16/184 useless extension candidates. Maximal degree in co-relation 373. Up to 32 conditions per place. [2022-01-19 10:23:03,136 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 19 selfloop transitions, 12 changer transitions 11/87 dead transitions. [2022-01-19 10:23:03,136 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 87 transitions, 487 flow [2022-01-19 10:23:03,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 10:23:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 10:23:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 524 transitions. [2022-01-19 10:23:03,138 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8317460317460318 [2022-01-19 10:23:03,138 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 524 transitions. [2022-01-19 10:23:03,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 524 transitions. [2022-01-19 10:23:03,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:23:03,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 524 transitions. [2022-01-19 10:23:03,139 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 10:23:03,140 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 10:23:03,140 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 10:23:03,140 INFO L186 Difference]: Start difference. First operand has 86 places, 72 transitions, 289 flow. Second operand 9 states and 524 transitions. [2022-01-19 10:23:03,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 87 transitions, 487 flow [2022-01-19 10:23:03,142 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 10:23:03,145 INFO L242 Difference]: Finished difference. Result has 93 places, 73 transitions, 332 flow [2022-01-19 10:23:03,145 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 10:23:03,146 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 23 predicate places. [2022-01-19 10:23:03,146 INFO L470 AbstractCegarLoop]: Abstraction has has 93 places, 73 transitions, 332 flow [2022-01-19 10:23:03,146 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 10:23:03,147 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:23:03,147 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 10:23:03,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 10:23:03,147 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 10:23:03,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:23:03,148 INFO L85 PathProgramCache]: Analyzing trace with hash 704825237, now seen corresponding path program 1 times [2022-01-19 10:23:03,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:23:03,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524020650] [2022-01-19 10:23:03,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:03,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:23:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:03,240 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 10:23:03,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:23:03,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524020650] [2022-01-19 10:23:03,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524020650] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:23:03,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:23:03,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 10:23:03,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932989015] [2022-01-19 10:23:03,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:23:03,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 10:23:03,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:23:03,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 10:23:03,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 10:23:03,243 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 10:23:03,243 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 10:23:03,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:23:03,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 10:23:03,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:23:03,355 INFO L129 PetriNetUnfolder]: 43/227 cut-off events. [2022-01-19 10:23:03,355 INFO L130 PetriNetUnfolder]: For 607/629 co-relation queries the response was YES. [2022-01-19 10:23:03,356 INFO L84 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 227 events. 43/227 cut-off events. For 607/629 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 792 event pairs, 1 based on Foata normal form. 15/221 useless extension candidates. Maximal degree in co-relation 528. Up to 50 conditions per place. [2022-01-19 10:23:03,357 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 23 selfloop transitions, 21 changer transitions 8/97 dead transitions. [2022-01-19 10:23:03,357 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 660 flow [2022-01-19 10:23:03,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 10:23:03,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 10:23:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 644 transitions. [2022-01-19 10:23:03,359 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8363636363636363 [2022-01-19 10:23:03,359 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 644 transitions. [2022-01-19 10:23:03,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 644 transitions. [2022-01-19 10:23:03,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:23:03,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 644 transitions. [2022-01-19 10:23:03,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 58.54545454545455) internal successors, (644), 11 states have internal predecessors, (644), 0 states have call successors, (0), 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 10:23:03,362 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 10:23:03,362 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 10:23:03,363 INFO L186 Difference]: Start difference. First operand has 93 places, 73 transitions, 332 flow. Second operand 11 states and 644 transitions. [2022-01-19 10:23:03,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 660 flow [2022-01-19 10:23:03,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 97 transitions, 544 flow, removed 45 selfloop flow, removed 10 redundant places. [2022-01-19 10:23:03,367 INFO L242 Difference]: Finished difference. Result has 97 places, 79 transitions, 417 flow [2022-01-19 10:23:03,367 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=417, PETRI_PLACES=97, PETRI_TRANSITIONS=79} [2022-01-19 10:23:03,369 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 27 predicate places. [2022-01-19 10:23:03,369 INFO L470 AbstractCegarLoop]: Abstraction has has 97 places, 79 transitions, 417 flow [2022-01-19 10:23:03,370 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 10:23:03,370 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:23:03,370 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 10:23:03,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 10:23:03,370 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 10:23:03,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:23:03,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1426423327, now seen corresponding path program 2 times [2022-01-19 10:23:03,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:23:03,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770588556] [2022-01-19 10:23:03,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:03,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:23:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:03,489 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 10:23:03,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:23:03,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770588556] [2022-01-19 10:23:03,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770588556] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:23:03,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:23:03,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 10:23:03,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111490993] [2022-01-19 10:23:03,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:23:03,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 10:23:03,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:23:03,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 10:23:03,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 10:23:03,492 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 10:23:03,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 79 transitions, 417 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 10:23:03,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:23:03,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 10:23:03,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:23:03,611 INFO L129 PetriNetUnfolder]: 38/219 cut-off events. [2022-01-19 10:23:03,611 INFO L130 PetriNetUnfolder]: For 828/871 co-relation queries the response was YES. [2022-01-19 10:23:03,611 INFO L84 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 219 events. 38/219 cut-off events. For 828/871 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 805 event pairs, 1 based on Foata normal form. 25/223 useless extension candidates. Maximal degree in co-relation 579. Up to 46 conditions per place. [2022-01-19 10:23:03,612 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 21 selfloop transitions, 23 changer transitions 11/100 dead transitions. [2022-01-19 10:23:03,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 100 transitions, 791 flow [2022-01-19 10:23:03,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 10:23:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 10:23:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 696 transitions. [2022-01-19 10:23:03,614 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2022-01-19 10:23:03,614 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 696 transitions. [2022-01-19 10:23:03,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 696 transitions. [2022-01-19 10:23:03,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:23:03,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 696 transitions. [2022-01-19 10:23:03,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 58.0) internal successors, (696), 12 states have internal predecessors, (696), 0 states have call successors, (0), 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 10:23:03,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 70.0) internal successors, (910), 13 states have internal predecessors, (910), 0 states have call successors, (0), 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 10:23:03,617 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 70.0) internal successors, (910), 13 states have internal predecessors, (910), 0 states have call successors, (0), 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 10:23:03,617 INFO L186 Difference]: Start difference. First operand has 97 places, 79 transitions, 417 flow. Second operand 12 states and 696 transitions. [2022-01-19 10:23:03,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 100 transitions, 791 flow [2022-01-19 10:23:03,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 100 transitions, 733 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-01-19 10:23:03,620 INFO L242 Difference]: Finished difference. Result has 106 places, 82 transitions, 505 flow [2022-01-19 10:23:03,620 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=505, PETRI_PLACES=106, PETRI_TRANSITIONS=82} [2022-01-19 10:23:03,621 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 36 predicate places. [2022-01-19 10:23:03,621 INFO L470 AbstractCegarLoop]: Abstraction has has 106 places, 82 transitions, 505 flow [2022-01-19 10:23:03,621 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 10:23:03,621 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:23:03,621 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 10:23:03,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 10:23:03,622 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 10:23:03,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:23:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash 827405232, now seen corresponding path program 1 times [2022-01-19 10:23:03,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:23:03,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162488195] [2022-01-19 10:23:03,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:03,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:23:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:03,696 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 10:23:03,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:23:03,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162488195] [2022-01-19 10:23:03,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162488195] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:23:03,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799602329] [2022-01-19 10:23:03,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:03,697 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:23:03,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:23:03,699 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 10:23:03,703 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 10:23:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:03,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 10:23:03,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:23:03,917 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 10:23:03,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:23:04,123 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 10:23:04,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799602329] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:23:04,123 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:23:04,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-01-19 10:23:04,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109938776] [2022-01-19 10:23:04,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:23:04,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 10:23:04,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:23:04,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 10:23:04,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-01-19 10:23:04,126 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 10:23:04,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 82 transitions, 505 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 10:23:04,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:23:04,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 10:23:04,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:23:04,308 INFO L129 PetriNetUnfolder]: 50/302 cut-off events. [2022-01-19 10:23:04,308 INFO L130 PetriNetUnfolder]: For 1595/1642 co-relation queries the response was YES. [2022-01-19 10:23:04,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 302 events. 50/302 cut-off events. For 1595/1642 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1067 event pairs, 0 based on Foata normal form. 29/300 useless extension candidates. Maximal degree in co-relation 868. Up to 62 conditions per place. [2022-01-19 10:23:04,311 INFO L132 encePairwiseOnDemand]: 64/70 looper letters, 35 selfloop transitions, 17 changer transitions 20/117 dead transitions. [2022-01-19 10:23:04,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 1183 flow [2022-01-19 10:23:04,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 10:23:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 10:23:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1104 transitions. [2022-01-19 10:23:04,313 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8300751879699249 [2022-01-19 10:23:04,313 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1104 transitions. [2022-01-19 10:23:04,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1104 transitions. [2022-01-19 10:23:04,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:23:04,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1104 transitions. [2022-01-19 10:23:04,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 58.10526315789474) internal successors, (1104), 19 states have internal predecessors, (1104), 0 states have call successors, (0), 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 10:23:04,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 70.0) internal successors, (1400), 20 states have internal predecessors, (1400), 0 states have call successors, (0), 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 10:23:04,317 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 70.0) internal successors, (1400), 20 states have internal predecessors, (1400), 0 states have call successors, (0), 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 10:23:04,317 INFO L186 Difference]: Start difference. First operand has 106 places, 82 transitions, 505 flow. Second operand 19 states and 1104 transitions. [2022-01-19 10:23:04,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 1183 flow [2022-01-19 10:23:04,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 117 transitions, 1094 flow, removed 27 selfloop flow, removed 9 redundant places. [2022-01-19 10:23:04,323 INFO L242 Difference]: Finished difference. Result has 125 places, 88 transitions, 628 flow [2022-01-19 10:23:04,323 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=628, PETRI_PLACES=125, PETRI_TRANSITIONS=88} [2022-01-19 10:23:04,323 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 55 predicate places. [2022-01-19 10:23:04,323 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 88 transitions, 628 flow [2022-01-19 10:23:04,324 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 10:23:04,324 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:23:04,324 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 10:23:04,342 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 10:23:04,540 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 10:23:04,540 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 10:23:04,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:23:04,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1816530946, now seen corresponding path program 2 times [2022-01-19 10:23:04,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:23:04,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704340633] [2022-01-19 10:23:04,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:04,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:23:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:04,628 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 10:23:04,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:23:04,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704340633] [2022-01-19 10:23:04,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704340633] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:23:04,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933772313] [2022-01-19 10:23:04,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 10:23:04,629 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:23:04,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:23:04,630 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 10:23:04,659 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 10:23:04,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 10:23:04,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 10:23:04,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 10:23:04,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:23:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:04,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:23:05,022 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 10:23:05,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933772313] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:23:05,023 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:23:05,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-01-19 10:23:05,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501794689] [2022-01-19 10:23:05,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:23:05,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 10:23:05,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:23:05,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 10:23:05,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-01-19 10:23:05,024 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 10:23:05,025 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 88 transitions, 628 flow. Second operand has 14 states, 14 states have (on average 56.714285714285715) internal successors, (794), 14 states have internal predecessors, (794), 0 states have call successors, (0), 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 10:23:05,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:23:05,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 10:23:05,025 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:23:05,351 INFO L129 PetriNetUnfolder]: 70/430 cut-off events. [2022-01-19 10:23:05,351 INFO L130 PetriNetUnfolder]: For 5983/6065 co-relation queries the response was YES. [2022-01-19 10:23:05,353 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1713 conditions, 430 events. 70/430 cut-off events. For 5983/6065 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2129 event pairs, 0 based on Foata normal form. 30/418 useless extension candidates. Maximal degree in co-relation 1644. Up to 94 conditions per place. [2022-01-19 10:23:05,355 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 32 selfloop transitions, 43 changer transitions 23/143 dead transitions. [2022-01-19 10:23:05,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 143 transitions, 2111 flow [2022-01-19 10:23:05,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-19 10:23:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-01-19 10:23:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1564 transitions. [2022-01-19 10:23:05,358 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8275132275132275 [2022-01-19 10:23:05,358 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 1564 transitions. [2022-01-19 10:23:05,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 1564 transitions. [2022-01-19 10:23:05,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:23:05,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1564 transitions. [2022-01-19 10:23:05,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 57.925925925925924) internal successors, (1564), 27 states have internal predecessors, (1564), 0 states have call successors, (0), 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 10:23:05,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 70.0) internal successors, (1960), 28 states have internal predecessors, (1960), 0 states have call successors, (0), 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 10:23:05,364 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 70.0) internal successors, (1960), 28 states have internal predecessors, (1960), 0 states have call successors, (0), 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 10:23:05,364 INFO L186 Difference]: Start difference. First operand has 125 places, 88 transitions, 628 flow. Second operand 27 states and 1564 transitions. [2022-01-19 10:23:05,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 143 transitions, 2111 flow [2022-01-19 10:23:05,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 143 transitions, 1735 flow, removed 177 selfloop flow, removed 12 redundant places. [2022-01-19 10:23:05,375 INFO L242 Difference]: Finished difference. Result has 151 places, 108 transitions, 1053 flow [2022-01-19 10:23:05,375 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1053, PETRI_PLACES=151, PETRI_TRANSITIONS=108} [2022-01-19 10:23:05,375 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 81 predicate places. [2022-01-19 10:23:05,375 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 108 transitions, 1053 flow [2022-01-19 10:23:05,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 56.714285714285715) internal successors, (794), 14 states have internal predecessors, (794), 0 states have call successors, (0), 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 10:23:05,376 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:23:05,376 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1] [2022-01-19 10:23:05,392 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 10:23:05,592 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 10:23:05,592 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 10:23:05,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:23:05,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2100588598, now seen corresponding path program 1 times [2022-01-19 10:23:05,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:23:05,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986916175] [2022-01-19 10:23:05,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:05,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:23:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:05,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:23:05,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986916175] [2022-01-19 10:23:05,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986916175] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:23:05,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834506356] [2022-01-19 10:23:05,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:05,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:23:05,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:23:05,668 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 10:23:05,669 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 10:23:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:05,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-19 10:23:05,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:23:05,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:05,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:23:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:05,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834506356] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:23:05,984 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:23:05,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-01-19 10:23:05,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905701568] [2022-01-19 10:23:05,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:23:05,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 10:23:05,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:23:05,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 10:23:05,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-01-19 10:23:05,986 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 10:23:05,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 108 transitions, 1053 flow. Second operand has 15 states, 15 states have (on average 56.53333333333333) internal successors, (848), 15 states have internal predecessors, (848), 0 states have call successors, (0), 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 10:23:05,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:23:05,987 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 10:23:05,987 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:23:06,259 INFO L129 PetriNetUnfolder]: 99/635 cut-off events. [2022-01-19 10:23:06,259 INFO L130 PetriNetUnfolder]: For 17396/17503 co-relation queries the response was YES. [2022-01-19 10:23:06,262 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3213 conditions, 635 events. 99/635 cut-off events. For 17396/17503 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3769 event pairs, 1 based on Foata normal form. 38/609 useless extension candidates. Maximal degree in co-relation 3131. Up to 140 conditions per place. [2022-01-19 10:23:06,266 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 42 selfloop transitions, 59 changer transitions 20/166 dead transitions. [2022-01-19 10:23:06,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 3308 flow [2022-01-19 10:23:06,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-19 10:23:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-01-19 10:23:06,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1509 transitions. [2022-01-19 10:23:06,268 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8291208791208792 [2022-01-19 10:23:06,268 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1509 transitions. [2022-01-19 10:23:06,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1509 transitions. [2022-01-19 10:23:06,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:23:06,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1509 transitions. [2022-01-19 10:23:06,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 58.03846153846154) internal successors, (1509), 26 states have internal predecessors, (1509), 0 states have call successors, (0), 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 10:23:06,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 70.0) internal successors, (1890), 27 states have internal predecessors, (1890), 0 states have call successors, (0), 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 10:23:06,276 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 70.0) internal successors, (1890), 27 states have internal predecessors, (1890), 0 states have call successors, (0), 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 10:23:06,276 INFO L186 Difference]: Start difference. First operand has 151 places, 108 transitions, 1053 flow. Second operand 26 states and 1509 transitions. [2022-01-19 10:23:06,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 3308 flow [2022-01-19 10:23:06,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 166 transitions, 2734 flow, removed 280 selfloop flow, removed 11 redundant places. [2022-01-19 10:23:06,300 INFO L242 Difference]: Finished difference. Result has 172 places, 124 transitions, 1475 flow [2022-01-19 10:23:06,300 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1475, PETRI_PLACES=172, PETRI_TRANSITIONS=124} [2022-01-19 10:23:06,301 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 102 predicate places. [2022-01-19 10:23:06,301 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 124 transitions, 1475 flow [2022-01-19 10:23:06,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 56.53333333333333) internal successors, (848), 15 states have internal predecessors, (848), 0 states have call successors, (0), 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 10:23:06,301 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:23:06,301 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1] [2022-01-19 10:23:06,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 10:23:06,518 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 10:23:06,520 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 10:23:06,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:23:06,521 INFO L85 PathProgramCache]: Analyzing trace with hash 139077154, now seen corresponding path program 2 times [2022-01-19 10:23:06,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:23:06,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216450869] [2022-01-19 10:23:06,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:06,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:23:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:06,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:23:06,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216450869] [2022-01-19 10:23:06,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216450869] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:23:06,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320146673] [2022-01-19 10:23:06,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 10:23:06,576 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:23:06,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:23:06,577 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 10:23:06,578 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 10:23:06,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 10:23:06,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 10:23:06,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 10:23:06,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:23:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:06,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:23:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:06,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320146673] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:23:06,850 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:23:06,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-01-19 10:23:06,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050850489] [2022-01-19 10:23:06,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:23:06,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-19 10:23:06,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:23:06,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-19 10:23:06,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-01-19 10:23:06,851 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 10:23:06,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 124 transitions, 1475 flow. Second operand has 16 states, 16 states have (on average 56.5) internal successors, (904), 16 states have internal predecessors, (904), 0 states have call successors, (0), 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 10:23:06,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:23:06,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 10:23:06,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:23:07,225 INFO L129 PetriNetUnfolder]: 106/672 cut-off events. [2022-01-19 10:23:07,225 INFO L130 PetriNetUnfolder]: For 27817/28030 co-relation queries the response was YES. [2022-01-19 10:23:07,228 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3905 conditions, 672 events. 106/672 cut-off events. For 27817/28030 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4037 event pairs, 1 based on Foata normal form. 45/650 useless extension candidates. Maximal degree in co-relation 3815. Up to 152 conditions per place. [2022-01-19 10:23:07,232 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 36 selfloop transitions, 81 changer transitions 25/187 dead transitions. [2022-01-19 10:23:07,232 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 187 transitions, 4401 flow [2022-01-19 10:23:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-19 10:23:07,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-01-19 10:23:07,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1564 transitions. [2022-01-19 10:23:07,234 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8275132275132275 [2022-01-19 10:23:07,234 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 1564 transitions. [2022-01-19 10:23:07,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 1564 transitions. [2022-01-19 10:23:07,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:23:07,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1564 transitions. [2022-01-19 10:23:07,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 57.925925925925924) internal successors, (1564), 27 states have internal predecessors, (1564), 0 states have call successors, (0), 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 10:23:07,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 70.0) internal successors, (1960), 28 states have internal predecessors, (1960), 0 states have call successors, (0), 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 10:23:07,239 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 70.0) internal successors, (1960), 28 states have internal predecessors, (1960), 0 states have call successors, (0), 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 10:23:07,239 INFO L186 Difference]: Start difference. First operand has 172 places, 124 transitions, 1475 flow. Second operand 27 states and 1564 transitions. [2022-01-19 10:23:07,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 187 transitions, 4401 flow [2022-01-19 10:23:07,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 187 transitions, 3249 flow, removed 540 selfloop flow, removed 22 redundant places. [2022-01-19 10:23:07,269 INFO L242 Difference]: Finished difference. Result has 186 places, 143 transitions, 1907 flow [2022-01-19 10:23:07,269 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1907, PETRI_PLACES=186, PETRI_TRANSITIONS=143} [2022-01-19 10:23:07,270 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 116 predicate places. [2022-01-19 10:23:07,270 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 143 transitions, 1907 flow [2022-01-19 10:23:07,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 56.5) internal successors, (904), 16 states have internal predecessors, (904), 0 states have call successors, (0), 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 10:23:07,270 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:23:07,270 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:23:07,288 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 10:23:07,479 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 10:23:07,480 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 10:23:07,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:23:07,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1699425060, now seen corresponding path program 3 times [2022-01-19 10:23:07,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:23:07,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930222845] [2022-01-19 10:23:07,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:07,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:23:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:07,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:23:07,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930222845] [2022-01-19 10:23:07,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930222845] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:23:07,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43927297] [2022-01-19 10:23:07,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 10:23:07,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:23:07,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:23:07,558 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 10:23:07,560 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 10:23:07,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-01-19 10:23:07,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 10:23:07,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 10:23:07,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:23:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:07,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:23:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:07,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43927297] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:23:07,957 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:23:07,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2022-01-19 10:23:07,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119746465] [2022-01-19 10:23:07,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:23:07,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-19 10:23:07,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:23:07,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-19 10:23:07,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2022-01-19 10:23:07,959 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 10:23:07,960 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 143 transitions, 1907 flow. Second operand has 24 states, 24 states have (on average 56.375) internal successors, (1353), 24 states have internal predecessors, (1353), 0 states have call successors, (0), 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 10:23:07,960 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:23:07,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 10:23:07,960 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:23:08,715 INFO L129 PetriNetUnfolder]: 145/918 cut-off events. [2022-01-19 10:23:08,715 INFO L130 PetriNetUnfolder]: For 36320/36461 co-relation queries the response was YES. [2022-01-19 10:23:08,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5341 conditions, 918 events. 145/918 cut-off events. For 36320/36461 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5423 event pairs, 0 based on Foata normal form. 41/866 useless extension candidates. Maximal degree in co-relation 5246. Up to 196 conditions per place. [2022-01-19 10:23:08,726 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 48 selfloop transitions, 120 changer transitions 29/242 dead transitions. [2022-01-19 10:23:08,726 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 242 transitions, 6499 flow [2022-01-19 10:23:08,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-19 10:23:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-01-19 10:23:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 2720 transitions. [2022-01-19 10:23:08,729 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8267477203647416 [2022-01-19 10:23:08,729 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 2720 transitions. [2022-01-19 10:23:08,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 2720 transitions. [2022-01-19 10:23:08,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:23:08,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 2720 transitions. [2022-01-19 10:23:08,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 57.87234042553192) internal successors, (2720), 47 states have internal predecessors, (2720), 0 states have call successors, (0), 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 10:23:08,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 70.0) internal successors, (3360), 48 states have internal predecessors, (3360), 0 states have call successors, (0), 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 10:23:08,738 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 70.0) internal successors, (3360), 48 states have internal predecessors, (3360), 0 states have call successors, (0), 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 10:23:08,738 INFO L186 Difference]: Start difference. First operand has 186 places, 143 transitions, 1907 flow. Second operand 47 states and 2720 transitions. [2022-01-19 10:23:08,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 242 transitions, 6499 flow [2022-01-19 10:23:08,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 242 transitions, 5536 flow, removed 447 selfloop flow, removed 20 redundant places. [2022-01-19 10:23:08,794 INFO L242 Difference]: Finished difference. Result has 233 places, 180 transitions, 3004 flow [2022-01-19 10:23:08,794 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=3004, PETRI_PLACES=233, PETRI_TRANSITIONS=180} [2022-01-19 10:23:08,794 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 163 predicate places. [2022-01-19 10:23:08,794 INFO L470 AbstractCegarLoop]: Abstraction has has 233 places, 180 transitions, 3004 flow [2022-01-19 10:23:08,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 56.375) internal successors, (1353), 24 states have internal predecessors, (1353), 0 states have call successors, (0), 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 10:23:08,795 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:23:08,795 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:23:08,814 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 10:23:09,007 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 10:23:09,007 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 10:23:09,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:23:09,008 INFO L85 PathProgramCache]: Analyzing trace with hash 736772455, now seen corresponding path program 4 times [2022-01-19 10:23:09,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:23:09,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076752403] [2022-01-19 10:23:09,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:09,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:23:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:09,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:23:09,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076752403] [2022-01-19 10:23:09,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076752403] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:23:09,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309902586] [2022-01-19 10:23:09,220 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 10:23:09,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:23:09,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:23:09,221 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 10:23:09,223 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 10:23:09,285 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 10:23:09,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 10:23:09,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-19 10:23:09,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:23:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:09,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:23:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:10,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309902586] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:23:10,138 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:23:10,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 35 [2022-01-19 10:23:10,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210492555] [2022-01-19 10:23:10,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:23:10,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-19 10:23:10,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:23:10,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-19 10:23:10,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2022-01-19 10:23:10,142 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 10:23:10,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 180 transitions, 3004 flow. Second operand has 35 states, 35 states have (on average 56.2) internal successors, (1967), 35 states have internal predecessors, (1967), 0 states have call successors, (0), 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 10:23:10,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:23:10,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 10:23:10,144 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:23:11,074 INFO L129 PetriNetUnfolder]: 203/1348 cut-off events. [2022-01-19 10:23:11,074 INFO L130 PetriNetUnfolder]: For 111335/111640 co-relation queries the response was YES. [2022-01-19 10:23:11,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10256 conditions, 1348 events. 203/1348 cut-off events. For 111335/111640 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8044 event pairs, 1 based on Foata normal form. 43/1247 useless extension candidates. Maximal degree in co-relation 10144. Up to 298 conditions per place. [2022-01-19 10:23:11,096 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 106 selfloop transitions, 109 changer transitions 50/310 dead transitions. [2022-01-19 10:23:11,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 310 transitions, 11645 flow [2022-01-19 10:23:11,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-01-19 10:23:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-01-19 10:23:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 3233 transitions. [2022-01-19 10:23:11,100 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8247448979591837 [2022-01-19 10:23:11,100 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 3233 transitions. [2022-01-19 10:23:11,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 3233 transitions. [2022-01-19 10:23:11,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:23:11,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 3233 transitions. [2022-01-19 10:23:11,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 57.732142857142854) internal successors, (3233), 56 states have internal predecessors, (3233), 0 states have call successors, (0), 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 10:23:11,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 70.0) internal successors, (3990), 57 states have internal predecessors, (3990), 0 states have call successors, (0), 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 10:23:11,108 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 70.0) internal successors, (3990), 57 states have internal predecessors, (3990), 0 states have call successors, (0), 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 10:23:11,108 INFO L186 Difference]: Start difference. First operand has 233 places, 180 transitions, 3004 flow. Second operand 56 states and 3233 transitions. [2022-01-19 10:23:11,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 310 transitions, 11645 flow [2022-01-19 10:23:11,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 310 transitions, 9275 flow, removed 1160 selfloop flow, removed 23 redundant places. [2022-01-19 10:23:11,287 INFO L242 Difference]: Finished difference. Result has 288 places, 224 transitions, 4214 flow [2022-01-19 10:23:11,287 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=4214, PETRI_PLACES=288, PETRI_TRANSITIONS=224} [2022-01-19 10:23:11,287 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 218 predicate places. [2022-01-19 10:23:11,287 INFO L470 AbstractCegarLoop]: Abstraction has has 288 places, 224 transitions, 4214 flow [2022-01-19 10:23:11,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 56.2) internal successors, (1967), 35 states have internal predecessors, (1967), 0 states have call successors, (0), 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 10:23:11,288 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:23:11,288 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:23:11,306 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 10:23:11,495 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 10:23:11,495 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 10:23:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:23:11,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1777329741, now seen corresponding path program 5 times [2022-01-19 10:23:11,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:23:11,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987621201] [2022-01-19 10:23:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:11,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:23:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:11,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:23:11,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987621201] [2022-01-19 10:23:11,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987621201] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:23:11,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058818333] [2022-01-19 10:23:11,652 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 10:23:11,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:23:11,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:23:11,653 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 10:23:11,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 10:23:11,713 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-01-19 10:23:11,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 10:23:11,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-19 10:23:11,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:23:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:11,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:23:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:12,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058818333] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:23:12,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:23:12,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2022-01-19 10:23:12,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114805870] [2022-01-19 10:23:12,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:23:12,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-19 10:23:12,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:23:12,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-19 10:23:12,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1048, Unknown=0, NotChecked=0, Total=1260 [2022-01-19 10:23:12,438 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 10:23:12,439 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 224 transitions, 4214 flow. Second operand has 36 states, 36 states have (on average 56.25) internal successors, (2025), 36 states have internal predecessors, (2025), 0 states have call successors, (0), 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 10:23:12,439 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:23:12,439 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 10:23:12,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:23:13,860 INFO L129 PetriNetUnfolder]: 262/1770 cut-off events. [2022-01-19 10:23:13,861 INFO L130 PetriNetUnfolder]: For 243126/243628 co-relation queries the response was YES. [2022-01-19 10:23:13,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15740 conditions, 1770 events. 262/1770 cut-off events. For 243126/243628 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 11606 event pairs, 0 based on Foata normal form. 43/1629 useless extension candidates. Maximal degree in co-relation 15608. Up to 406 conditions per place. [2022-01-19 10:23:13,885 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 72 selfloop transitions, 213 changer transitions 50/380 dead transitions. [2022-01-19 10:23:13,886 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 380 transitions, 15876 flow [2022-01-19 10:23:13,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-01-19 10:23:13,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2022-01-19 10:23:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 3814 transitions. [2022-01-19 10:23:13,889 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8255411255411256 [2022-01-19 10:23:13,889 INFO L72 ComplementDD]: Start complementDD. Operand 66 states and 3814 transitions. [2022-01-19 10:23:13,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 3814 transitions. [2022-01-19 10:23:13,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:23:13,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 66 states and 3814 transitions. [2022-01-19 10:23:13,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 67 states, 66 states have (on average 57.78787878787879) internal successors, (3814), 66 states have internal predecessors, (3814), 0 states have call successors, (0), 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 10:23:13,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 67 states, 67 states have (on average 70.0) internal successors, (4690), 67 states have internal predecessors, (4690), 0 states have call successors, (0), 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 10:23:13,897 INFO L81 ComplementDD]: Finished complementDD. Result has 67 states, 67 states have (on average 70.0) internal successors, (4690), 67 states have internal predecessors, (4690), 0 states have call successors, (0), 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 10:23:13,897 INFO L186 Difference]: Start difference. First operand has 288 places, 224 transitions, 4214 flow. Second operand 66 states and 3814 transitions. [2022-01-19 10:23:13,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 380 transitions, 15876 flow [2022-01-19 10:23:14,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 380 transitions, 13348 flow, removed 1227 selfloop flow, removed 30 redundant places. [2022-01-19 10:23:14,158 INFO L242 Difference]: Finished difference. Result has 345 places, 285 transitions, 6241 flow [2022-01-19 10:23:14,158 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=3366, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=6241, PETRI_PLACES=345, PETRI_TRANSITIONS=285} [2022-01-19 10:23:14,159 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 275 predicate places. [2022-01-19 10:23:14,159 INFO L470 AbstractCegarLoop]: Abstraction has has 345 places, 285 transitions, 6241 flow [2022-01-19 10:23:14,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 56.25) internal successors, (2025), 36 states have internal predecessors, (2025), 0 states have call successors, (0), 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 10:23:14,159 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:23:14,160 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:23:14,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 10:23:14,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:23:14,361 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 10:23:14,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:23:14,361 INFO L85 PathProgramCache]: Analyzing trace with hash -408255069, now seen corresponding path program 6 times [2022-01-19 10:23:14,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:23:14,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962390125] [2022-01-19 10:23:14,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:14,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:23:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:14,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:23:14,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962390125] [2022-01-19 10:23:14,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962390125] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:23:14,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414469441] [2022-01-19 10:23:14,489 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-19 10:23:14,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:23:14,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:23:14,490 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 10:23:14,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 10:23:14,572 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-01-19 10:23:14,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 10:23:14,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-19 10:23:14,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:23:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:14,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:23:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:15,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414469441] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:23:15,057 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:23:15,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 35 [2022-01-19 10:23:15,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047204929] [2022-01-19 10:23:15,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:23:15,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-19 10:23:15,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:23:15,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-19 10:23:15,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2022-01-19 10:23:15,059 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 10:23:15,061 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 285 transitions, 6241 flow. Second operand has 35 states, 35 states have (on average 56.22857142857143) internal successors, (1968), 35 states have internal predecessors, (1968), 0 states have call successors, (0), 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 10:23:15,061 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:23:15,061 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 10:23:15,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:23:16,817 INFO L129 PetriNetUnfolder]: 320/2100 cut-off events. [2022-01-19 10:23:16,817 INFO L130 PetriNetUnfolder]: For 426184/427259 co-relation queries the response was YES. [2022-01-19 10:23:16,891 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22517 conditions, 2100 events. 320/2100 cut-off events. For 426184/427259 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 13952 event pairs, 1 based on Foata normal form. 54/1938 useless extension candidates. Maximal degree in co-relation 22362. Up to 490 conditions per place. [2022-01-19 10:23:16,913 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 79 selfloop transitions, 277 changer transitions 53/454 dead transitions. [2022-01-19 10:23:16,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 454 transitions, 23682 flow [2022-01-19 10:23:16,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-01-19 10:23:16,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2022-01-19 10:23:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 4570 transitions. [2022-01-19 10:23:16,916 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8264014466546112 [2022-01-19 10:23:16,916 INFO L72 ComplementDD]: Start complementDD. Operand 79 states and 4570 transitions. [2022-01-19 10:23:16,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 4570 transitions. [2022-01-19 10:23:16,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:23:16,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 79 states and 4570 transitions. [2022-01-19 10:23:16,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 80 states, 79 states have (on average 57.848101265822784) internal successors, (4570), 79 states have internal predecessors, (4570), 0 states have call successors, (0), 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 10:23:16,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 80 states, 80 states have (on average 70.0) internal successors, (5600), 80 states have internal predecessors, (5600), 0 states have call successors, (0), 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 10:23:16,930 INFO L81 ComplementDD]: Finished complementDD. Result has 80 states, 80 states have (on average 70.0) internal successors, (5600), 80 states have internal predecessors, (5600), 0 states have call successors, (0), 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 10:23:16,930 INFO L186 Difference]: Start difference. First operand has 345 places, 285 transitions, 6241 flow. Second operand 79 states and 4570 transitions. [2022-01-19 10:23:16,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 454 transitions, 23682 flow [2022-01-19 10:23:17,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 454 transitions, 19694 flow, removed 1907 selfloop flow, removed 37 redundant places. [2022-01-19 10:23:17,454 INFO L242 Difference]: Finished difference. Result has 419 places, 341 transitions, 8978 flow [2022-01-19 10:23:17,454 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=4743, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=79, PETRI_FLOW=8978, PETRI_PLACES=419, PETRI_TRANSITIONS=341} [2022-01-19 10:23:17,455 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 349 predicate places. [2022-01-19 10:23:17,455 INFO L470 AbstractCegarLoop]: Abstraction has has 419 places, 341 transitions, 8978 flow [2022-01-19 10:23:17,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 56.22857142857143) internal successors, (1968), 35 states have internal predecessors, (1968), 0 states have call successors, (0), 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 10:23:17,455 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:23:17,456 INFO L254 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:23:17,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 10:23:17,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-19 10:23:17,672 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 10:23:17,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:23:17,672 INFO L85 PathProgramCache]: Analyzing trace with hash -744878844, now seen corresponding path program 7 times [2022-01-19 10:23:17,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:23:17,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275214489] [2022-01-19 10:23:17,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:17,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:23:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 0 proven. 832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:17,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:23:17,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275214489] [2022-01-19 10:23:17,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275214489] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:23:17,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828541744] [2022-01-19 10:23:17,987 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-19 10:23:17,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:23:17,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:23:17,988 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 10:23:17,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 10:23:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:23:18,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-19 10:23:18,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:23:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 0 proven. 832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:18,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:23:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 0 proven. 832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:18,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828541744] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:23:18,933 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:23:18,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 50 [2022-01-19 10:23:18,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883173895] [2022-01-19 10:23:18,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:23:18,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-19 10:23:18,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:23:18,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-19 10:23:18,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=1898, Unknown=0, NotChecked=0, Total=2450 [2022-01-19 10:23:18,936 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-01-19 10:23:18,937 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 341 transitions, 8978 flow. Second operand has 50 states, 50 states have (on average 56.2) internal successors, (2810), 50 states have internal predecessors, (2810), 0 states have call successors, (0), 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 10:23:18,937 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:23:18,937 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-01-19 10:23:18,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:23:21,952 INFO L129 PetriNetUnfolder]: 423/2913 cut-off events. [2022-01-19 10:23:21,953 INFO L130 PetriNetUnfolder]: For 946950/947347 co-relation queries the response was YES. [2022-01-19 10:23:21,989 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36049 conditions, 2913 events. 423/2913 cut-off events. For 946950/947347 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 19529 event pairs, 0 based on Foata normal form. 50/2657 useless extension candidates. Maximal degree in co-relation 35862. Up to 640 conditions per place. [2022-01-19 10:23:22,019 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 104 selfloop transitions, 386 changer transitions 47/582 dead transitions. [2022-01-19 10:23:22,019 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 582 transitions, 36059 flow [2022-01-19 10:23:22,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-01-19 10:23:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2022-01-19 10:23:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 6064 transitions. [2022-01-19 10:23:22,023 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8250340136054422 [2022-01-19 10:23:22,023 INFO L72 ComplementDD]: Start complementDD. Operand 105 states and 6064 transitions. [2022-01-19 10:23:22,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 6064 transitions. [2022-01-19 10:23:22,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:23:22,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 105 states and 6064 transitions. [2022-01-19 10:23:22,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 106 states, 105 states have (on average 57.75238095238095) internal successors, (6064), 105 states have internal predecessors, (6064), 0 states have call successors, (0), 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 10:23:22,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 106 states, 106 states have (on average 70.0) internal successors, (7420), 106 states have internal predecessors, (7420), 0 states have call successors, (0), 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 10:23:22,035 INFO L81 ComplementDD]: Finished complementDD. Result has 106 states, 106 states have (on average 70.0) internal successors, (7420), 106 states have internal predecessors, (7420), 0 states have call successors, (0), 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 10:23:22,035 INFO L186 Difference]: Start difference. First operand has 419 places, 341 transitions, 8978 flow. Second operand 105 states and 6064 transitions. [2022-01-19 10:23:22,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 582 transitions, 36059 flow [2022-01-19 10:23:23,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 582 transitions, 28444 flow, removed 3703 selfloop flow, removed 43 redundant places. [2022-01-19 10:23:23,273 INFO L242 Difference]: Finished difference. Result has 508 places, 448 transitions, 12107 flow [2022-01-19 10:23:23,273 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=6077, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=280, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=12107, PETRI_PLACES=508, PETRI_TRANSITIONS=448} [2022-01-19 10:23:23,273 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 438 predicate places. [2022-01-19 10:23:23,273 INFO L470 AbstractCegarLoop]: Abstraction has has 508 places, 448 transitions, 12107 flow [2022-01-19 10:23:23,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 56.2) internal successors, (2810), 50 states have internal predecessors, (2810), 0 states have call successors, (0), 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 10:23:23,274 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:23:23,274 INFO L254 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:23:23,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-01-19 10:23:23,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-19 10:23:23,480 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 10:23:23,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:23:23,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1956549026, now seen corresponding path program 8 times [2022-01-19 10:23:23,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:23:23,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268003568] [2022-01-19 10:23:23,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:23:23,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:23:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 10:23:23,512 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 10:23:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 10:23:23,590 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 10:23:23,590 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 10:23:23,591 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 10:23:23,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-01-19 10:23:23,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-01-19 10:23:23,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 10:23:23,595 INFO L732 BasicCegarLoop]: Path program histogram: [8, 2, 2, 2, 1, 1] [2022-01-19 10:23:23,599 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 10:23:23,599 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 10:23:23,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 10:23:23 BasicIcfg [2022-01-19 10:23:23,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 10:23:23,725 INFO L158 Benchmark]: Toolchain (without parser) took 22474.99ms. Allocated memory was 360.7MB in the beginning and 841.0MB in the end (delta: 480.2MB). Free memory was 305.1MB in the beginning and 502.6MB in the end (delta: -197.5MB). Peak memory consumption was 284.4MB. Max. memory is 16.0GB. [2022-01-19 10:23:23,726 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 360.7MB. Free memory is still 323.3MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 10:23:23,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.80ms. Allocated memory was 360.7MB in the beginning and 476.1MB in the end (delta: 115.3MB). Free memory was 304.9MB in the beginning and 441.3MB in the end (delta: -136.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.0GB. [2022-01-19 10:23:23,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.94ms. Allocated memory is still 476.1MB. Free memory was 441.3MB in the beginning and 439.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 10:23:23,726 INFO L158 Benchmark]: Boogie Preprocessor took 29.07ms. Allocated memory is still 476.1MB. Free memory was 439.2MB in the beginning and 438.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 10:23:23,726 INFO L158 Benchmark]: RCFGBuilder took 316.33ms. Allocated memory is still 476.1MB. Free memory was 437.7MB in the beginning and 425.8MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2022-01-19 10:23:23,726 INFO L158 Benchmark]: TraceAbstraction took 21745.18ms. Allocated memory was 476.1MB in the beginning and 841.0MB in the end (delta: 364.9MB). Free memory was 425.6MB in the beginning and 502.6MB in the end (delta: -76.9MB). Peak memory consumption was 290.1MB. Max. memory is 16.0GB. [2022-01-19 10:23:23,727 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.09ms. Allocated memory is still 360.7MB. Free memory is still 323.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 336.80ms. Allocated memory was 360.7MB in the beginning and 476.1MB in the end (delta: 115.3MB). Free memory was 304.9MB in the beginning and 441.3MB in the end (delta: -136.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.94ms. Allocated memory is still 476.1MB. Free memory was 441.3MB in the beginning and 439.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.07ms. Allocated memory is still 476.1MB. Free memory was 439.2MB in the beginning and 438.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 316.33ms. Allocated memory is still 476.1MB. Free memory was 437.7MB in the beginning and 425.8MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * TraceAbstraction took 21745.18ms. Allocated memory was 476.1MB in the beginning and 841.0MB in the end (delta: 364.9MB). Free memory was 425.6MB in the beginning and 502.6MB in the end (delta: -76.9MB). Peak memory consumption was 290.1MB. 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 < 20 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] [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 < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L716] 0 int condI = i >= (2*20 +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, i=7, id1={5:0}, id2={3:0}, 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=0, k=1] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [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 < 20 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=2, k=1] [L704] COND TRUE 2 k < 20 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 < 20 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=2, k=3] [L696] COND TRUE 1 k < 20 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 < 20 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 < 20 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=3, k=4] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=3, k=5] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=5, 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=5] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=5, 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=5] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, 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=5] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, 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=5] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L696] COND TRUE 1 k < 20 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=6, k=5] [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 < 20 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 < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=6] [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 < 20 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] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=7] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [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=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=8, k=9] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [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] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=8, k=10] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=8, k=10] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, 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=10, k=9] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=9] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=10] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=10] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=11] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=12] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=12] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=12] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=13] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=13] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=13, k=15] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=13, k=15] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=15, k=14] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=14] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=14, k=15] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=15] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=15] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=16] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=16] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=16] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=16, k=17] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=17] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=17] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=17, k=18] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=18] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=18] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L719] 0 int condJ = j >= (2*20 +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=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] [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=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] [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=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] - 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: 21.5s, OverallIterations: 16, TraceHistogramMax: 20, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1367 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1367 mSDsluCounter, 243 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 338 mSDsCounter, 1694 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2409 IncrementalHoareTripleChecker+Invalid, 4103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1694 mSolverCounterUnsat, 67 mSDtfsCounter, 2409 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2093 GetRequests, 1422 SyntacticMatches, 3 SemanticMatches, 668 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17860 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12107occurred in iteration=15, InterpolantAutomatonStates: 511, 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.4s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1985 NumberOfCodeBlocks, 1985 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2476 ConstructedInterpolants, 0 QuantifiedInterpolants, 8997 SizeOfPredicates, 101 NumberOfNonLiveVariables, 1744 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 1/4224 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 10:23:23,756 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...