./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 803cd42f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m
[2024-11-22 02:18:41,420 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-22 02:18:41,507 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-22 02:18:41,511 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-22 02:18:41,511 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-22 02:18:41,531 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-22 02:18:41,532 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-22 02:18:41,532 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-22 02:18:41,533 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-22 02:18:41,533 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-22 02:18:41,534 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-22 02:18:41,534 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-22 02:18:41,535 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-22 02:18:41,535 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-22 02:18:41,535 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-22 02:18:41,536 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-22 02:18:41,536 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-22 02:18:41,536 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-22 02:18:41,537 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-22 02:18:41,537 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-22 02:18:41,537 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-22 02:18:41,538 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-22 02:18:41,539 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-22 02:18:41,539 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-22 02:18:41,539 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-22 02:18:41,539 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-22 02:18:41,540 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-22 02:18:41,540 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-22 02:18:41,540 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-22 02:18:41,540 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-22 02:18:41,541 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-22 02:18:41,541 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-22 02:18:41,545 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-22 02:18:41,545 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-22 02:18:41,545 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-22 02:18:41,546 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-22 02:18:41,546 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-22 02:18:41,546 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-22 02:18:41,546 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-22 02:18:41,547 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-22 02:18:41,547 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-22 02:18:41,547 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-22 02:18:41,547 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
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
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113
[2024-11-22 02:18:41,788 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-22 02:18:41,811 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-22 02:18:41,820 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-22 02:18:41,821 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-22 02:18:41,821 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-22 02:18:41,826 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c
[2024-11-22 02:18:43,583 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-22 02:18:43,932 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-22 02:18:43,933 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c
[2024-11-22 02:18:43,958 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/134d6529f/45a4a27ec7fc4e06bc267f8526713dcf/FLAGbdcd29176
[2024-11-22 02:18:44,001 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/134d6529f/45a4a27ec7fc4e06bc267f8526713dcf
[2024-11-22 02:18:44,004 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-22 02:18:44,005 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-22 02:18:44,012 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-22 02:18:44,012 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-22 02:18:44,025 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-22 02:18:44,027 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:18:44" (1/1) ...
[2024-11-22 02:18:44,029 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6287f3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:44, skipping insertion in model container
[2024-11-22 02:18:44,032 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:18:44" (1/1) ...
[2024-11-22 02:18:44,104 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-22 02:18:44,419 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653]
[2024-11-22 02:18:44,503 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-22 02:18:44,517 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-22 02:18:44,564 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653]
[2024-11-22 02:18:44,627 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-22 02:18:44,680 INFO  L204         MainTranslator]: Completed translation
[2024-11-22 02:18:44,683 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:44 WrapperNode
[2024-11-22 02:18:44,684 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-22 02:18:44,685 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-22 02:18:44,685 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-22 02:18:44,685 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-22 02:18:44,699 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:44" (1/1) ...
[2024-11-22 02:18:44,715 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:44" (1/1) ...
[2024-11-22 02:18:44,777 INFO  L138                Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 227
[2024-11-22 02:18:44,777 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-22 02:18:44,778 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-22 02:18:44,779 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-22 02:18:44,779 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-22 02:18:44,791 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:44" (1/1) ...
[2024-11-22 02:18:44,791 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:44" (1/1) ...
[2024-11-22 02:18:44,798 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:44" (1/1) ...
[2024-11-22 02:18:44,824 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-22 02:18:44,827 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:44" (1/1) ...
[2024-11-22 02:18:44,831 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:44" (1/1) ...
[2024-11-22 02:18:44,841 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:44" (1/1) ...
[2024-11-22 02:18:44,851 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:44" (1/1) ...
[2024-11-22 02:18:44,857 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:44" (1/1) ...
[2024-11-22 02:18:44,861 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:44" (1/1) ...
[2024-11-22 02:18:44,864 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-22 02:18:44,869 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-22 02:18:44,869 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-22 02:18:44,869 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-22 02:18:44,870 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:44" (1/1) ...
[2024-11-22 02:18:44,885 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-22 02:18:44,904 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 02:18:44,945 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-22 02:18:44,960 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-22 02:18:45,059 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-22 02:18:45,060 INFO  L130     BoogieDeclarations]: Found specification of procedure error
[2024-11-22 02:18:45,064 INFO  L138     BoogieDeclarations]: Found implementation of procedure error
[2024-11-22 02:18:45,064 INFO  L130     BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered
[2024-11-22 02:18:45,064 INFO  L138     BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered
[2024-11-22 02:18:45,065 INFO  L130     BoogieDeclarations]: Found specification of procedure fire_delta_events
[2024-11-22 02:18:45,065 INFO  L138     BoogieDeclarations]: Found implementation of procedure fire_delta_events
[2024-11-22 02:18:45,065 INFO  L130     BoogieDeclarations]: Found specification of procedure activate_threads
[2024-11-22 02:18:45,065 INFO  L138     BoogieDeclarations]: Found implementation of procedure activate_threads
[2024-11-22 02:18:45,065 INFO  L130     BoogieDeclarations]: Found specification of procedure exists_runnable_thread
[2024-11-22 02:18:45,065 INFO  L138     BoogieDeclarations]: Found implementation of procedure exists_runnable_thread
[2024-11-22 02:18:45,065 INFO  L130     BoogieDeclarations]: Found specification of procedure reset_delta_events
[2024-11-22 02:18:45,065 INFO  L138     BoogieDeclarations]: Found implementation of procedure reset_delta_events
[2024-11-22 02:18:45,066 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-22 02:18:45,066 INFO  L130     BoogieDeclarations]: Found specification of procedure update_channels
[2024-11-22 02:18:45,066 INFO  L138     BoogieDeclarations]: Found implementation of procedure update_channels
[2024-11-22 02:18:45,066 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-22 02:18:45,066 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-22 02:18:45,066 INFO  L130     BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered
[2024-11-22 02:18:45,066 INFO  L138     BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered
[2024-11-22 02:18:45,228 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-22 02:18:45,239 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-22 02:18:45,655 INFO  L735   $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0);
[2024-11-22 02:18:45,655 INFO  L735   $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1;
[2024-11-22 02:18:45,696 INFO  L?                        ?]: Removed 31 outVars from TransFormulas that were not future-live.
[2024-11-22 02:18:45,696 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-22 02:18:45,711 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-22 02:18:45,712 INFO  L316             CfgBuilder]: Removed 4 assume(true) statements.
[2024-11-22 02:18:45,713 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:18:45 BoogieIcfgContainer
[2024-11-22 02:18:45,713 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-22 02:18:45,715 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-22 02:18:45,715 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-22 02:18:45,718 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-22 02:18:45,718 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:18:44" (1/3) ...
[2024-11-22 02:18:45,719 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6175bc97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:18:45, skipping insertion in model container
[2024-11-22 02:18:45,719 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:44" (2/3) ...
[2024-11-22 02:18:45,720 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6175bc97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:18:45, skipping insertion in model container
[2024-11-22 02:18:45,720 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:18:45" (3/3) ...
[2024-11-22 02:18:45,721 INFO  L112   eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c
[2024-11-22 02:18:45,736 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-22 02:18:45,736 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-22 02:18:45,797 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-22 02:18:45,804 INFO  L333      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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@515ec62a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-22 02:18:45,804 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-22 02:18:45,808 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-22 02:18:45,815 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2024-11-22 02:18:45,816 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 02:18:45,817 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 02:18:45,817 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 02:18:45,822 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 02:18:45,822 INFO  L85        PathProgramCache]: Analyzing trace with hash 1330697302, now seen corresponding path program 1 times
[2024-11-22 02:18:45,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 02:18:45,830 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893907237]
[2024-11-22 02:18:45,830 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 02:18:45,831 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 02:18:45,930 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 02:18:46,185 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 02:18:46,186 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 02:18:46,186 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893907237]
[2024-11-22 02:18:46,186 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893907237] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 02:18:46,187 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 02:18:46,187 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-22 02:18:46,188 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973412518]
[2024-11-22 02:18:46,189 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 02:18:46,192 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-22 02:18:46,192 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 02:18:46,209 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-22 02:18:46,209 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-22 02:18:46,212 INFO  L87              Difference]: Start difference. First operand  has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand  has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2024-11-22 02:18:46,841 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 02:18:46,842 INFO  L93              Difference]: Finished difference Result 350 states and 526 transitions.
[2024-11-22 02:18:46,845 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-22 02:18:46,847 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64
[2024-11-22 02:18:46,847 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 02:18:46,860 INFO  L225             Difference]: With dead ends: 350
[2024-11-22 02:18:46,860 INFO  L226             Difference]: Without dead ends: 232
[2024-11-22 02:18:46,867 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-22 02:18:46,871 INFO  L432           NwaCegarLoop]: 118 mSDtfsCounter, 250 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-22 02:18:46,875 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 405 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-22 02:18:46,896 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 232 states.
[2024-11-22 02:18:46,983 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 225.
[2024-11-22 02:18:46,989 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 225 states, 179 states have (on average 1.4245810055865922) internal successors, (255), 183 states have internal predecessors, (255), 29 states have call successors, (29), 15 states have call predecessors, (29), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32)
[2024-11-22 02:18:46,995 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions.
[2024-11-22 02:18:47,001 INFO  L78                 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 64
[2024-11-22 02:18:47,002 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 02:18:47,002 INFO  L471      AbstractCegarLoop]: Abstraction has 225 states and 316 transitions.
[2024-11-22 02:18:47,002 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2024-11-22 02:18:47,002 INFO  L276                IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions.
[2024-11-22 02:18:47,008 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2024-11-22 02:18:47,008 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 02:18:47,008 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 02:18:47,009 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-22 02:18:47,009 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 02:18:47,010 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 02:18:47,010 INFO  L85        PathProgramCache]: Analyzing trace with hash -1285381354, now seen corresponding path program 1 times
[2024-11-22 02:18:47,010 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 02:18:47,013 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218173922]
[2024-11-22 02:18:47,013 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 02:18:47,013 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 02:18:47,061 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 02:18:47,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 02:18:47,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 02:18:47,346 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218173922]
[2024-11-22 02:18:47,346 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218173922] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 02:18:47,346 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 02:18:47,346 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-22 02:18:47,346 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423765484]
[2024-11-22 02:18:47,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 02:18:47,347 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-22 02:18:47,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 02:18:47,348 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-22 02:18:47,348 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-22 02:18:47,349 INFO  L87              Difference]: Start difference. First operand 225 states and 316 transitions. Second operand  has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2024-11-22 02:18:47,745 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 02:18:47,746 INFO  L93              Difference]: Finished difference Result 592 states and 831 transitions.
[2024-11-22 02:18:47,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-22 02:18:47,747 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64
[2024-11-22 02:18:47,747 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 02:18:47,751 INFO  L225             Difference]: With dead ends: 592
[2024-11-22 02:18:47,751 INFO  L226             Difference]: Without dead ends: 383
[2024-11-22 02:18:47,752 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-11-22 02:18:47,753 INFO  L432           NwaCegarLoop]: 189 mSDtfsCounter, 256 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-22 02:18:47,754 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 738 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-22 02:18:47,758 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 383 states.
[2024-11-22 02:18:47,792 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 337.
[2024-11-22 02:18:47,793 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 337 states, 269 states have (on average 1.41635687732342) internal successors, (381), 275 states have internal predecessors, (381), 42 states have call successors, (42), 22 states have call predecessors, (42), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53)
[2024-11-22 02:18:47,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 476 transitions.
[2024-11-22 02:18:47,796 INFO  L78                 Accepts]: Start accepts. Automaton has 337 states and 476 transitions. Word has length 64
[2024-11-22 02:18:47,796 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 02:18:47,797 INFO  L471      AbstractCegarLoop]: Abstraction has 337 states and 476 transitions.
[2024-11-22 02:18:47,797 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2024-11-22 02:18:47,797 INFO  L276                IsEmpty]: Start isEmpty. Operand 337 states and 476 transitions.
[2024-11-22 02:18:47,799 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2024-11-22 02:18:47,799 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 02:18:47,799 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 02:18:47,800 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-22 02:18:47,800 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 02:18:47,800 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 02:18:47,801 INFO  L85        PathProgramCache]: Analyzing trace with hash 980999832, now seen corresponding path program 1 times
[2024-11-22 02:18:47,801 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 02:18:47,801 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152542940]
[2024-11-22 02:18:47,801 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 02:18:47,801 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 02:18:47,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 02:18:47,855 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 02:18:47,855 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 02:18:47,856 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152542940]
[2024-11-22 02:18:47,856 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152542940] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 02:18:47,856 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 02:18:47,856 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-22 02:18:47,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066422970]
[2024-11-22 02:18:47,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 02:18:47,857 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-22 02:18:47,857 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 02:18:47,857 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-22 02:18:47,858 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-22 02:18:47,858 INFO  L87              Difference]: Start difference. First operand 337 states and 476 transitions. Second operand  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7)
[2024-11-22 02:18:48,001 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 02:18:48,001 INFO  L93              Difference]: Finished difference Result 1243 states and 1758 transitions.
[2024-11-22 02:18:48,001 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-22 02:18:48,002 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64
[2024-11-22 02:18:48,002 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 02:18:48,006 INFO  L225             Difference]: With dead ends: 1243
[2024-11-22 02:18:48,006 INFO  L226             Difference]: Without dead ends: 928
[2024-11-22 02:18:48,008 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-22 02:18:48,009 INFO  L432           NwaCegarLoop]: 276 mSDtfsCounter, 254 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 02:18:48,009 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 524 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 02:18:48,010 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 928 states.
[2024-11-22 02:18:48,062 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 905.
[2024-11-22 02:18:48,063 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 905 states, 727 states have (on average 1.3851444291609354) internal successors, (1007), 741 states have internal predecessors, (1007), 102 states have call successors, (102), 64 states have call predecessors, (102), 75 states have return successors, (138), 102 states have call predecessors, (138), 100 states have call successors, (138)
[2024-11-22 02:18:48,067 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1247 transitions.
[2024-11-22 02:18:48,068 INFO  L78                 Accepts]: Start accepts. Automaton has 905 states and 1247 transitions. Word has length 64
[2024-11-22 02:18:48,068 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 02:18:48,068 INFO  L471      AbstractCegarLoop]: Abstraction has 905 states and 1247 transitions.
[2024-11-22 02:18:48,068 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7)
[2024-11-22 02:18:48,068 INFO  L276                IsEmpty]: Start isEmpty. Operand 905 states and 1247 transitions.
[2024-11-22 02:18:48,070 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2024-11-22 02:18:48,071 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 02:18:48,071 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 02:18:48,071 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-22 02:18:48,071 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 02:18:48,071 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 02:18:48,072 INFO  L85        PathProgramCache]: Analyzing trace with hash 779831852, now seen corresponding path program 1 times
[2024-11-22 02:18:48,072 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 02:18:48,072 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888761427]
[2024-11-22 02:18:48,072 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 02:18:48,072 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 02:18:48,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 02:18:48,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 02:18:48,126 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 02:18:48,126 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888761427]
[2024-11-22 02:18:48,126 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888761427] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 02:18:48,126 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 02:18:48,126 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-22 02:18:48,126 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202253701]
[2024-11-22 02:18:48,127 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 02:18:48,127 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-22 02:18:48,127 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 02:18:48,128 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-22 02:18:48,128 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-22 02:18:48,128 INFO  L87              Difference]: Start difference. First operand 905 states and 1247 transitions. Second operand  has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7)
[2024-11-22 02:18:48,181 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 02:18:48,181 INFO  L93              Difference]: Finished difference Result 1808 states and 2511 transitions.
[2024-11-22 02:18:48,182 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-22 02:18:48,182 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65
[2024-11-22 02:18:48,182 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 02:18:48,187 INFO  L225             Difference]: With dead ends: 1808
[2024-11-22 02:18:48,187 INFO  L226             Difference]: Without dead ends: 925
[2024-11-22 02:18:48,189 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-22 02:18:48,190 INFO  L432           NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 02:18:48,190 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 769 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 02:18:48,191 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 925 states.
[2024-11-22 02:18:48,231 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 925.
[2024-11-22 02:18:48,232 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 925 states, 743 states have (on average 1.370121130551817) internal successors, (1018), 757 states have internal predecessors, (1018), 102 states have call successors, (102), 64 states have call predecessors, (102), 79 states have return successors, (145), 106 states have call predecessors, (145), 100 states have call successors, (145)
[2024-11-22 02:18:48,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1265 transitions.
[2024-11-22 02:18:48,237 INFO  L78                 Accepts]: Start accepts. Automaton has 925 states and 1265 transitions. Word has length 65
[2024-11-22 02:18:48,237 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 02:18:48,237 INFO  L471      AbstractCegarLoop]: Abstraction has 925 states and 1265 transitions.
[2024-11-22 02:18:48,238 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7)
[2024-11-22 02:18:48,238 INFO  L276                IsEmpty]: Start isEmpty. Operand 925 states and 1265 transitions.
[2024-11-22 02:18:48,239 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2024-11-22 02:18:48,239 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 02:18:48,239 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 02:18:48,240 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-22 02:18:48,240 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 02:18:48,240 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 02:18:48,240 INFO  L85        PathProgramCache]: Analyzing trace with hash -249527446, now seen corresponding path program 1 times
[2024-11-22 02:18:48,241 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 02:18:48,241 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010050480]
[2024-11-22 02:18:48,241 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 02:18:48,241 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 02:18:48,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 02:18:48,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 02:18:48,293 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 02:18:48,294 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010050480]
[2024-11-22 02:18:48,294 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010050480] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 02:18:48,294 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 02:18:48,294 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-22 02:18:48,294 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985033211]
[2024-11-22 02:18:48,294 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 02:18:48,295 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-22 02:18:48,295 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 02:18:48,295 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-22 02:18:48,296 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-22 02:18:48,296 INFO  L87              Difference]: Start difference. First operand 925 states and 1265 transitions. Second operand  has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7)
[2024-11-22 02:18:48,724 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 02:18:48,725 INFO  L93              Difference]: Finished difference Result 3486 states and 4801 transitions.
[2024-11-22 02:18:48,725 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-22 02:18:48,725 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65
[2024-11-22 02:18:48,725 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 02:18:48,731 INFO  L225             Difference]: With dead ends: 3486
[2024-11-22 02:18:48,731 INFO  L226             Difference]: Without dead ends: 1221
[2024-11-22 02:18:48,735 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-11-22 02:18:48,736 INFO  L432           NwaCegarLoop]: 432 mSDtfsCounter, 880 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-22 02:18:48,737 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 1290 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-22 02:18:48,738 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1221 states.
[2024-11-22 02:18:48,789 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 841.
[2024-11-22 02:18:48,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 841 states, 659 states have (on average 1.3277693474962065) internal successors, (875), 673 states have internal predecessors, (875), 102 states have call successors, (102), 64 states have call predecessors, (102), 79 states have return successors, (133), 106 states have call predecessors, (133), 100 states have call successors, (133)
[2024-11-22 02:18:48,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1110 transitions.
[2024-11-22 02:18:48,796 INFO  L78                 Accepts]: Start accepts. Automaton has 841 states and 1110 transitions. Word has length 65
[2024-11-22 02:18:48,797 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 02:18:48,797 INFO  L471      AbstractCegarLoop]: Abstraction has 841 states and 1110 transitions.
[2024-11-22 02:18:48,797 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7)
[2024-11-22 02:18:48,798 INFO  L276                IsEmpty]: Start isEmpty. Operand 841 states and 1110 transitions.
[2024-11-22 02:18:48,799 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2024-11-22 02:18:48,799 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 02:18:48,799 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 02:18:48,800 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-22 02:18:48,800 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 02:18:48,800 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 02:18:48,800 INFO  L85        PathProgramCache]: Analyzing trace with hash 1228594481, now seen corresponding path program 1 times
[2024-11-22 02:18:48,801 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 02:18:48,801 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855331207]
[2024-11-22 02:18:48,801 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 02:18:48,801 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 02:18:48,816 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 02:18:48,878 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 02:18:48,878 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 02:18:48,878 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855331207]
[2024-11-22 02:18:48,879 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855331207] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 02:18:48,879 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 02:18:48,879 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-22 02:18:48,879 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895241473]
[2024-11-22 02:18:48,880 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 02:18:48,881 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-22 02:18:48,881 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 02:18:48,881 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-22 02:18:48,881 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-22 02:18:48,882 INFO  L87              Difference]: Start difference. First operand 841 states and 1110 transitions. Second operand  has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7)
[2024-11-22 02:18:49,005 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 02:18:49,006 INFO  L93              Difference]: Finished difference Result 1705 states and 2258 transitions.
[2024-11-22 02:18:49,010 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-22 02:18:49,011 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66
[2024-11-22 02:18:49,011 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 02:18:49,022 INFO  L225             Difference]: With dead ends: 1705
[2024-11-22 02:18:49,022 INFO  L226             Difference]: Without dead ends: 886
[2024-11-22 02:18:49,028 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-22 02:18:49,029 INFO  L432           NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 02:18:49,029 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 725 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 02:18:49,031 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 886 states.
[2024-11-22 02:18:49,148 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886.
[2024-11-22 02:18:49,150 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 886 states, 695 states have (on average 1.3107913669064748) internal successors, (911), 709 states have internal predecessors, (911), 102 states have call successors, (102), 64 states have call predecessors, (102), 88 states have return successors, (142), 115 states have call predecessors, (142), 100 states have call successors, (142)
[2024-11-22 02:18:49,153 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1155 transitions.
[2024-11-22 02:18:49,159 INFO  L78                 Accepts]: Start accepts. Automaton has 886 states and 1155 transitions. Word has length 66
[2024-11-22 02:18:49,159 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 02:18:49,159 INFO  L471      AbstractCegarLoop]: Abstraction has 886 states and 1155 transitions.
[2024-11-22 02:18:49,160 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7)
[2024-11-22 02:18:49,160 INFO  L276                IsEmpty]: Start isEmpty. Operand 886 states and 1155 transitions.
[2024-11-22 02:18:49,161 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2024-11-22 02:18:49,161 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 02:18:49,161 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 02:18:49,165 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-22 02:18:49,166 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 02:18:49,166 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 02:18:49,166 INFO  L85        PathProgramCache]: Analyzing trace with hash -1680169421, now seen corresponding path program 1 times
[2024-11-22 02:18:49,166 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 02:18:49,166 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140660409]
[2024-11-22 02:18:49,166 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 02:18:49,167 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 02:18:49,183 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 02:18:49,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 02:18:49,361 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 02:18:49,361 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140660409]
[2024-11-22 02:18:49,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140660409] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 02:18:49,362 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 02:18:49,362 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-22 02:18:49,362 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676572319]
[2024-11-22 02:18:49,362 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 02:18:49,362 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-22 02:18:49,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 02:18:49,363 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-22 02:18:49,363 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-22 02:18:49,363 INFO  L87              Difference]: Start difference. First operand 886 states and 1155 transitions. Second operand  has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2024-11-22 02:18:49,755 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 02:18:49,755 INFO  L93              Difference]: Finished difference Result 1802 states and 2324 transitions.
[2024-11-22 02:18:49,756 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-22 02:18:49,756 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66
[2024-11-22 02:18:49,756 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 02:18:49,763 INFO  L225             Difference]: With dead ends: 1802
[2024-11-22 02:18:49,764 INFO  L226             Difference]: Without dead ends: 1025
[2024-11-22 02:18:49,766 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2024-11-22 02:18:49,769 INFO  L432           NwaCegarLoop]: 104 mSDtfsCounter, 255 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-22 02:18:49,769 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 438 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-22 02:18:49,771 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1025 states.
[2024-11-22 02:18:49,820 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 895.
[2024-11-22 02:18:49,821 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 895 states, 704 states have (on average 1.3039772727272727) internal successors, (918), 716 states have internal predecessors, (918), 103 states have call successors, (103), 65 states have call predecessors, (103), 87 states have return successors, (137), 116 states have call predecessors, (137), 101 states have call successors, (137)
[2024-11-22 02:18:49,825 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1158 transitions.
[2024-11-22 02:18:49,827 INFO  L78                 Accepts]: Start accepts. Automaton has 895 states and 1158 transitions. Word has length 66
[2024-11-22 02:18:49,828 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 02:18:49,828 INFO  L471      AbstractCegarLoop]: Abstraction has 895 states and 1158 transitions.
[2024-11-22 02:18:49,829 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2024-11-22 02:18:49,829 INFO  L276                IsEmpty]: Start isEmpty. Operand 895 states and 1158 transitions.
[2024-11-22 02:18:49,852 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2024-11-22 02:18:49,852 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 02:18:49,852 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 02:18:49,852 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-22 02:18:49,853 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 02:18:49,854 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 02:18:49,854 INFO  L85        PathProgramCache]: Analyzing trace with hash -1814182927, now seen corresponding path program 1 times
[2024-11-22 02:18:49,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 02:18:49,854 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579096650]
[2024-11-22 02:18:49,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 02:18:49,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 02:18:49,874 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 02:18:49,920 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 02:18:49,921 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 02:18:49,921 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579096650]
[2024-11-22 02:18:49,921 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579096650] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 02:18:49,921 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 02:18:49,921 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-22 02:18:49,921 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346043029]
[2024-11-22 02:18:49,921 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 02:18:49,922 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-22 02:18:49,922 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 02:18:49,922 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-22 02:18:49,922 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-22 02:18:49,923 INFO  L87              Difference]: Start difference. First operand 895 states and 1158 transitions. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2024-11-22 02:18:50,186 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 02:18:50,186 INFO  L93              Difference]: Finished difference Result 2624 states and 3431 transitions.
[2024-11-22 02:18:50,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-22 02:18:50,187 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66
[2024-11-22 02:18:50,187 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 02:18:50,196 INFO  L225             Difference]: With dead ends: 2624
[2024-11-22 02:18:50,196 INFO  L226             Difference]: Without dead ends: 1754
[2024-11-22 02:18:50,199 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-22 02:18:50,199 INFO  L432           NwaCegarLoop]: 90 mSDtfsCounter, 207 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-22 02:18:50,200 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 221 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-22 02:18:50,202 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1754 states.
[2024-11-22 02:18:50,289 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1744.
[2024-11-22 02:18:50,292 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1744 states, 1358 states have (on average 1.2820324005891017) internal successors, (1741), 1383 states have internal predecessors, (1741), 207 states have call successors, (207), 129 states have call predecessors, (207), 178 states have return successors, (314), 237 states have call predecessors, (314), 205 states have call successors, (314)
[2024-11-22 02:18:50,300 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2262 transitions.
[2024-11-22 02:18:50,302 INFO  L78                 Accepts]: Start accepts. Automaton has 1744 states and 2262 transitions. Word has length 66
[2024-11-22 02:18:50,302 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 02:18:50,302 INFO  L471      AbstractCegarLoop]: Abstraction has 1744 states and 2262 transitions.
[2024-11-22 02:18:50,302 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2024-11-22 02:18:50,303 INFO  L276                IsEmpty]: Start isEmpty. Operand 1744 states and 2262 transitions.
[2024-11-22 02:18:50,304 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2024-11-22 02:18:50,304 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 02:18:50,304 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 02:18:50,304 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-22 02:18:50,304 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 02:18:50,305 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 02:18:50,305 INFO  L85        PathProgramCache]: Analyzing trace with hash -825282310, now seen corresponding path program 1 times
[2024-11-22 02:18:50,305 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 02:18:50,305 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660278119]
[2024-11-22 02:18:50,305 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 02:18:50,305 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 02:18:50,320 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 02:18:50,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 02:18:50,339 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 02:18:50,339 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660278119]
[2024-11-22 02:18:50,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660278119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 02:18:50,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 02:18:50,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-22 02:18:50,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605653756]
[2024-11-22 02:18:50,339 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 02:18:50,340 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-22 02:18:50,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 02:18:50,340 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-22 02:18:50,340 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-22 02:18:50,341 INFO  L87              Difference]: Start difference. First operand 1744 states and 2262 transitions. Second operand  has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)
[2024-11-22 02:18:50,453 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 02:18:50,454 INFO  L93              Difference]: Finished difference Result 3327 states and 4389 transitions.
[2024-11-22 02:18:50,454 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-22 02:18:50,454 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67
[2024-11-22 02:18:50,454 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 02:18:50,457 INFO  L225             Difference]: With dead ends: 3327
[2024-11-22 02:18:50,457 INFO  L226             Difference]: Without dead ends: 0
[2024-11-22 02:18:50,464 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-22 02:18:50,464 INFO  L432           NwaCegarLoop]: 133 mSDtfsCounter, 114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 02:18:50,465 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 133 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 02:18:50,465 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-22 02:18:50,465 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-22 02:18:50,465 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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)
[2024-11-22 02:18:50,466 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-22 02:18:50,467 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67
[2024-11-22 02:18:50,467 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 02:18:50,468 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-22 02:18:50,468 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)
[2024-11-22 02:18:50,468 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-22 02:18:50,468 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-22 02:18:50,471 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-22 02:18:50,472 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-22 02:18:50,474 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 02:18:50,477 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-22 02:18:55,385 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-22 02:18:55,429 WARN  L156        FloydHoareUtils]: Requires clause for activate_threads contained old-variable. Original clause: (let ((.cse0 (= ~c_dr_pc~0 0))) (and (or (= ~c_dr_pc~0 1) .cse0) (or (= |old(~p_dw_st~0)| ~p_dw_st~0) (not .cse0))))  Eliminated clause: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0))
[2024-11-22 02:18:55,460 WARN  L156        FloydHoareUtils]: Requires clause for fire_delta_events contained old-variable. Original clause: (and (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))  Eliminated clause: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0))
[2024-11-22 02:18:55,466 WARN  L156        FloydHoareUtils]: Requires clause for update_channels contained old-variable. Original clause: (and (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))  Eliminated clause: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0))
[2024-11-22 02:18:55,470 WARN  L156        FloydHoareUtils]: Requires clause for reset_delta_events contained old-variable. Original clause: (and (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))  Eliminated clause: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0))
[2024-11-22 02:18:55,481 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:18:55 BoogieIcfgContainer
[2024-11-22 02:18:55,481 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-22 02:18:55,482 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-22 02:18:55,482 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-22 02:18:55,482 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-22 02:18:55,483 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:18:45" (3/4) ...
[2024-11-22 02:18:55,485 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-22 02:18:55,488 INFO  L361     RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads
[2024-11-22 02:18:55,489 INFO  L361     RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread
[2024-11-22 02:18:55,489 INFO  L361     RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered
[2024-11-22 02:18:55,489 INFO  L361     RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events
[2024-11-22 02:18:55,489 INFO  L361     RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels
[2024-11-22 02:18:55,489 INFO  L361     RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events
[2024-11-22 02:18:55,489 INFO  L361     RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered
[2024-11-22 02:18:55,489 INFO  L361     RCFGBacktranslator]: Ignoring RootEdge to procedure error
[2024-11-22 02:18:55,494 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges
[2024-11-22 02:18:55,495 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-22 02:18:55,495 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-22 02:18:55,495 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-22 02:18:55,583 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-22 02:18:55,585 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-22 02:18:55,586 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-22 02:18:55,586 INFO  L158              Benchmark]: Toolchain (without parser) took 11580.80ms. Allocated memory was 159.4MB in the beginning and 448.8MB in the end (delta: 289.4MB). Free memory was 86.6MB in the beginning and 371.7MB in the end (delta: -285.1MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB.
[2024-11-22 02:18:55,586 INFO  L158              Benchmark]: CDTParser took 0.13ms. Allocated memory is still 159.4MB. Free memory was 111.2MB in the beginning and 111.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-22 02:18:55,587 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 672.29ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 86.4MB in the beginning and 218.4MB in the end (delta: -132.0MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB.
[2024-11-22 02:18:55,587 INFO  L158              Benchmark]: Boogie Procedure Inliner took 92.63ms. Allocated memory is still 247.5MB. Free memory was 218.4MB in the beginning and 216.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-22 02:18:55,587 INFO  L158              Benchmark]: Boogie Preprocessor took 89.75ms. Allocated memory is still 247.5MB. Free memory was 216.2MB in the beginning and 213.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-22 02:18:55,587 INFO  L158              Benchmark]: RCFGBuilder took 844.51ms. Allocated memory is still 247.5MB. Free memory was 213.2MB in the beginning and 190.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2024-11-22 02:18:55,587 INFO  L158              Benchmark]: TraceAbstraction took 9766.36ms. Allocated memory was 247.5MB in the beginning and 448.8MB in the end (delta: 201.3MB). Free memory was 189.1MB in the beginning and 380.1MB in the end (delta: -191.0MB). Peak memory consumption was 192.9MB. Max. memory is 16.1GB.
[2024-11-22 02:18:55,587 INFO  L158              Benchmark]: Witness Printer took 103.68ms. Allocated memory is still 448.8MB. Free memory was 380.1MB in the beginning and 371.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-22 02:18:55,589 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.13ms. Allocated memory is still 159.4MB. Free memory was 111.2MB in the beginning and 111.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 672.29ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 86.4MB in the beginning and 218.4MB in the end (delta: -132.0MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 92.63ms. Allocated memory is still 247.5MB. Free memory was 218.4MB in the beginning and 216.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 89.75ms. Allocated memory is still 247.5MB. Free memory was 216.2MB in the beginning and 213.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 844.51ms. Allocated memory is still 247.5MB. Free memory was 213.2MB in the beginning and 190.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 9766.36ms. Allocated memory was 247.5MB in the beginning and 448.8MB in the end (delta: 201.3MB). Free memory was 189.1MB in the beginning and 380.1MB in the end (delta: -191.0MB). Peak memory consumption was 192.9MB. Max. memory is 16.1GB.
 * Witness Printer took 103.68ms. Allocated memory is still 448.8MB. Free memory was 380.1MB in the beginning and 371.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 19]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 9 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2255 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2216 mSDsluCounter, 5243 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3600 mSDsCounter, 349 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1778 IncrementalHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 349 mSolverCounterUnsat, 1643 mSDtfsCounter, 1778 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1744occurred in iteration=8, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 596 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 587 NumberOfCodeBlocks, 587 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 491]: Loop Invariant
    Derived loop invariant: ((c_dr_pc == 1) || (c_dr_pc == 0))
  - InvariantResult [Line: 210]: Location Invariant
    Derived location invariant: 1
  - InvariantResult [Line: 410]: Loop Invariant
    Derived loop invariant: ((c_dr_pc == 1) || (c_dr_pc == 0))
  - InvariantResult [Line: 164]: Location Invariant
    Derived location invariant: ((c_dr_pc == 1) || (c_dr_pc == 0))
  - ProcedureContractResult [Line: 379]: Procedure Contract for activate_threads
    Derived contract for procedure activate_threads. Requires: ((c_dr_pc == 1) || (c_dr_pc == 0)) Ensures: ((((((((\old(p_dw_st) == p_dw_st) || (c_dr_pc == 1)) || (p_dw_pc == 1)) || (q_read_ev != 2)) && (((\old(p_dw_st) == p_dw_st) || (p_dw_pc == 1)) || (c_dr_pc != p_dw_pc))) && (((\old(p_dw_st) == p_dw_st) || (c_dr_pc != 0)) || (p_dw_st == 0))) && ((c_dr_pc == 1) || (c_dr_pc == 0))) && ((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))))
  - ProcedureContractResult [Line: 287]: Procedure Contract for exists_runnable_thread
    Derived contract for procedure exists_runnable_thread. Requires: ((c_dr_pc == 1) || (c_dr_pc == 0)) Ensures: (((c_dr_pc == 1) || (c_dr_pc == 0)) && ((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))))
  - ProcedureContractResult [Line: 91]: Procedure Contract for is_do_read_c_triggered
    Derived contract for procedure is_do_read_c_triggered. Requires: ((c_dr_pc == 1) || (c_dr_pc == 0)) Ensures: ((((\result == 0) || (c_dr_pc != 0)) && ((c_dr_pc == 1) || (c_dr_pc == 0))) && ((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))))
  - ProcedureContractResult [Line: 307]: Procedure Contract for fire_delta_events
    Derived contract for procedure fire_delta_events. Requires: ((c_dr_pc == 1) || (c_dr_pc == 0)) Ensures: ((((((q_write_ev == 2) || (\old(q_read_ev) != 2)) || (2 != \old(q_write_ev))) && ((c_dr_pc == 1) || (c_dr_pc == 0))) && ((\old(q_read_ev) == q_read_ev) || (\old(q_read_ev) == 0))) && ((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))))
  - ProcedureContractResult [Line: 254]: Procedure Contract for update_channels
    Derived contract for procedure update_channels. Requires: ((c_dr_pc == 1) || (c_dr_pc == 0)) Ensures: (((c_dr_pc == 1) || (c_dr_pc == 0)) && ((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))))
  - ProcedureContractResult [Line: 325]: Procedure Contract for reset_delta_events
    Derived contract for procedure reset_delta_events. Requires: ((c_dr_pc == 1) || (c_dr_pc == 0)) Ensures: (((((((((q_write_ev == \old(q_write_ev)) && (\old(q_read_ev) != 1)) || (c_dr_pc != 0)) || (\old(q_read_ev) != \old(q_write_ev))) || (q_read_ev == 2)) && ((\old(q_read_ev) == q_read_ev) || (q_read_ev == 2))) && ((c_dr_pc == 1) || (c_dr_pc == 0))) && ((((c_dr_pc != 0) || (q_write_ev == 2)) || (\old(q_read_ev) != 2)) || (2 != \old(q_write_ev)))) && ((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))))
  - ProcedureContractResult [Line: 62]: Procedure Contract for is_do_write_p_triggered
    Derived contract for procedure is_do_write_p_triggered. Requires: ((c_dr_pc == 1) || (c_dr_pc == 0)) Ensures: ((((((p_dw_pc == 1) || (\result == 0)) || (q_read_ev != 2)) && ((p_dw_pc != 0) || (\result == 0))) && ((c_dr_pc == 1) || (c_dr_pc == 0))) && ((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))))
  - ProcedureContractResult [Line: 15]: Procedure Contract for error
    Derived contract for procedure error. Requires: 0 Ensures: (0 && ((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))))
RESULT: Ultimate proved your program to be correct!
[2024-11-22 02:18:55,629 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE