/usr/bin/java -Xmx8000000000 -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-POR-NewStatesSleep-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-09 08:20:18,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-09 08:20:18,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-09 08:20:18,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-09 08:20:18,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-09 08:20:18,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-09 08:20:18,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-09 08:20:18,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-09 08:20:18,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-09 08:20:18,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-09 08:20:18,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-09 08:20:18,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-09 08:20:18,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-09 08:20:18,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-09 08:20:18,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-09 08:20:18,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-09 08:20:18,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-09 08:20:18,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-09 08:20:18,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-09 08:20:18,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-09 08:20:18,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-09 08:20:18,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-09 08:20:18,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-09 08:20:18,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-09 08:20:18,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-09 08:20:18,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-09 08:20:18,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-09 08:20:18,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-09 08:20:18,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-09 08:20:18,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-09 08:20:18,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-09 08:20:18,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-09 08:20:18,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-09 08:20:18,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-09 08:20:18,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-09 08:20:18,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-09 08:20:18,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-09 08:20:18,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-09 08:20:18,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-09 08:20:18,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-09 08:20:18,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-09 08:20:18,491 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-POR-NewStatesSleep-NoLbe.epf [2022-02-09 08:20:18,516 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-09 08:20:18,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-09 08:20:18,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-09 08:20:18,517 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-09 08:20:18,517 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-09 08:20:18,517 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-09 08:20:18,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-09 08:20:18,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-09 08:20:18,518 INFO L138 SettingsManager]: * Use SBE=true [2022-02-09 08:20:18,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-09 08:20:18,518 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-09 08:20:18,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-09 08:20:18,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-09 08:20:18,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-09 08:20:18,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-09 08:20:18,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-09 08:20:18,518 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-09 08:20:18,518 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-09 08:20:18,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-09 08:20:18,519 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-09 08:20:18,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-09 08:20:18,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-09 08:20:18,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-09 08:20:18,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-09 08:20:18,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-09 08:20:18,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 08:20:18,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-09 08:20:18,521 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-02-09 08:20:18,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-09 08:20:18,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-09 08:20:18,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-09 08:20:18,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-09 08:20:18,522 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-09 08:20:18,522 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-09 08:20:18,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-09 08:20:18,522 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-02-09 08:20:18,523 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-02-09 08:20:18,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-09 08:20:18,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-09 08:20:18,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-09 08:20:18,752 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-02-09 08:20:18,754 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-02-09 08:20:18,755 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl [2022-02-09 08:20:18,755 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2022-02-09 08:20:18,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-09 08:20:18,773 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-09 08:20:18,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-09 08:20:18,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-09 08:20:18,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-09 08:20:18,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 08:20:18" (1/1) ... [2022-02-09 08:20:18,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 08:20:18" (1/1) ... [2022-02-09 08:20:18,795 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-02-09 08:20:18,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-09 08:20:18,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-09 08:20:18,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-09 08:20:18,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-09 08:20:18,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 08:20:18" (1/1) ... [2022-02-09 08:20:18,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 08:20:18" (1/1) ... [2022-02-09 08:20:18,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 08:20:18" (1/1) ... [2022-02-09 08:20:18,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 08:20:18" (1/1) ... [2022-02-09 08:20:18,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 08:20:18" (1/1) ... [2022-02-09 08:20:18,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 08:20:18" (1/1) ... [2022-02-09 08:20:18,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 08:20:18" (1/1) ... [2022-02-09 08:20:18,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-09 08:20:18,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-09 08:20:18,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-09 08:20:18,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-09 08:20:18,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 08:20:18" (1/1) ... [2022-02-09 08:20:18,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 08:20:18,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 08:20:18,836 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-02-09 08:20:18,842 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-02-09 08:20:18,863 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2022-02-09 08:20:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2022-02-09 08:20:18,863 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2022-02-09 08:20:18,863 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2022-02-09 08:20:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2022-02-09 08:20:18,863 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2022-02-09 08:20:18,863 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-02-09 08:20:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-09 08:20:18,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-09 08:20:18,864 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2022-02-09 08:20:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2022-02-09 08:20:18,864 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2022-02-09 08:20:18,865 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-09 08:20:18,900 INFO L234 CfgBuilder]: Building ICFG [2022-02-09 08:20:18,901 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-09 08:20:19,041 INFO L275 CfgBuilder]: Performing block encoding [2022-02-09 08:20:19,046 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-09 08:20:19,046 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-09 08:20:19,047 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 08:20:19 BoogieIcfgContainer [2022-02-09 08:20:19,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-09 08:20:19,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-09 08:20:19,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-09 08:20:19,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-09 08:20:19,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 08:20:18" (1/2) ... [2022-02-09 08:20:19,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124e61e3 and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 08:20:19, skipping insertion in model container [2022-02-09 08:20:19,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 08:20:19" (2/2) ... [2022-02-09 08:20:19,053 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2022-02-09 08:20:19,056 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-09 08:20:19,056 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-09 08:20:19,056 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-09 08:20:19,056 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-09 08:20:19,072 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,073 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,073 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,074 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,074 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,074 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,074 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,074 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,075 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,075 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,076 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,076 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,077 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,077 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,077 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,077 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,081 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,082 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 08:20:19,082 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-09 08:20:19,126 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-09 08:20:19,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 08:20:19,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-09 08:20:19,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-02-09 08:20:19,178 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-09 08:20:19,189 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=true, 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-02-09 08:20:19,190 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-09 08:20:19,272 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION (and 3 more)] === [2022-02-09 08:20:19,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 08:20:19,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1615810858, now seen corresponding path program 1 times [2022-02-09 08:20:19,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 08:20:19,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545565170] [2022-02-09 08:20:19,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 08:20:19,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 08:20:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 08:20:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 08:20:19,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 08:20:19,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545565170] [2022-02-09 08:20:19,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545565170] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 08:20:19,359 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 08:20:19,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 08:20:19,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306480397] [2022-02-09 08:20:19,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 08:20:19,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-09 08:20:19,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 08:20:19,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-09 08:20:19,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-09 08:20:19,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,384 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 08:20:19,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-02-09 08:20:19,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-09 08:20:19,407 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting Process1Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION (and 3 more)] === [2022-02-09 08:20:19,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 08:20:19,407 INFO L85 PathProgramCache]: Analyzing trace with hash -716527660, now seen corresponding path program 1 times [2022-02-09 08:20:19,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 08:20:19,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050886819] [2022-02-09 08:20:19,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 08:20:19,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 08:20:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 08:20:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 08:20:19,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 08:20:19,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050886819] [2022-02-09 08:20:19,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050886819] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 08:20:19,439 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 08:20:19,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-09 08:20:19,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264118311] [2022-02-09 08:20:19,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 08:20:19,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 08:20:19,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 08:20:19,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 08:20:19,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 08:20:19,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,441 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 08:20:19,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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-02-09 08:20:19,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:19,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-09 08:20:19,580 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting Process1Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION (and 3 more)] === [2022-02-09 08:20:19,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 08:20:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash 566296084, now seen corresponding path program 1 times [2022-02-09 08:20:19,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 08:20:19,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875190501] [2022-02-09 08:20:19,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 08:20:19,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 08:20:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 08:20:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-02-09 08:20:19,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 08:20:19,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875190501] [2022-02-09 08:20:19,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875190501] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 08:20:19,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 08:20:19,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-09 08:20:19,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455745127] [2022-02-09 08:20:19,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 08:20:19,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 08:20:19,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 08:20:19,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 08:20:19,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 08:20:19,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,677 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 08:20:19,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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-02-09 08:20:19,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:19,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:19,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:19,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-09 08:20:19,734 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION (and 3 more)] === [2022-02-09 08:20:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 08:20:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1553362379, now seen corresponding path program 1 times [2022-02-09 08:20:19,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 08:20:19,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837340506] [2022-02-09 08:20:19,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 08:20:19,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 08:20:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 08:20:19,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 08:20:19,764 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 08:20:19,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837340506] [2022-02-09 08:20:19,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837340506] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 08:20:19,764 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 08:20:19,764 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-09 08:20:19,764 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796255041] [2022-02-09 08:20:19,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 08:20:19,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 08:20:19,765 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 08:20:19,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 08:20:19,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 08:20:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,765 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 08:20:19,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-02-09 08:20:19,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:19,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:19,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:19,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:19,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:19,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-09 08:20:19,869 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting Process1Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION (and 3 more)] === [2022-02-09 08:20:19,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 08:20:19,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1235557862, now seen corresponding path program 1 times [2022-02-09 08:20:19,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 08:20:19,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830702782] [2022-02-09 08:20:19,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 08:20:19,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 08:20:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 08:20:19,921 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-02-09 08:20:19,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 08:20:19,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830702782] [2022-02-09 08:20:19,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830702782] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 08:20:19,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 08:20:19,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-09 08:20:19,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561889318] [2022-02-09 08:20:19,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 08:20:19,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 08:20:19,923 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 08:20:19,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 08:20:19,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 08:20:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,923 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 08:20:19,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-02-09 08:20:19,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:19,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:19,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:19,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:19,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-09 08:20:19,998 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting Process1Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION (and 3 more)] === [2022-02-09 08:20:19,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 08:20:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1333871469, now seen corresponding path program 1 times [2022-02-09 08:20:19,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 08:20:20,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646847725] [2022-02-09 08:20:20,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 08:20:20,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 08:20:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 08:20:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-02-09 08:20:20,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 08:20:20,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646847725] [2022-02-09 08:20:20,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646847725] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 08:20:20,058 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 08:20:20,058 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-09 08:20:20,058 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844431375] [2022-02-09 08:20:20,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 08:20:20,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 08:20:20,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 08:20:20,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 08:20:20,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 08:20:20,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:20,059 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 08:20:20,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-02-09 08:20:20,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:20,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:20,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:20,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-09 08:20:20,131 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting Process1Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION (and 3 more)] === [2022-02-09 08:20:20,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 08:20:20,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1589836769, now seen corresponding path program 1 times [2022-02-09 08:20:20,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 08:20:20,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70645264] [2022-02-09 08:20:20,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 08:20:20,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 08:20:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 08:20:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-02-09 08:20:20,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 08:20:20,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70645264] [2022-02-09 08:20:20,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70645264] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 08:20:20,159 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 08:20:20,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-09 08:20:20,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908794437] [2022-02-09 08:20:20,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 08:20:20,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-09 08:20:20,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 08:20:20,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-09 08:20:20,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-09 08:20:20,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:20,160 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 08:20:20,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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-02-09 08:20:20,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:20,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:20,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 08:20:20,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-09 08:20:20,210 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting Process1Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION (and 3 more)] === [2022-02-09 08:20:20,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 08:20:20,213 INFO L85 PathProgramCache]: Analyzing trace with hash 368906180, now seen corresponding path program 2 times [2022-02-09 08:20:20,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 08:20:20,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828115144] [2022-02-09 08:20:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 08:20:20,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 08:20:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 08:20:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-09 08:20:20,262 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 08:20:20,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828115144] [2022-02-09 08:20:20,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828115144] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 08:20:20,262 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 08:20:20,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-09 08:20:20,262 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627726197] [2022-02-09 08:20:20,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 08:20:20,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-09 08:20:20,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 08:20:20,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-09 08:20:20,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-09 08:20:20,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:20,263 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 08:20:20,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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-02-09 08:20:20,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:20,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 08:20:20,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:20,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:20,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 08:20:20,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 08:20:20,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-09 08:20:20,355 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting Process1Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION (and 3 more)] === [2022-02-09 08:20:20,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 08:20:20,356 INFO L85 PathProgramCache]: Analyzing trace with hash -893544405, now seen corresponding path program 3 times [2022-02-09 08:20:20,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 08:20:20,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966692535] [2022-02-09 08:20:20,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 08:20:20,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 08:20:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 08:20:20,440 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 51 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-09 08:20:20,441 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 08:20:20,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966692535] [2022-02-09 08:20:20,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966692535] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 08:20:20,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474446326] [2022-02-09 08:20:20,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 08:20:20,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 08:20:20,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 08:20:20,444 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-02-09 08:20:20,445 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-02-09 08:20:20,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-09 08:20:20,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 08:20:20,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-09 08:20:20,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 08:20:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 51 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-09 08:20:20,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 08:20:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 51 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-09 08:20:20,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474446326] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 08:20:20,905 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 08:20:20,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 11 [2022-02-09 08:20:20,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270665508] [2022-02-09 08:20:20,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 08:20:20,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 08:20:20,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 08:20:20,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 08:20:20,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-02-09 08:20:20,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:20,919 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 08:20:20,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 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-02-09 08:20:20,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:20,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:20,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 08:20:20,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 08:20:20,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 08:20:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 08:20:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 08:20:21,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 08:20:21,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 08:20:21,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-09 08:20:21,591 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,SelfDestructingSolverStorable8 [2022-02-09 08:20:21,592 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION (and 3 more)] === [2022-02-09 08:20:21,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 08:20:21,592 INFO L85 PathProgramCache]: Analyzing trace with hash 651136800, now seen corresponding path program 1 times [2022-02-09 08:20:21,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 08:20:21,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547763874] [2022-02-09 08:20:21,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 08:20:21,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 08:20:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-09 08:20:21,604 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-09 08:20:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-09 08:20:21,632 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-09 08:20:21,632 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-09 08:20:21,635 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location Process2Err0ASSERT_VIOLATIONASSERT (6 of 7 remaining) [2022-02-09 08:20:21,636 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location Process2Err0ASSERT_VIOLATIONASSERT (5 of 7 remaining) [2022-02-09 08:20:21,637 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location Process1Err0ASSERT_VIOLATIONASSERT (4 of 7 remaining) [2022-02-09 08:20:21,637 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 7 remaining) [2022-02-09 08:20:21,637 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 7 remaining) [2022-02-09 08:20:21,637 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 7 remaining) [2022-02-09 08:20:21,638 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location Process1Err0ASSERT_VIOLATIONASSERT (0 of 7 remaining) [2022-02-09 08:20:21,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-09 08:20:21,649 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 08:20:21,661 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-09 08:20:21,661 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-09 08:20:21,696 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.02 08:20:21 BasicIcfg [2022-02-09 08:20:21,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-09 08:20:21,697 INFO L158 Benchmark]: Toolchain (without parser) took 2924.26ms. Allocated memory was 177.2MB in the beginning and 222.3MB in the end (delta: 45.1MB). Free memory was 136.9MB in the beginning and 130.0MB in the end (delta: 6.9MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. [2022-02-09 08:20:21,697 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 177.2MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-09 08:20:21,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.85ms. Allocated memory is still 177.2MB. Free memory was 136.8MB in the beginning and 135.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-09 08:20:21,698 INFO L158 Benchmark]: Boogie Preprocessor took 11.55ms. Allocated memory is still 177.2MB. Free memory was 135.2MB in the beginning and 134.3MB in the end (delta: 954.1kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-09 08:20:21,698 INFO L158 Benchmark]: RCFGBuilder took 238.89ms. Allocated memory is still 177.2MB. Free memory was 134.2MB in the beginning and 125.1MB in the end (delta: 9.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-02-09 08:20:21,698 INFO L158 Benchmark]: TraceAbstraction took 2647.80ms. Allocated memory was 177.2MB in the beginning and 222.3MB in the end (delta: 45.1MB). Free memory was 124.7MB in the beginning and 130.0MB in the end (delta: -5.3MB). Peak memory consumption was 39.9MB. Max. memory is 8.0GB. [2022-02-09 08:20:21,699 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.09ms. Allocated memory is still 177.2MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.85ms. Allocated memory is still 177.2MB. Free memory was 136.8MB in the beginning and 135.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.55ms. Allocated memory is still 177.2MB. Free memory was 135.2MB in the beginning and 134.3MB in the end (delta: 954.1kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 238.89ms. Allocated memory is still 177.2MB. Free memory was 134.2MB in the beginning and 125.1MB in the end (delta: 9.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 2647.80ms. Allocated memory was 177.2MB in the beginning and 222.3MB in the end (delta: 45.1MB). Free memory was 124.7MB in the beginning and 130.0MB in the end (delta: -5.3MB). Peak memory consumption was 39.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13411, positive: 9895, positive conditional: 9895, positive unconditional: 0, negative: 3516, negative conditional: 3516, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10924, positive: 9895, positive conditional: 9895, positive unconditional: 0, negative: 1029, negative conditional: 1029, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10924, positive: 9895, positive conditional: 9895, positive unconditional: 0, negative: 1029, negative conditional: 1029, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14799, positive: 9895, positive conditional: 9710, positive unconditional: 185, negative: 4904, negative conditional: 3875, negative unconditional: 1029, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14799, positive: 9895, positive conditional: 3533, positive unconditional: 6362, negative: 4904, negative conditional: 689, negative unconditional: 4215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14799, positive: 9895, positive conditional: 3533, positive unconditional: 6362, negative: 4904, negative conditional: 689, negative unconditional: 4215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 709, positive: 605, positive conditional: 239, positive unconditional: 366, negative: 104, negative conditional: 76, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 709, positive: 563, positive conditional: 0, positive unconditional: 563, negative: 146, negative conditional: 0, negative unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 146, positive: 42, positive conditional: 23, positive unconditional: 19, negative: 104, negative conditional: 76, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 266, positive: 59, positive conditional: 31, positive unconditional: 28, negative: 207, negative conditional: 151, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14799, positive: 9290, positive conditional: 3294, positive unconditional: 5996, negative: 4800, negative conditional: 613, negative unconditional: 4187, unknown: 709, unknown conditional: 315, unknown unconditional: 394] , Statistics on independence cache: Total cache size (in pairs): 709, Positive cache size: 605, Positive conditional cache size: 239, Positive unconditional cache size: 366, Negative cache size: 104, Negative conditional cache size: 76, Negative unconditional cache size: 28, Eliminated conditions: 9363, Maximal queried relation: 6, Independence queries for same thread: 2487 - 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: 87]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; VAL [critical=0] [L29] 0 clk := 0; VAL [clk=0, critical=0] [L30] 0 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=1, critical=1, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=1, critical=0, deadline=1, deadline=2, delay=1, lock=2, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=1, critical=0, deadline=1, deadline=2, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=1, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=2, critical=2, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=2, critical=0, deadline=3, deadline=3, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=3, critical=0, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=3, critical=0, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=3, critical=1, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=3, critical=0, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=0, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=4, critical=0, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=4, critical=0, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=4, critical=0, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=4, critical=2, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=4, critical=0, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=4, critical=0, deadline=3, deadline=4, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=4, critical=0, deadline=3, deadline=4, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=4, critical=0, deadline=3, deadline=5, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=4, critical=0, deadline=3, deadline=5, delay=1, lock=0, wait=1] [L69] 2 lock := 0; VAL [clk=4, critical=0, deadline=3, deadline=5, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=4, critical=0, deadline=3, deadline=5, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=4, critical=0, deadline=3, deadline=5, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=4, critical=0, deadline=3, deadline=5, delay=1, lock=2, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=4, critical=0, deadline=3, deadline=5, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=0, deadline=3, deadline=5, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=5, critical=0, deadline=3, deadline=5, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=5, critical=0, deadline=3, deadline=5, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=5, critical=0, deadline=3, deadline=5, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=5, critical=2, deadline=3, deadline=5, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=5, critical=0, deadline=3, deadline=5, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=5, critical=0, deadline=3, deadline=5, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=5, critical=0, deadline=3, deadline=5, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=5, critical=0, deadline=3, deadline=6, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=5, critical=0, deadline=3, deadline=6, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=6, critical=2, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=6, critical=0, deadline=7, deadline=6, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=7, critical=0, deadline=7, deadline=6, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=7, critical=0, deadline=7, deadline=6, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=7, critical=0, deadline=7, deadline=6, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=7, critical=0, deadline=7, deadline=6, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=7, critical=0, deadline=7, deadline=6, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=7, critical=1, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=1, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=8, critical=1, deadline=7, deadline=9, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=9, critical=1, deadline=7, deadline=9, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=9, critical=1, deadline=7, deadline=9, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=9, critical=1, deadline=7, deadline=9, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=9, critical=1, deadline=7, deadline=9, delay=1, lock=2, wait=1] - UnprovableResult [Line: 66]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 34]: 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: 35]: 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: 34]: 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 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 1.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 787 NumberOfCodeBlocks, 787 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 749 ConstructedInterpolants, 0 QuantifiedInterpolants, 1513 SizeOfPredicates, 5 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 737/790 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-02-09 08:20:21,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-02-09 08:20:21,944 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...