/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-NewStatesSleepPersistentFixedOrder-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 13:52:58,351 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-02-09 13:52:58,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-02-09 13:52:58,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-02-09 13:52:58,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-02-09 13:52:58,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-02-09 13:52:58,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-02-09 13:52:58,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-02-09 13:52:58,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-02-09 13:52:58,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-02-09 13:52:58,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-02-09 13:52:58,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-02-09 13:52:58,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-02-09 13:52:58,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-02-09 13:52:58,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-02-09 13:52:58,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-02-09 13:52:58,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-02-09 13:52:58,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-02-09 13:52:58,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-02-09 13:52:58,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-02-09 13:52:58,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-02-09 13:52:58,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-02-09 13:52:58,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-02-09 13:52:58,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-02-09 13:52:58,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-02-09 13:52:58,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-02-09 13:52:58,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-02-09 13:52:58,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-02-09 13:52:58,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-02-09 13:52:58,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-02-09 13:52:58,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-02-09 13:52:58,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-02-09 13:52:58,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-02-09 13:52:58,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-02-09 13:52:58,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-02-09 13:52:58,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-02-09 13:52:58,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-02-09 13:52:58,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-02-09 13:52:58,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-02-09 13:52:58,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-02-09 13:52:58,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-02-09 13:52:58,450 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-NewStatesSleepPersistentFixedOrder-NoLbe.epf
[2022-02-09 13:52:58,475 INFO L113 SettingsManager]: Loading preferences was successful
[2022-02-09 13:52:58,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-02-09 13:52:58,475 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-02-09 13:52:58,475 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-02-09 13:52:58,476 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-02-09 13:52:58,476 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-02-09 13:52:58,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-02-09 13:52:58,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-02-09 13:52:58,476 INFO L138 SettingsManager]: * Use SBE=true
[2022-02-09 13:52:58,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-02-09 13:52:58,477 INFO L138 SettingsManager]: * sizeof long=4
[2022-02-09 13:52:58,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-02-09 13:52:58,477 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-02-09 13:52:58,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-02-09 13:52:58,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-02-09 13:52:58,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-02-09 13:52:58,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-02-09 13:52:58,478 INFO L138 SettingsManager]: * sizeof long double=12
[2022-02-09 13:52:58,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-02-09 13:52:58,478 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-02-09 13:52:58,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-02-09 13:52:58,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-02-09 13:52:58,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-02-09 13:52:58,478 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-02-09 13:52:58,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-02-09 13:52:58,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-09 13:52:58,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-02-09 13:52:58,479 INFO L138 SettingsManager]: * Construct finite automaton lazily=true
[2022-02-09 13:52:58,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-02-09 13:52:58,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-02-09 13:52:58,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-02-09 13:52:58,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-02-09 13:52:58,480 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2022-02-09 13:52:58,480 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2022-02-09 13:52:58,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-02-09 13:52:58,480 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2022-02-09 13:52:58,480 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2022-02-09 13:52:58,480 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 13:52:58,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-02-09 13:52:58,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-02-09 13:52:58,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-02-09 13:52:58,674 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser...
[2022-02-09 13:52:58,675 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized
[2022-02-09 13:52:58,676 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 13:52:58,676 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl'
[2022-02-09 13:52:58,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-02-09 13:52:58,699 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-02-09 13:52:58,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-02-09 13:52:58,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-02-09 13:52:58,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-02-09 13:52:58,709 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 01:52:58" (1/1) ...
[2022-02-09 13:52:58,714 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 01:52:58" (1/1) ...
[2022-02-09 13:52:58,718 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0
[2022-02-09 13:52:58,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-02-09 13:52:58,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-02-09 13:52:58,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-02-09 13:52:58,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-02-09 13:52:58,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 01:52:58" (1/1) ...
[2022-02-09 13:52:58,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 01:52:58" (1/1) ...
[2022-02-09 13:52:58,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 01:52:58" (1/1) ...
[2022-02-09 13:52:58,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 01:52:58" (1/1) ...
[2022-02-09 13:52:58,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 01:52:58" (1/1) ...
[2022-02-09 13:52:58,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 01:52:58" (1/1) ...
[2022-02-09 13:52:58,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 01:52:58" (1/1) ...
[2022-02-09 13:52:58,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-02-09 13:52:58,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-02-09 13:52:58,731 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-02-09 13:52:58,731 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-02-09 13:52:58,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 01:52:58" (1/1) ...
[2022-02-09 13:52:58,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-09 13:52:58,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-09 13:52:58,750 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 13:52:58,781 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 13:52:58,790 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration
[2022-02-09 13:52:58,791 INFO L130 BoogieDeclarations]: Found specification of procedure Process2
[2022-02-09 13:52:58,791 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2
[2022-02-09 13:52:58,791 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration
[2022-02-09 13:52:58,791 INFO L130 BoogieDeclarations]: Found specification of procedure Process1
[2022-02-09 13:52:58,791 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1
[2022-02-09 13:52:58,791 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration
[2022-02-09 13:52:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-02-09 13:52:58,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-02-09 13:52:58,792 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration
[2022-02-09 13:52:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure Clock
[2022-02-09 13:52:58,792 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock
[2022-02-09 13:52:58,793 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 13:52:58,824 INFO L234 CfgBuilder]: Building ICFG
[2022-02-09 13:52:58,827 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-02-09 13:52:58,931 INFO L275 CfgBuilder]: Performing block encoding
[2022-02-09 13:52:58,936 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-02-09 13:52:58,937 INFO L299 CfgBuilder]: Removed 3 assume(true) statements.
[2022-02-09 13:52:58,938 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 01:52:58 BoogieIcfgContainer
[2022-02-09 13:52:58,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-02-09 13:52:58,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-02-09 13:52:58,939 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-02-09 13:52:58,941 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-02-09 13:52:58,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 01:52:58" (1/2) ...
[2022-02-09 13:52:58,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0fba95 and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 01:52:58, skipping insertion in model container
[2022-02-09 13:52:58,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 01:52:58" (2/2) ...
[2022-02-09 13:52:58,956 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl
[2022-02-09 13:52:58,959 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-02-09 13:52:58,959 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-02-09 13:52:58,960 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2022-02-09 13:52:58,960 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-02-09 13:52:58,975 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,975 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,976 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,976 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,976 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,976 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,977 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,977 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,978 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,978 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,979 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,979 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,979 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,979 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,980 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,980 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,983 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,984 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 13:52:58,984 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2022-02-09 13:52:59,012 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2022-02-09 13:52:59,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-09 13:52:59,028 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 13:52:59,065 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 13:52:59,084 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == Process2Thread1of1ForFork2 ========
[2022-02-09 13:52:59,090 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 13:52:59,090 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-02-09 13:52:59,188 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] ===
[2022-02-09 13:52:59,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 13:52:59,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1011251863, now seen corresponding path program 1 times
[2022-02-09 13:52:59,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 13:52:59,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138123376]
[2022-02-09 13:52:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 13:52:59,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 13:52:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 13:52:59,265 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 13:52:59,266 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 13:52:59,266 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138123376]
[2022-02-09 13:52:59,266 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138123376] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 13:52:59,266 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 13:52:59,266 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-02-09 13:52:59,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970711817]
[2022-02-09 13:52:59,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 13:52:59,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-02-09 13:52:59,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 13:52:59,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-02-09 13:52:59,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-02-09 13:52:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:52:59,290 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-09 13:52:59,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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 13:52:59,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:52:59,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:52:59,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-02-09 13:52:59,414 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] ===
[2022-02-09 13:52:59,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 13:52:59,415 INFO L85 PathProgramCache]: Analyzing trace with hash 998796616, now seen corresponding path program 1 times
[2022-02-09 13:52:59,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 13:52:59,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824055419]
[2022-02-09 13:52:59,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 13:52:59,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 13:52:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 13:52:59,457 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 13:52:59,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 13:52:59,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824055419]
[2022-02-09 13:52:59,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824055419] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 13:52:59,458 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 13:52:59,458 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-02-09 13:52:59,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890960964]
[2022-02-09 13:52:59,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 13:52:59,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-09 13:52:59,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 13:52:59,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-09 13:52:59,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-09 13:52:59,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:52:59,461 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-09 13:52:59,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 13:52:59,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:52:59,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:52:59,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:52:59,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:52:59,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-02-09 13:52:59,661 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] ===
[2022-02-09 13:52:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 13:52:59,663 INFO L85 PathProgramCache]: Analyzing trace with hash 418388995, now seen corresponding path program 1 times
[2022-02-09 13:52:59,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 13:52:59,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900760426]
[2022-02-09 13:52:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 13:52:59,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 13:52:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 13:52:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked.
[2022-02-09 13:52:59,834 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 13:52:59,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900760426]
[2022-02-09 13:52:59,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900760426] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 13:52:59,835 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 13:52:59,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-09 13:52:59,835 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538763678]
[2022-02-09 13:52:59,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 13:52:59,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-09 13:52:59,836 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 13:52:59,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-09 13:52:59,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-09 13:52:59,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:52:59,836 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-09 13:52:59,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 13:52:59,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:52:59,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:52:59,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:52:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:52:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:52:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:52:59,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-02-09 13:52:59,902 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] ===
[2022-02-09 13:52:59,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 13:52:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2014427279, now seen corresponding path program 1 times
[2022-02-09 13:52:59,903 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 13:52:59,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596288925]
[2022-02-09 13:52:59,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 13:52:59,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 13:52:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 13:52:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked.
[2022-02-09 13:52:59,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 13:52:59,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596288925]
[2022-02-09 13:52:59,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596288925] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 13:52:59,948 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 13:52:59,948 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-09 13:52:59,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718148630]
[2022-02-09 13:52:59,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 13:52:59,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-09 13:52:59,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 13:52:59,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-09 13:52:59,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-09 13:52:59,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:52:59,949 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-09 13:52:59,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 13:52:59,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:52:59,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:52:59,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:52:59,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-02-09 13:53:00,050 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] ===
[2022-02-09 13:53:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 13:53:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash 856654322, now seen corresponding path program 2 times
[2022-02-09 13:53:00,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 13:53:00,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474945476]
[2022-02-09 13:53:00,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 13:53:00,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 13:53:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 13:53:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked.
[2022-02-09 13:53:00,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 13:53:00,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474945476]
[2022-02-09 13:53:00,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474945476] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 13:53:00,092 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 13:53:00,092 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-09 13:53:00,092 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254175552]
[2022-02-09 13:53:00,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 13:53:00,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-09 13:53:00,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 13:53:00,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-09 13:53:00,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-09 13:53:00,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,094 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-09 13:53:00,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 13:53:00,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-02-09 13:53:00,139 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] ===
[2022-02-09 13:53:00,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 13:53:00,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1020867905, now seen corresponding path program 2 times
[2022-02-09 13:53:00,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 13:53:00,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217625238]
[2022-02-09 13:53:00,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 13:53:00,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 13:53:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 13:53:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked.
[2022-02-09 13:53:00,171 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 13:53:00,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217625238]
[2022-02-09 13:53:00,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217625238] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 13:53:00,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 13:53:00,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-09 13:53:00,171 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866444041]
[2022-02-09 13:53:00,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 13:53:00,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-09 13:53:00,172 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 13:53:00,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-09 13:53:00,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-09 13:53:00,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,173 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-09 13:53:00,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 13:53:00,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-02-09 13:53:00,202 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] ===
[2022-02-09 13:53:00,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 13:53:00,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1576418719, now seen corresponding path program 3 times
[2022-02-09 13:53:00,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 13:53:00,203 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551283031]
[2022-02-09 13:53:00,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 13:53:00,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 13:53:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 13:53:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2022-02-09 13:53:00,226 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 13:53:00,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551283031]
[2022-02-09 13:53:00,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551283031] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 13:53:00,226 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 13:53:00,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-02-09 13:53:00,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563076450]
[2022-02-09 13:53:00,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 13:53:00,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-02-09 13:53:00,227 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 13:53:00,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-02-09 13:53:00,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-02-09 13:53:00,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,228 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-09 13:53:00,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 13:53:00,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-09 13:53:00,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-02-09 13:53:00,269 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] ===
[2022-02-09 13:53:00,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 13:53:00,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1611589343, now seen corresponding path program 4 times
[2022-02-09 13:53:00,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 13:53:00,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053062578]
[2022-02-09 13:53:00,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 13:53:00,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 13:53:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 13:53:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked.
[2022-02-09 13:53:00,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 13:53:00,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053062578]
[2022-02-09 13:53:00,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053062578] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 13:53:00,312 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 13:53:00,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-02-09 13:53:00,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032497488]
[2022-02-09 13:53:00,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 13:53:00,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-02-09 13:53:00,313 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 13:53:00,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-02-09 13:53:00,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-02-09 13:53:00,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,313 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-09 13:53:00,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 13:53:00,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-09 13:53:00,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-09 13:53:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-09 13:53:00,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-02-09 13:53:00,361 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] ===
[2022-02-09 13:53:00,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 13:53:00,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1126305558, now seen corresponding path program 5 times
[2022-02-09 13:53:00,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 13:53:00,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377588692]
[2022-02-09 13:53:00,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 13:53:00,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 13:53:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 13:53:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2022-02-09 13:53:00,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 13:53:00,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377588692]
[2022-02-09 13:53:00,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377588692] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 13:53:00,377 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 13:53:00,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-09 13:53:00,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214352153]
[2022-02-09 13:53:00,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 13:53:00,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-09 13:53:00,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 13:53:00,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-09 13:53:00,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-09 13:53:00,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,379 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-09 13:53:00,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 13:53:00,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-09 13:53:00,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-09 13:53:00,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-09 13:53:00,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-09 13:53:00,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-02-09 13:53:00,423 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] ===
[2022-02-09 13:53:00,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 13:53:00,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1721986514, now seen corresponding path program 6 times
[2022-02-09 13:53:00,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 13:53:00,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617753370]
[2022-02-09 13:53:00,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 13:53:00,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 13:53:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 13:53:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 101 proven. 26 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2022-02-09 13:53:00,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 13:53:00,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617753370]
[2022-02-09 13:53:00,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617753370] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-09 13:53:00,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737498555]
[2022-02-09 13:53:00,524 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-02-09 13:53:00,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-09 13:53:00,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-09 13:53:00,526 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 13:53:00,560 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 13:53:00,578 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s)
[2022-02-09 13:53:00,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-09 13:53:00,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core
[2022-02-09 13:53:00,585 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-09 13:53:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 22 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2022-02-09 13:53:00,820 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-09 13:53:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 22 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2022-02-09 13:53:00,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737498555] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-09 13:53:00,985 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-09 13:53:00,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13
[2022-02-09 13:53:00,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422987218]
[2022-02-09 13:53:00,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-09 13:53:00,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-02-09 13:53:00,986 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 13:53:00,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-02-09 13:53:00,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156
[2022-02-09 13:53:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,987 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-09 13:53:00,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 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 13:53:00,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:00,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-09 13:53:00,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-09 13:53:00,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:00,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:01,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:01,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:01,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:01,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:01,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:01,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:01,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-09 13:53:01,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-09 13:53:01,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:01,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-09 13:53:01,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-02-09 13:53:01,603 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,SelfDestructingSolverStorable9
[2022-02-09 13:53:01,604 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] ===
[2022-02-09 13:53:01,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 13:53:01,604 INFO L85 PathProgramCache]: Analyzing trace with hash -409759383, now seen corresponding path program 7 times
[2022-02-09 13:53:01,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 13:53:01,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542296583]
[2022-02-09 13:53:01,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 13:53:01,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 13:53:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 13:53:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 100 proven. 107 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2022-02-09 13:53:01,671 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 13:53:01,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542296583]
[2022-02-09 13:53:01,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542296583] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-09 13:53:01,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853933781]
[2022-02-09 13:53:01,671 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2022-02-09 13:53:01,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-09 13:53:01,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-09 13:53:01,673 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-09 13:53:01,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2022-02-09 13:53:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 13:53:01,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 9 conjunts are in the unsatisfiable core
[2022-02-09 13:53:01,728 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-09 13:53:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 100 proven. 107 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2022-02-09 13:53:01,947 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-09 13:53:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 121 proven. 86 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2022-02-09 13:53:02,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853933781] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-09 13:53:02,174 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-09 13:53:02,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15
[2022-02-09 13:53:02,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667937910]
[2022-02-09 13:53:02,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-09 13:53:02,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2022-02-09 13:53:02,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 13:53:02,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2022-02-09 13:53:02,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210
[2022-02-09 13:53:02,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:02,178 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-09 13:53:02,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.133333333333333) internal successors, (137), 15 states have internal predecessors, (137), 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 13:53:02,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:02,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:02,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:02,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:02,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:02,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:02,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-09 13:53:02,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-09 13:53:02,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:02,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-09 13:53:02,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:02,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 13:53:02,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-09 13:53:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-09 13:53:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 13:53:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-09 13:53:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-09 13:53:02,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2022-02-09 13:53:02,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-09 13:53:02,631 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] ===
[2022-02-09 13:53:02,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 13:53:02,632 INFO L85 PathProgramCache]: Analyzing trace with hash 615950837, now seen corresponding path program 8 times
[2022-02-09 13:53:02,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 13:53:02,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349436760]
[2022-02-09 13:53:02,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 13:53:02,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 13:53:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-09 13:53:02,660 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-02-09 13:53:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-09 13:53:02,706 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-02-09 13:53:02,706 INFO L628 BasicCegarLoop]: Counterexample is feasible
[2022-02-09 13:53:02,708 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location Process2Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining)
[2022-02-09 13:53:02,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-02-09 13:53:02,720 INFO L732 BasicCegarLoop]: Path program histogram: [8, 2, 1, 1]
[2022-02-09 13:53:02,721 INFO L309 ceAbstractionStarter]: Result for error location Process2Thread1of1ForFork2 was UNSAFE (1/3)
[2022-02-09 13:53:02,724 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-02-09 13:53:02,724 INFO L180 ceAbstractionStarter]: Computing trace abstraction results
[2022-02-09 13:53:02,774 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.02 01:53:02 BasicIcfg
[2022-02-09 13:53:02,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-02-09 13:53:02,774 INFO L158 Benchmark]: Toolchain (without parser) took 4074.98ms. Allocated memory was 181.4MB in the beginning and 252.7MB in the end (delta: 71.3MB). Free memory was 143.0MB in the beginning and 135.5MB in the end (delta: 7.5MB). Peak memory consumption was 80.4MB. Max. memory is 8.0GB.
[2022-02-09 13:53:02,775 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-02-09 13:53:02,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.82ms. Allocated memory is still 181.4MB. Free memory was 143.0MB in the beginning and 141.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-02-09 13:53:02,775 INFO L158 Benchmark]: Boogie Preprocessor took 10.40ms. Allocated memory is still 181.4MB. Free memory was 141.4MB in the beginning and 140.4MB in the end (delta: 999.1kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-02-09 13:53:02,776 INFO L158 Benchmark]: RCFGBuilder took 207.40ms. Allocated memory is still 181.4MB. Free memory was 140.4MB in the beginning and 131.4MB in the end (delta: 8.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB.
[2022-02-09 13:53:02,776 INFO L158 Benchmark]: TraceAbstraction took 3835.08ms. Allocated memory was 181.4MB in the beginning and 252.7MB in the end (delta: 71.3MB). Free memory was 130.9MB in the beginning and 135.5MB in the end (delta: -4.6MB). Peak memory consumption was 67.8MB. Max. memory is 8.0GB.
[2022-02-09 13:53:02,777 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.11ms. Allocated memory is still 181.4MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 8.0GB.
* Boogie Procedure Inliner took 18.82ms. Allocated memory is still 181.4MB. Free memory was 143.0MB in the beginning and 141.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 10.40ms. Allocated memory is still 181.4MB. Free memory was 141.4MB in the beginning and 140.4MB in the end (delta: 999.1kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 207.40ms. Allocated memory is still 181.4MB. Free memory was 140.4MB in the beginning and 131.4MB in the end (delta: 8.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB.
* TraceAbstraction took 3835.08ms. Allocated memory was 181.4MB in the beginning and 252.7MB in the end (delta: 71.3MB). Free memory was 130.9MB in the beginning and 135.5MB in the end (delta: -4.6MB). Peak memory consumption was 67.8MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: Independence relation benchmarks
ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 23749, positive: 17932, positive conditional: 16817, positive unconditional: 1115, negative: 5817, negative conditional: 5767, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19714, positive: 17932, positive conditional: 16817, positive unconditional: 1115, negative: 1782, negative conditional: 1732, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19714, positive: 17932, positive conditional: 16817, positive unconditional: 1115, negative: 1782, negative conditional: 1732, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26569, positive: 17932, positive conditional: 16527, positive unconditional: 1405, negative: 8637, negative conditional: 6855, negative unconditional: 1782, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26569, positive: 17932, positive conditional: 5733, positive unconditional: 12199, negative: 8637, negative conditional: 1573, negative unconditional: 7064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26569, positive: 17932, positive conditional: 5733, positive unconditional: 12199, negative: 8637, negative conditional: 1573, negative unconditional: 7064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1114, positive: 951, positive conditional: 17, positive unconditional: 934, negative: 163, negative conditional: 113, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1114, positive: 903, positive conditional: 0, positive unconditional: 903, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 211, positive: 48, positive conditional: 17, positive unconditional: 31, negative: 163, negative conditional: 113, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 290, positive: 53, positive conditional: 12, positive unconditional: 41, negative: 237, negative conditional: 107, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26569, positive: 16981, positive conditional: 5716, positive unconditional: 11265, negative: 8474, negative conditional: 1460, negative unconditional: 7014, unknown: 1114, unknown conditional: 130, unknown unconditional: 984] , Statistics on independence cache: Total cache size (in pairs): 1114, Positive cache size: 951, Positive conditional cache size: 17, Positive unconditional cache size: 934, Negative cache size: 163, Negative conditional cache size: 113, Negative unconditional cache size: 50, Eliminated conditions: 16076, Maximal queried relation: 7, Independence queries for same thread: 4035
- StatisticsResult: Persistent set benchmarks
Persistent set computation time: 0.2s, Number of persistent set computation: 232, Number of trivial persistent sets: 102, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1165, positive: 1115, positive conditional: 0, positive unconditional: 1115, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 23749, positive: 17932, positive conditional: 16817, positive unconditional: 1115, negative: 5817, negative conditional: 5767, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19714, positive: 17932, positive conditional: 16817, positive unconditional: 1115, negative: 1782, negative conditional: 1732, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19714, positive: 17932, positive conditional: 16817, positive unconditional: 1115, negative: 1782, negative conditional: 1732, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26569, positive: 17932, positive conditional: 16527, positive unconditional: 1405, negative: 8637, negative conditional: 6855, negative unconditional: 1782, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26569, positive: 17932, positive conditional: 5733, positive unconditional: 12199, negative: 8637, negative conditional: 1573, negative unconditional: 7064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26569, positive: 17932, positive conditional: 5733, positive unconditional: 12199, negative: 8637, negative conditional: 1573, negative unconditional: 7064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1114, positive: 951, positive conditional: 17, positive unconditional: 934, negative: 163, negative conditional: 113, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1114, positive: 903, positive conditional: 0, positive unconditional: 903, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 211, positive: 48, positive conditional: 17, positive unconditional: 31, negative: 163, negative conditional: 113, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 290, positive: 53, positive conditional: 12, positive unconditional: 41, negative: 237, negative conditional: 107, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26569, positive: 16981, positive conditional: 5716, positive unconditional: 11265, negative: 8474, negative conditional: 1460, negative unconditional: 7014, unknown: 1114, unknown conditional: 130, unknown unconditional: 984] , Statistics on independence cache: Total cache size (in pairs): 1114, Positive cache size: 951, Positive conditional cache size: 17, Positive unconditional cache size: 934, Negative cache size: 163, Negative conditional cache size: 113, Negative unconditional cache size: 50, Eliminated conditions: 16076, Maximal queried relation: 7, Independence queries for same thread: 4035
- 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]
[L44] 1 clk := clk + 1;
VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1]
[L63] 2 assume clk >= deadline;
VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1]
[L64] 2 assume lock == 1;
VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1]
[L66] 2 assert critical == 0;
VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1]
[L67] 2 critical := 1;
VAL [clk=1, critical=1, deadline=1, delay=1, lock=1, wait=1]
[L68] 2 critical := 0;
VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1]
[L69] 2 lock := 0;
VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1]
[L57] COND TRUE 2 lock != 1
VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1]
[L58] 2 deadline := clk + delay;
VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1]
[L59] 2 assume lock == 0;
VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1]
[L60] 2 lock := 1;
VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1]
[L61] 2 assume clk <= deadline;
VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1]
[L62] 2 deadline := clk + wait;
VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1]
[L44] 1 clk := clk + 1;
VAL [clk=2, critical=0, deadline=2, delay=1, lock=1, wait=1]
[L44] 1 clk := clk + 1;
VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1]
[L63] 2 assume clk >= deadline;
VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1]
[L64] 2 assume lock == 1;
VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1]
[L66] 2 assert critical == 0;
VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1]
[L67] 2 critical := 1;
VAL [clk=3, critical=1, deadline=2, delay=1, lock=1, wait=1]
[L68] 2 critical := 0;
VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1]
[L69] 2 lock := 0;
VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1]
[L57] COND TRUE 2 lock != 1
VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1]
[L44] 1 clk := clk + 1;
VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1]
[L44] 1 clk := clk + 1;
VAL [clk=5, critical=0, deadline=2, delay=1, lock=0, wait=1]
[L36] FORK 0 fork 2 Process2();
VAL [clk=5, critical=0, deadline=2, delay=1, lock=0, wait=1]
[L78] COND TRUE 3 lock != 2
VAL [clk=5, critical=0, deadline=2, delay=1, lock=0, wait=1]
[L79] 3 deadline := clk + delay;
VAL [clk=5, critical=0, deadline=6, deadline=2, delay=1, lock=0, wait=1]
[L80] 3 assume lock == 0;
VAL [clk=5, critical=0, deadline=6, deadline=2, delay=1, lock=0, wait=1]
[L81] 3 lock := 2;
VAL [clk=5, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1]
[L82] 3 assume clk <= deadline;
VAL [clk=5, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1]
[L83] 3 deadline := clk + wait;
VAL [clk=5, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1]
[L44] 1 clk := clk + 1;
VAL [clk=6, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1]
[L84] 3 assume clk >= deadline;
VAL [clk=6, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1]
[L85] 3 assume lock == 2;
VAL [clk=6, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1]
[L87] 3 assert critical == 0;
VAL [clk=6, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1]
[L88] 3 critical := 2;
VAL [clk=6, critical=2, deadline=6, deadline=2, delay=1, lock=2, wait=1]
[L89] 3 critical := 0;
VAL [clk=6, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1]
[L90] 3 lock := 0;
VAL [clk=6, critical=0, deadline=6, deadline=2, delay=1, lock=0, wait=1]
[L78] COND TRUE 3 lock != 2
VAL [clk=6, critical=0, deadline=6, deadline=2, delay=1, lock=0, wait=1]
[L79] 3 deadline := clk + delay;
VAL [clk=6, critical=0, deadline=7, deadline=2, delay=1, lock=0, wait=1]
[L80] 3 assume lock == 0;
VAL [clk=6, critical=0, deadline=7, deadline=2, delay=1, lock=0, wait=1]
[L81] 3 lock := 2;
VAL [clk=6, critical=0, deadline=7, deadline=2, delay=1, lock=2, wait=1]
[L82] 3 assume clk <= deadline;
VAL [clk=6, critical=0, deadline=7, deadline=2, delay=1, lock=2, wait=1]
[L83] 3 deadline := clk + wait;
VAL [clk=6, critical=0, deadline=7, deadline=2, delay=1, lock=2, wait=1]
[L58] 2 deadline := clk + delay;
VAL [clk=6, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1]
[L44] 1 clk := clk + 1;
VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1]
[L84] 3 assume clk >= deadline;
VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1]
[L85] 3 assume lock == 2;
VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1]
[L87] 3 assert critical == 0;
VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1]
[L88] 3 critical := 2;
VAL [clk=7, critical=2, deadline=7, deadline=7, delay=1, lock=2, wait=1]
[L89] 3 critical := 0;
VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1]
[L90] 3 lock := 0;
VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=0, wait=1]
[L78] COND TRUE 3 lock != 2
VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=0, wait=1]
[L79] 3 deadline := clk + delay;
VAL [clk=7, critical=0, deadline=8, deadline=7, delay=1, lock=0, wait=1]
[L80] 3 assume lock == 0;
VAL [clk=7, critical=0, deadline=8, deadline=7, delay=1, lock=0, wait=1]
[L59] 2 assume lock == 0;
VAL [clk=7, critical=0, deadline=8, deadline=7, delay=1, lock=0, wait=1]
[L60] 2 lock := 1;
VAL [clk=7, critical=0, deadline=8, deadline=7, delay=1, lock=1, wait=1]
[L61] 2 assume clk <= deadline;
VAL [clk=7, critical=0, deadline=8, deadline=7, delay=1, lock=1, wait=1]
[L62] 2 deadline := clk + wait;
VAL [clk=7, critical=0, deadline=8, deadline=8, delay=1, lock=1, wait=1]
[L44] 1 clk := clk + 1;
VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=1, wait=1]
[L63] 2 assume clk >= deadline;
VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=1, wait=1]
[L64] 2 assume lock == 1;
VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=1, wait=1]
[L81] 3 lock := 2;
VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=2, wait=1]
[L82] 3 assume clk <= deadline;
VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=2, wait=1]
[L83] 3 deadline := clk + wait;
VAL [clk=8, critical=0, deadline=9, deadline=8, delay=1, lock=2, wait=1]
[L66] 2 assert critical == 0;
VAL [clk=8, critical=0, deadline=9, deadline=8, delay=1, lock=2, wait=1]
[L67] 2 critical := 1;
VAL [clk=8, critical=1, deadline=9, deadline=8, delay=1, lock=2, wait=1]
[L68] 2 critical := 0;
VAL [clk=8, critical=0, deadline=9, deadline=8, delay=1, lock=2, wait=1]
[L44] 1 clk := clk + 1;
VAL [clk=9, critical=0, deadline=9, deadline=8, delay=1, lock=2, wait=1]
[L84] 3 assume clk >= deadline;
VAL [clk=9, critical=0, deadline=9, deadline=8, delay=1, lock=2, wait=1]
[L85] 3 assume lock == 2;
VAL [clk=9, critical=0, deadline=9, deadline=8, delay=1, lock=2, wait=1]
[L87] 3 assert critical == 0;
VAL [clk=9, critical=0, deadline=9, deadline=8, delay=1, lock=2, wait=1]
[L88] 3 critical := 2;
VAL [clk=9, critical=2, deadline=9, deadline=8, delay=1, lock=2, wait=1]
[L89] 3 critical := 0;
VAL [clk=9, critical=0, deadline=9, deadline=8, delay=1, lock=2, wait=1]
[L90] 3 lock := 0;
VAL [clk=9, critical=0, deadline=9, deadline=8, delay=1, lock=0, wait=1]
[L78] COND TRUE 3 lock != 2
VAL [clk=9, critical=0, deadline=9, deadline=8, delay=1, lock=0, wait=1]
[L79] 3 deadline := clk + delay;
VAL [clk=9, critical=0, deadline=10, deadline=8, delay=1, lock=0, wait=1]
[L80] 3 assume lock == 0;
VAL [clk=9, critical=0, deadline=10, deadline=8, delay=1, lock=0, wait=1]
[L81] 3 lock := 2;
VAL [clk=9, critical=0, deadline=10, deadline=8, delay=1, lock=2, wait=1]
[L82] 3 assume clk <= deadline;
VAL [clk=9, critical=0, deadline=10, deadline=8, delay=1, lock=2, wait=1]
[L83] 3 deadline := clk + wait;
VAL [clk=9, critical=0, deadline=10, deadline=8, delay=1, lock=2, wait=1]
[L44] 1 clk := clk + 1;
VAL [clk=10, critical=0, deadline=10, deadline=8, delay=1, lock=2, wait=1]
[L84] 3 assume clk >= deadline;
VAL [clk=10, critical=0, deadline=10, deadline=8, delay=1, lock=2, wait=1]
[L85] 3 assume lock == 2;
VAL [clk=10, critical=0, deadline=10, deadline=8, delay=1, lock=2, wait=1]
[L87] 3 assert critical == 0;
VAL [clk=10, critical=0, deadline=10, deadline=8, delay=1, lock=2, wait=1]
[L88] 3 critical := 2;
VAL [clk=10, critical=2, deadline=10, deadline=8, delay=1, lock=2, wait=1]
[L89] 3 critical := 0;
VAL [clk=10, critical=0, deadline=10, deadline=8, delay=1, lock=2, wait=1]
[L90] 3 lock := 0;
VAL [clk=10, critical=0, deadline=10, deadline=8, delay=1, lock=0, wait=1]
[L78] COND TRUE 3 lock != 2
VAL [clk=10, critical=0, deadline=10, deadline=8, delay=1, lock=0, wait=1]
[L79] 3 deadline := clk + delay;
VAL [clk=10, critical=0, deadline=11, deadline=8, delay=1, lock=0, wait=1]
[L80] 3 assume lock == 0;
VAL [clk=10, critical=0, deadline=11, deadline=8, delay=1, lock=0, wait=1]
[L69] 2 lock := 0;
VAL [clk=10, critical=0, deadline=11, deadline=8, delay=1, lock=0, wait=1]
[L57] COND TRUE 2 lock != 1
VAL [clk=10, critical=0, deadline=11, deadline=8, delay=1, lock=0, wait=1]
[L58] 2 deadline := clk + delay;
VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=0, wait=1]
[L59] 2 assume lock == 0;
VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=0, wait=1]
[L81] 3 lock := 2;
VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1]
[L82] 3 assume clk <= deadline;
VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1]
[L83] 3 deadline := clk + wait;
VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1]
[L44] 1 clk := clk + 1;
VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1]
[L84] 3 assume clk >= deadline;
VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1]
[L85] 3 assume lock == 2;
VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1]
[L87] 3 assert critical == 0;
VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1]
[L88] 3 critical := 2;
VAL [clk=11, critical=2, deadline=11, deadline=11, delay=1, lock=2, wait=1]
[L89] 3 critical := 0;
VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1]
[L60] 2 lock := 1;
VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=1, wait=1]
[L61] 2 assume clk <= deadline;
VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=1, wait=1]
[L62] 2 deadline := clk + wait;
VAL [clk=11, critical=0, deadline=11, deadline=12, delay=1, lock=1, wait=1]
[L44] 1 clk := clk + 1;
VAL [clk=12, critical=0, deadline=11, deadline=12, delay=1, lock=1, wait=1]
[L63] 2 assume clk >= deadline;
VAL [clk=12, critical=0, deadline=11, deadline=12, delay=1, lock=1, wait=1]
[L64] 2 assume lock == 1;
VAL [clk=12, critical=0, deadline=11, deadline=12, delay=1, lock=1, wait=1]
[L90] 3 lock := 0;
VAL [clk=12, critical=0, deadline=11, deadline=12, delay=1, lock=0, wait=1]
[L78] COND TRUE 3 lock != 2
VAL [clk=12, critical=0, deadline=11, deadline=12, delay=1, lock=0, wait=1]
[L79] 3 deadline := clk + delay;
VAL [clk=12, critical=0, deadline=13, deadline=12, delay=1, lock=0, wait=1]
[L80] 3 assume lock == 0;
VAL [clk=12, critical=0, deadline=13, deadline=12, delay=1, lock=0, wait=1]
[L81] 3 lock := 2;
VAL [clk=12, critical=0, deadline=13, deadline=12, delay=1, lock=2, wait=1]
[L82] 3 assume clk <= deadline;
VAL [clk=12, critical=0, deadline=13, deadline=12, delay=1, lock=2, wait=1]
[L66] 2 assert critical == 0;
VAL [clk=12, critical=0, deadline=13, deadline=12, delay=1, lock=2, wait=1]
[L67] 2 critical := 1;
VAL [clk=12, critical=1, deadline=13, deadline=12, delay=1, lock=2, wait=1]
[L44] 1 clk := clk + 1;
VAL [clk=13, critical=1, deadline=13, deadline=12, delay=1, lock=2, wait=1]
[L83] 3 deadline := clk + wait;
VAL [clk=13, critical=1, deadline=14, deadline=12, delay=1, lock=2, wait=1]
[L44] 1 clk := clk + 1;
VAL [clk=14, critical=1, deadline=14, deadline=12, delay=1, lock=2, wait=1]
[L84] 3 assume clk >= deadline;
VAL [clk=14, critical=1, deadline=14, deadline=12, delay=1, lock=2, wait=1]
[L85] 3 assume lock == 2;
VAL [clk=14, critical=1, deadline=14, deadline=12, delay=1, lock=2, wait=1]
[L87] 3 assert critical == 0;
VAL [clk=14, critical=1, deadline=14, deadline=12, delay=1, lock=2, wait=1]
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process2Thread1of1ForFork2 with 1 thread instances
CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 1.4s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1662 NumberOfCodeBlocks, 1662 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1753 ConstructedInterpolants, 0 QuantifiedInterpolants, 3410 SizeOfPredicates, 11 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 3595/3965 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 13:53:02,810 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 13:53:03,017 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...