./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 5e519f3a
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 7adc5be84218941c02109a6f05aa2044beb278121fd387aba807705fdb759027
--- Real Ultimate output ---
[0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset.
This is Ultimate 0.2.2-dev-5e519f3
[2022-11-02 20:47:05,842 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-11-02 20:47:05,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-11-02 20:47:05,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-11-02 20:47:05,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-11-02 20:47:05,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-11-02 20:47:05,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-11-02 20:47:05,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-11-02 20:47:05,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-11-02 20:47:05,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-11-02 20:47:05,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-11-02 20:47:05,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-11-02 20:47:05,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-11-02 20:47:05,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-11-02 20:47:05,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-11-02 20:47:05,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-11-02 20:47:05,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-11-02 20:47:05,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-11-02 20:47:05,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-11-02 20:47:05,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-11-02 20:47:05,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-11-02 20:47:05,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-11-02 20:47:05,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-11-02 20:47:05,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-11-02 20:47:05,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-11-02 20:47:05,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-11-02 20:47:05,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-11-02 20:47:05,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-11-02 20:47:05,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-11-02 20:47:05,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-11-02 20:47:05,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-11-02 20:47:05,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-11-02 20:47:05,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-11-02 20:47:05,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-11-02 20:47:05,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-11-02 20:47:05,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-11-02 20:47:05,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-11-02 20:47:05,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-11-02 20:47:05,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-11-02 20:47:05,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-11-02 20:47:05,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-11-02 20:47:05,911 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf
[2022-11-02 20:47:05,955 INFO L113 SettingsManager]: Loading preferences was successful
[2022-11-02 20:47:05,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-11-02 20:47:05,955 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-11-02 20:47:05,956 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-11-02 20:47:05,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-11-02 20:47:05,957 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-11-02 20:47:05,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-11-02 20:47:05,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-11-02 20:47:05,958 INFO L138 SettingsManager]: * Use SBE=true
[2022-11-02 20:47:05,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-11-02 20:47:05,959 INFO L138 SettingsManager]: * sizeof long=4
[2022-11-02 20:47:05,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-11-02 20:47:05,959 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-11-02 20:47:05,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-11-02 20:47:05,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-11-02 20:47:05,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-11-02 20:47:05,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-11-02 20:47:05,960 INFO L138 SettingsManager]: * sizeof long double=12
[2022-11-02 20:47:05,961 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-11-02 20:47:05,961 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-11-02 20:47:05,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-11-02 20:47:05,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-11-02 20:47:05,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-11-02 20:47:05,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-11-02 20:47:05,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:47:05,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-11-02 20:47:05,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-11-02 20:47:05,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-11-02 20:47:05,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-11-02 20:47:05,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-11-02 20:47:05,963 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2022-11-02 20:47:05,963 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2022-11-02 20:47:05,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-11-02 20:47:05,963 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
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 -> 7adc5be84218941c02109a6f05aa2044beb278121fd387aba807705fdb759027
[2022-11-02 20:47:06,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-11-02 20:47:06,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-11-02 20:47:06,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-11-02 20:47:06,265 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-11-02 20:47:06,266 INFO L275 PluginConnector]: CDTParser initialized
[2022-11-02 20:47:06,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c
[2022-11-02 20:47:06,356 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/data/3202589e1/ce28a0f0690242138784c9874b47c814/FLAGcc061565a
[2022-11-02 20:47:07,415 INFO L306 CDTParser]: Found 1 translation units.
[2022-11-02 20:47:07,416 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c
[2022-11-02 20:47:07,474 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/data/3202589e1/ce28a0f0690242138784c9874b47c814/FLAGcc061565a
[2022-11-02 20:47:07,756 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/data/3202589e1/ce28a0f0690242138784c9874b47c814
[2022-11-02 20:47:07,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-11-02 20:47:07,762 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-11-02 20:47:07,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-11-02 20:47:07,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-11-02 20:47:07,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-11-02 20:47:07,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:07" (1/1) ...
[2022-11-02 20:47:07,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3081b0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:07, skipping insertion in model container
[2022-11-02 20:47:07,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:07" (1/1) ...
[2022-11-02 20:47:07,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-11-02 20:47:08,035 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-11-02 20:47:10,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[380323,380336]
[2022-11-02 20:47:10,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[383339,383352]
[2022-11-02 20:47:10,622 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:47:10,631 INFO L203 MainTranslator]: Completed pre-run
[2022-11-02 20:47:11,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[380323,380336]
[2022-11-02 20:47:11,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[383339,383352]
[2022-11-02 20:47:11,850 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:47:11,916 INFO L208 MainTranslator]: Completed translation
[2022-11-02 20:47:11,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:11 WrapperNode
[2022-11-02 20:47:11,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-11-02 20:47:11,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-11-02 20:47:11,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-11-02 20:47:11,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-11-02 20:47:11,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:11" (1/1) ...
[2022-11-02 20:47:12,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:11" (1/1) ...
[2022-11-02 20:47:12,472 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12566
[2022-11-02 20:47:12,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-11-02 20:47:12,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-11-02 20:47:12,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-11-02 20:47:12,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-11-02 20:47:12,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:11" (1/1) ...
[2022-11-02 20:47:12,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:11" (1/1) ...
[2022-11-02 20:47:12,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:11" (1/1) ...
[2022-11-02 20:47:12,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:11" (1/1) ...
[2022-11-02 20:47:12,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:11" (1/1) ...
[2022-11-02 20:47:12,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:11" (1/1) ...
[2022-11-02 20:47:12,885 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:11" (1/1) ...
[2022-11-02 20:47:12,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:11" (1/1) ...
[2022-11-02 20:47:13,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-11-02 20:47:13,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-11-02 20:47:13,012 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-11-02 20:47:13,012 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-11-02 20:47:13,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:11" (1/1) ...
[2022-11-02 20:47:13,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:47:13,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:47:13,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-11-02 20:47:13,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-11-02 20:47:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-11-02 20:47:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure error
[2022-11-02 20:47:13,208 INFO L138 BoogieDeclarations]: Found implementation of procedure error
[2022-11-02 20:47:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events
[2022-11-02 20:47:13,208 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events
[2022-11-02 20:47:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads
[2022-11-02 20:47:13,208 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads
[2022-11-02 20:47:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify
[2022-11-02 20:47:13,209 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify
[2022-11-02 20:47:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread
[2022-11-02 20:47:13,209 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread
[2022-11-02 20:47:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events
[2022-11-02 20:47:13,209 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events
[2022-11-02 20:47:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-11-02 20:47:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels
[2022-11-02 20:47:13,209 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels
[2022-11-02 20:47:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-11-02 20:47:13,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-11-02 20:47:13,392 INFO L235 CfgBuilder]: Building ICFG
[2022-11-02 20:47:13,394 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-11-02 20:47:22,047 INFO L276 CfgBuilder]: Performing block encoding
[2022-11-02 20:47:22,081 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-11-02 20:47:22,081 INFO L300 CfgBuilder]: Removed 5 assume(true) statements.
[2022-11-02 20:47:22,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:22 BoogieIcfgContainer
[2022-11-02 20:47:22,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-11-02 20:47:22,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-11-02 20:47:22,091 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-11-02 20:47:22,095 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-11-02 20:47:22,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:47:07" (1/3) ...
[2022-11-02 20:47:22,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba85b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:22, skipping insertion in model container
[2022-11-02 20:47:22,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:11" (2/3) ...
[2022-11-02 20:47:22,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba85b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:22, skipping insertion in model container
[2022-11-02 20:47:22,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:22" (3/3) ...
[2022-11-02 20:47:22,097 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.01.cil-2.c
[2022-11-02 20:47:22,116 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-11-02 20:47:22,117 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2022-11-02 20:47:22,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-02 20:47:22,230 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2f188460, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-02 20:47:22,230 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2022-11-02 20:47:22,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17)
[2022-11-02 20:47:22,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2022-11-02 20:47:22,268 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:22,268 INFO L195 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]
[2022-11-02 20:47:22,269 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:22,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:22,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1417964819, now seen corresponding path program 1 times
[2022-11-02 20:47:22,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:22,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087378810]
[2022-11-02 20:47:22,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:22,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:22,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2022-11-02 20:47:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:22,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-11-02 20:47:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:22,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-11-02 20:47:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:22,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2022-11-02 20:47:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:22,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2022-11-02 20:47:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:22,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:47:22,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:22,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087378810]
[2022-11-02 20:47:22,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087378810] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:22,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:47:22,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-02 20:47:22,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711592001]
[2022-11-02 20:47:22,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:22,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:47:22,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:22,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:47:22,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:47:22,830 INFO L87 Difference]: Start difference. First operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-11-02 20:47:23,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:23,758 INFO L93 Difference]: Finished difference Result 4727 states and 8720 transitions.
[2022-11-02 20:47:23,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-11-02 20:47:23,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58
[2022-11-02 20:47:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:23,786 INFO L225 Difference]: With dead ends: 4727
[2022-11-02 20:47:23,786 INFO L226 Difference]: Without dead ends: 2368
[2022-11-02 20:47:23,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2022-11-02 20:47:23,800 INFO L413 NwaCegarLoop]: 4199 mSDtfsCounter, 4329 mSDsluCounter, 12380 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4337 SdHoareTripleChecker+Valid, 16579 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:23,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4337 Valid, 16579 Invalid, 494 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [80 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-11-02 20:47:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states.
[2022-11-02 20:47:23,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2325.
[2022-11-02 20:47:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2325 states, 2283 states have (on average 1.838370565045992) internal successors, (4197), 2287 states have internal predecessors, (4197), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28)
[2022-11-02 20:47:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 4252 transitions.
[2022-11-02 20:47:23,957 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 4252 transitions. Word has length 58
[2022-11-02 20:47:23,958 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:23,959 INFO L495 AbstractCegarLoop]: Abstraction has 2325 states and 4252 transitions.
[2022-11-02 20:47:23,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-11-02 20:47:23,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 4252 transitions.
[2022-11-02 20:47:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2022-11-02 20:47:23,972 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:23,972 INFO L195 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]
[2022-11-02 20:47:23,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-11-02 20:47:23,973 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:23,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:23,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1082743281, now seen corresponding path program 1 times
[2022-11-02 20:47:23,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:23,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896510878]
[2022-11-02 20:47:23,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:23,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:24,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2022-11-02 20:47:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:24,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-11-02 20:47:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:24,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-11-02 20:47:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:24,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2022-11-02 20:47:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:24,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2022-11-02 20:47:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:47:24,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:24,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896510878]
[2022-11-02 20:47:24,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896510878] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:24,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:47:24,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-11-02 20:47:24,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119350402]
[2022-11-02 20:47:24,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:24,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-11-02 20:47:24,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:24,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-11-02 20:47:24,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-11-02 20:47:24,250 INFO L87 Difference]: Start difference. First operand 2325 states and 4252 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-11-02 20:47:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:25,089 INFO L93 Difference]: Finished difference Result 2676 states and 4760 transitions.
[2022-11-02 20:47:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-11-02 20:47:25,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58
[2022-11-02 20:47:25,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:25,106 INFO L225 Difference]: With dead ends: 2676
[2022-11-02 20:47:25,106 INFO L226 Difference]: Without dead ends: 2481
[2022-11-02 20:47:25,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240
[2022-11-02 20:47:25,113 INFO L413 NwaCegarLoop]: 4200 mSDtfsCounter, 4245 mSDsluCounter, 16382 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4253 SdHoareTripleChecker+Valid, 20582 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:25,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4253 Valid, 20582 Invalid, 706 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-11-02 20:47:25,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states.
[2022-11-02 20:47:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2415.
[2022-11-02 20:47:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2415 states, 2356 states have (on average 1.8259762308998302) internal successors, (4302), 2361 states have internal predecessors, (4302), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40)
[2022-11-02 20:47:25,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 4379 transitions.
[2022-11-02 20:47:25,288 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 4379 transitions. Word has length 58
[2022-11-02 20:47:25,288 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:25,289 INFO L495 AbstractCegarLoop]: Abstraction has 2415 states and 4379 transitions.
[2022-11-02 20:47:25,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-11-02 20:47:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 4379 transitions.
[2022-11-02 20:47:25,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2022-11-02 20:47:25,290 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:25,291 INFO L195 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]
[2022-11-02 20:47:25,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-11-02 20:47:25,291 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:25,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:25,292 INFO L85 PathProgramCache]: Analyzing trace with hash -189256943, now seen corresponding path program 1 times
[2022-11-02 20:47:25,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:25,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161782124]
[2022-11-02 20:47:25,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:25,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:25,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2022-11-02 20:47:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:25,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-11-02 20:47:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:25,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-11-02 20:47:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:25,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2022-11-02 20:47:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:25,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2022-11-02 20:47:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:47:25,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:25,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161782124]
[2022-11-02 20:47:25,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161782124] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:25,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:47:25,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-11-02 20:47:25,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335768719]
[2022-11-02 20:47:25,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:25,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-11-02 20:47:25,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:25,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-11-02 20:47:25,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-11-02 20:47:25,439 INFO L87 Difference]: Start difference. First operand 2415 states and 4379 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-11-02 20:47:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:26,389 INFO L93 Difference]: Finished difference Result 3027 states and 5257 transitions.
[2022-11-02 20:47:26,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-11-02 20:47:26,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58
[2022-11-02 20:47:26,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:26,412 INFO L225 Difference]: With dead ends: 3027
[2022-11-02 20:47:26,412 INFO L226 Difference]: Without dead ends: 2742
[2022-11-02 20:47:26,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272
[2022-11-02 20:47:26,431 INFO L413 NwaCegarLoop]: 4190 mSDtfsCounter, 4299 mSDsluCounter, 16374 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4309 SdHoareTripleChecker+Valid, 20564 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:26,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4309 Valid, 20564 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-11-02 20:47:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states.
[2022-11-02 20:47:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2590.
[2022-11-02 20:47:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2499 states have (on average 1.8043217286914766) internal successors, (4509), 2506 states have internal predecessors, (4509), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66)
[2022-11-02 20:47:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4630 transitions.
[2022-11-02 20:47:26,539 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4630 transitions. Word has length 58
[2022-11-02 20:47:26,540 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:26,540 INFO L495 AbstractCegarLoop]: Abstraction has 2590 states and 4630 transitions.
[2022-11-02 20:47:26,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-11-02 20:47:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4630 transitions.
[2022-11-02 20:47:26,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2022-11-02 20:47:26,542 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:26,542 INFO L195 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]
[2022-11-02 20:47:26,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-11-02 20:47:26,543 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:26,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2056322511, now seen corresponding path program 1 times
[2022-11-02 20:47:26,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:26,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755450290]
[2022-11-02 20:47:26,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:26,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:26,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2022-11-02 20:47:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:26,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-11-02 20:47:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:26,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-11-02 20:47:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:26,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2022-11-02 20:47:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:26,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2022-11-02 20:47:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:47:26,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:26,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755450290]
[2022-11-02 20:47:26,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755450290] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:26,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:47:26,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-11-02 20:47:26,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000518276]
[2022-11-02 20:47:26,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:26,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-11-02 20:47:26,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:26,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-11-02 20:47:26,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-11-02 20:47:26,716 INFO L87 Difference]: Start difference. First operand 2590 states and 4630 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-11-02 20:47:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:27,636 INFO L93 Difference]: Finished difference Result 3579 states and 6048 transitions.
[2022-11-02 20:47:27,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-11-02 20:47:27,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58
[2022-11-02 20:47:27,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:27,650 INFO L225 Difference]: With dead ends: 3579
[2022-11-02 20:47:27,650 INFO L226 Difference]: Without dead ends: 3119
[2022-11-02 20:47:27,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272
[2022-11-02 20:47:27,654 INFO L413 NwaCegarLoop]: 4191 mSDtfsCounter, 4242 mSDsluCounter, 16356 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 20547 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:27,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4249 Valid, 20547 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-11-02 20:47:27,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states.
[2022-11-02 20:47:27,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 2889.
[2022-11-02 20:47:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2740 states have (on average 1.7682481751824817) internal successors, (4845), 2751 states have internal predecessors, (4845), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120)
[2022-11-02 20:47:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 5052 transitions.
[2022-11-02 20:47:27,762 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 5052 transitions. Word has length 58
[2022-11-02 20:47:27,762 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:27,763 INFO L495 AbstractCegarLoop]: Abstraction has 2889 states and 5052 transitions.
[2022-11-02 20:47:27,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-11-02 20:47:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 5052 transitions.
[2022-11-02 20:47:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2022-11-02 20:47:27,765 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:27,765 INFO L195 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]
[2022-11-02 20:47:27,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-11-02 20:47:27,765 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:27,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:27,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1158929233, now seen corresponding path program 1 times
[2022-11-02 20:47:27,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:27,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457095756]
[2022-11-02 20:47:27,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:27,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:27,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2022-11-02 20:47:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:27,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-11-02 20:47:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:27,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-11-02 20:47:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:27,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2022-11-02 20:47:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:27,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2022-11-02 20:47:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:47:27,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:27,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457095756]
[2022-11-02 20:47:27,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457095756] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:27,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:47:27,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-02 20:47:27,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100999991]
[2022-11-02 20:47:27,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:27,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:47:27,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:27,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:47:27,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:47:27,846 INFO L87 Difference]: Start difference. First operand 2889 states and 5052 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-11-02 20:47:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:28,665 INFO L93 Difference]: Finished difference Result 4253 states and 6998 transitions.
[2022-11-02 20:47:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-11-02 20:47:28,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58
[2022-11-02 20:47:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:28,681 INFO L225 Difference]: With dead ends: 4253
[2022-11-02 20:47:28,682 INFO L226 Difference]: Without dead ends: 3495
[2022-11-02 20:47:28,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132
[2022-11-02 20:47:28,687 INFO L413 NwaCegarLoop]: 4225 mSDtfsCounter, 4354 mSDsluCounter, 12183 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4377 SdHoareTripleChecker+Valid, 16408 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:28,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4377 Valid, 16408 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-11-02 20:47:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states.
[2022-11-02 20:47:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3290.
[2022-11-02 20:47:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3290 states, 3058 states have (on average 1.723675604970569) internal successors, (5271), 3078 states have internal predecessors, (5271), 136 states have call successors, (136), 83 states have call predecessors, (136), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179)
[2022-11-02 20:47:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 5586 transitions.
[2022-11-02 20:47:28,873 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 5586 transitions. Word has length 58
[2022-11-02 20:47:28,873 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:28,874 INFO L495 AbstractCegarLoop]: Abstraction has 3290 states and 5586 transitions.
[2022-11-02 20:47:28,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-11-02 20:47:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 5586 transitions.
[2022-11-02 20:47:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2022-11-02 20:47:28,879 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:28,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:28,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-11-02 20:47:28,880 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:28,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:28,881 INFO L85 PathProgramCache]: Analyzing trace with hash 747002154, now seen corresponding path program 1 times
[2022-11-02 20:47:28,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:28,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576995947]
[2022-11-02 20:47:28,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:28,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:28,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2022-11-02 20:47:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:28,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-11-02 20:47:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:28,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-11-02 20:47:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:29,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2022-11-02 20:47:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:29,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2022-11-02 20:47:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:29,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2022-11-02 20:47:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:29,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2022-11-02 20:47:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-11-02 20:47:29,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:29,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576995947]
[2022-11-02 20:47:29,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576995947] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:47:29,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037335549]
[2022-11-02 20:47:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:29,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:47:29,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:47:29,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:47:29,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-11-02 20:47:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:29,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-11-02 20:47:29,190 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:47:29,238 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2022-11-02 20:47:29,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:47:29,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037335549] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:29,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-11-02 20:47:29,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8
[2022-11-02 20:47:29,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18770921]
[2022-11-02 20:47:29,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:29,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:47:29,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:29,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:47:29,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-11-02 20:47:29,244 INFO L87 Difference]: Start difference. First operand 3290 states and 5586 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2022-11-02 20:47:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:29,503 INFO L93 Difference]: Finished difference Result 5496 states and 8712 transitions.
[2022-11-02 20:47:29,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:47:29,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93
[2022-11-02 20:47:29,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:29,526 INFO L225 Difference]: With dead ends: 5496
[2022-11-02 20:47:29,527 INFO L226 Difference]: Without dead ends: 4338
[2022-11-02 20:47:29,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-11-02 20:47:29,542 INFO L413 NwaCegarLoop]: 4229 mSDtfsCounter, 114 mSDsluCounter, 4108 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 8337 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:29,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 8337 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-11-02 20:47:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4338 states.
[2022-11-02 20:47:29,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4338 to 4338.
[2022-11-02 20:47:29,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4338 states, 3897 states have (on average 1.6440851937387735) internal successors, (6407), 3930 states have internal predecessors, (6407), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376)
[2022-11-02 20:47:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 7038 transitions.
[2022-11-02 20:47:29,851 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 7038 transitions. Word has length 93
[2022-11-02 20:47:29,852 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:29,853 INFO L495 AbstractCegarLoop]: Abstraction has 4338 states and 7038 transitions.
[2022-11-02 20:47:29,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2022-11-02 20:47:29,855 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 7038 transitions.
[2022-11-02 20:47:29,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2022-11-02 20:47:29,864 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:29,864 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:29,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-11-02 20:47:30,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2022-11-02 20:47:30,091 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:30,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash 385246456, now seen corresponding path program 1 times
[2022-11-02 20:47:30,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:30,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125157782]
[2022-11-02 20:47:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:30,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:30,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2022-11-02 20:47:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:30,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-11-02 20:47:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:30,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-11-02 20:47:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:30,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2022-11-02 20:47:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:30,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2022-11-02 20:47:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2022-11-02 20:47:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:30,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2022-11-02 20:47:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:30,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:30,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2022-11-02 20:47:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2022-11-02 20:47:30,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:30,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125157782]
[2022-11-02 20:47:30,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125157782] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:47:30,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498863819]
[2022-11-02 20:47:30,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:30,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:47:30,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:47:30,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:47:30,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-11-02 20:47:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:30,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-11-02 20:47:30,441 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:47:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2022-11-02 20:47:30,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:47:30,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498863819] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:30,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-11-02 20:47:30,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8
[2022-11-02 20:47:30,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559880154]
[2022-11-02 20:47:30,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:30,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:47:30,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:30,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:47:30,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-11-02 20:47:30,572 INFO L87 Difference]: Start difference. First operand 4338 states and 7038 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)
[2022-11-02 20:47:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:30,962 INFO L93 Difference]: Finished difference Result 8608 states and 13011 transitions.
[2022-11-02 20:47:30,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:47:30,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119
[2022-11-02 20:47:30,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:30,996 INFO L225 Difference]: With dead ends: 8608
[2022-11-02 20:47:30,997 INFO L226 Difference]: Without dead ends: 6405
[2022-11-02 20:47:31,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-11-02 20:47:31,008 INFO L413 NwaCegarLoop]: 4141 mSDtfsCounter, 4038 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4038 SdHoareTripleChecker+Valid, 4273 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:31,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4038 Valid, 4273 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-11-02 20:47:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6405 states.
[2022-11-02 20:47:31,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6405 to 6345.
[2022-11-02 20:47:31,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6345 states, 5510 states have (on average 1.561705989110708) internal successors, (8605), 5572 states have internal predecessors, (8605), 475 states have call successors, (475), 311 states have call predecessors, (475), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688)
[2022-11-02 20:47:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 9768 transitions.
[2022-11-02 20:47:31,474 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 9768 transitions. Word has length 119
[2022-11-02 20:47:31,475 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:31,475 INFO L495 AbstractCegarLoop]: Abstraction has 6345 states and 9768 transitions.
[2022-11-02 20:47:31,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)
[2022-11-02 20:47:31,475 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 9768 transitions.
[2022-11-02 20:47:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2022-11-02 20:47:31,488 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:31,489 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:31,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-11-02 20:47:31,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6
[2022-11-02 20:47:31,703 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:31,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:31,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1965387098, now seen corresponding path program 1 times
[2022-11-02 20:47:31,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:31,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354323776]
[2022-11-02 20:47:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:31,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2022-11-02 20:47:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:31,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-11-02 20:47:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:31,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-11-02 20:47:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:31,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2022-11-02 20:47:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:31,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2022-11-02 20:47:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:31,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2022-11-02 20:47:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:31,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2022-11-02 20:47:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:31,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:31,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2022-11-02 20:47:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:31,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:31,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2022-11-02 20:47:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked.
[2022-11-02 20:47:31,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:31,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354323776]
[2022-11-02 20:47:31,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354323776] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:47:31,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326418791]
[2022-11-02 20:47:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:31,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:47:31,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:47:31,859 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:47:31,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2022-11-02 20:47:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:31,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjunts are in the unsatisfiable core
[2022-11-02 20:47:31,987 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:47:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2022-11-02 20:47:32,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:47:32,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326418791] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:32,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-11-02 20:47:32,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8
[2022-11-02 20:47:32,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548563107]
[2022-11-02 20:47:32,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:32,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:47:32,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:32,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:47:32,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-11-02 20:47:32,039 INFO L87 Difference]: Start difference. First operand 6345 states and 9768 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9)
[2022-11-02 20:47:32,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:32,351 INFO L93 Difference]: Finished difference Result 9619 states and 14299 transitions.
[2022-11-02 20:47:32,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:47:32,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 135
[2022-11-02 20:47:32,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:32,386 INFO L225 Difference]: With dead ends: 9619
[2022-11-02 20:47:32,388 INFO L226 Difference]: Without dead ends: 6673
[2022-11-02 20:47:32,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-11-02 20:47:32,400 INFO L413 NwaCegarLoop]: 4132 mSDtfsCounter, 4059 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4059 SdHoareTripleChecker+Valid, 4272 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:32,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4059 Valid, 4272 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-11-02 20:47:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states.
[2022-11-02 20:47:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 6635.
[2022-11-02 20:47:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6635 states, 5768 states have (on average 1.535887656033287) internal successors, (8859), 5830 states have internal predecessors, (8859), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720)
[2022-11-02 20:47:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6635 states to 6635 states and 10060 transitions.
[2022-11-02 20:47:32,785 INFO L78 Accepts]: Start accepts. Automaton has 6635 states and 10060 transitions. Word has length 135
[2022-11-02 20:47:32,785 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:32,785 INFO L495 AbstractCegarLoop]: Abstraction has 6635 states and 10060 transitions.
[2022-11-02 20:47:32,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9)
[2022-11-02 20:47:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 6635 states and 10060 transitions.
[2022-11-02 20:47:32,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2022-11-02 20:47:32,799 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:32,800 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:32,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2022-11-02 20:47:33,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:47:33,015 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:33,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:33,016 INFO L85 PathProgramCache]: Analyzing trace with hash 946429697, now seen corresponding path program 1 times
[2022-11-02 20:47:33,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:33,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941353417]
[2022-11-02 20:47:33,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:33,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:33,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2022-11-02 20:47:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:33,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-11-02 20:47:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:33,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-11-02 20:47:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:33,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2022-11-02 20:47:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:33,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2022-11-02 20:47:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:33,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2022-11-02 20:47:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:33,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2022-11-02 20:47:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:33,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:33,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2022-11-02 20:47:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:33,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:33,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2022-11-02 20:47:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked.
[2022-11-02 20:47:33,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:33,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941353417]
[2022-11-02 20:47:33,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941353417] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:47:33,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422365385]
[2022-11-02 20:47:33,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:33,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:47:33,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:47:33,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:47:33,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2022-11-02 20:47:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:33,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjunts are in the unsatisfiable core
[2022-11-02 20:47:33,310 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:47:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2022-11-02 20:47:33,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:47:33,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422365385] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:33,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-11-02 20:47:33,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8
[2022-11-02 20:47:33,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38986004]
[2022-11-02 20:47:33,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:33,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:47:33,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:33,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:47:33,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-11-02 20:47:33,367 INFO L87 Difference]: Start difference. First operand 6635 states and 10060 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)
[2022-11-02 20:47:33,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:33,825 INFO L93 Difference]: Finished difference Result 9031 states and 13439 transitions.
[2022-11-02 20:47:33,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:47:33,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 136
[2022-11-02 20:47:33,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:33,850 INFO L225 Difference]: With dead ends: 9031
[2022-11-02 20:47:33,850 INFO L226 Difference]: Without dead ends: 6671
[2022-11-02 20:47:33,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-11-02 20:47:33,860 INFO L413 NwaCegarLoop]: 4217 mSDtfsCounter, 111 mSDsluCounter, 4099 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 8316 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:33,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 8316 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-11-02 20:47:33,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states.
[2022-11-02 20:47:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 6611.
[2022-11-02 20:47:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6611 states, 5744 states have (on average 1.5217618384401115) internal successors, (8741), 5806 states have internal predecessors, (8741), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720)
[2022-11-02 20:47:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6611 states to 6611 states and 9942 transitions.
[2022-11-02 20:47:34,216 INFO L78 Accepts]: Start accepts. Automaton has 6611 states and 9942 transitions. Word has length 136
[2022-11-02 20:47:34,216 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:34,217 INFO L495 AbstractCegarLoop]: Abstraction has 6611 states and 9942 transitions.
[2022-11-02 20:47:34,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)
[2022-11-02 20:47:34,217 INFO L276 IsEmpty]: Start isEmpty. Operand 6611 states and 9942 transitions.
[2022-11-02 20:47:34,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2022-11-02 20:47:34,229 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:34,230 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:34,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2022-11-02 20:47:34,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:47:34,451 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:34,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:34,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1815303137, now seen corresponding path program 1 times
[2022-11-02 20:47:34,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:34,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695683276]
[2022-11-02 20:47:34,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:34,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:34,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2022-11-02 20:47:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:34,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-11-02 20:47:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:34,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-11-02 20:47:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:34,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2022-11-02 20:47:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:34,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2022-11-02 20:47:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:34,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2022-11-02 20:47:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:34,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2022-11-02 20:47:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:34,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:34,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2022-11-02 20:47:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:34,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:34,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2022-11-02 20:47:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked.
[2022-11-02 20:47:34,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:34,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695683276]
[2022-11-02 20:47:34,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695683276] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:47:34,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688615034]
[2022-11-02 20:47:34,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:34,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:47:34,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:47:34,623 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:47:34,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2022-11-02 20:47:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:34,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-11-02 20:47:34,735 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:47:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-11-02 20:47:34,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:47:34,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688615034] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:34,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-11-02 20:47:34,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8
[2022-11-02 20:47:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742457023]
[2022-11-02 20:47:34,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:34,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:47:34,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:34,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:47:34,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-11-02 20:47:34,773 INFO L87 Difference]: Start difference. First operand 6611 states and 9942 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10)
[2022-11-02 20:47:35,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:35,043 INFO L93 Difference]: Finished difference Result 9935 states and 14498 transitions.
[2022-11-02 20:47:35,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:47:35,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 136
[2022-11-02 20:47:35,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:35,070 INFO L225 Difference]: With dead ends: 9935
[2022-11-02 20:47:35,070 INFO L226 Difference]: Without dead ends: 5993
[2022-11-02 20:47:35,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-11-02 20:47:35,084 INFO L413 NwaCegarLoop]: 4112 mSDtfsCounter, 4089 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4089 SdHoareTripleChecker+Valid, 4136 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:35,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4089 Valid, 4136 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-11-02 20:47:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states.
[2022-11-02 20:47:35,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5763.
[2022-11-02 20:47:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5763 states, 5062 states have (on average 1.5205452390359542) internal successors, (7697), 5108 states have internal predecessors, (7697), 393 states have call successors, (393), 275 states have call predecessors, (393), 306 states have return successors, (510), 387 states have call predecessors, (510), 391 states have call successors, (510)
[2022-11-02 20:47:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 8600 transitions.
[2022-11-02 20:47:35,388 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 8600 transitions. Word has length 136
[2022-11-02 20:47:35,389 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:35,389 INFO L495 AbstractCegarLoop]: Abstraction has 5763 states and 8600 transitions.
[2022-11-02 20:47:35,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10)
[2022-11-02 20:47:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 8600 transitions.
[2022-11-02 20:47:35,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2022-11-02 20:47:35,397 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:35,398 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:35,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2022-11-02 20:47:35,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2022-11-02 20:47:35,623 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:35,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:35,624 INFO L85 PathProgramCache]: Analyzing trace with hash 874736092, now seen corresponding path program 1 times
[2022-11-02 20:47:35,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:35,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537547502]
[2022-11-02 20:47:35,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:35,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:35,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2022-11-02 20:47:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:35,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-11-02 20:47:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:35,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-11-02 20:47:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:35,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2022-11-02 20:47:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:35,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2022-11-02 20:47:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:35,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2022-11-02 20:47:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:35,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2022-11-02 20:47:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:35,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:35,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2022-11-02 20:47:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:35,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:35,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122
[2022-11-02 20:47:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked.
[2022-11-02 20:47:35,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:35,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537547502]
[2022-11-02 20:47:35,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537547502] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:47:35,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210615599]
[2022-11-02 20:47:35,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:35,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:47:35,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:47:35,839 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:47:35,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2022-11-02 20:47:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:35,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core
[2022-11-02 20:47:35,971 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:47:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked.
[2022-11-02 20:47:36,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:47:36,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210615599] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:36,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-11-02 20:47:36,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10
[2022-11-02 20:47:36,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591597521]
[2022-11-02 20:47:36,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:36,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-11-02 20:47:36,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:36,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-11-02 20:47:36,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2022-11-02 20:47:36,089 INFO L87 Difference]: Start difference. First operand 5763 states and 8600 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2022-11-02 20:47:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:36,446 INFO L93 Difference]: Finished difference Result 7191 states and 10479 transitions.
[2022-11-02 20:47:36,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:47:36,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137
[2022-11-02 20:47:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:36,461 INFO L225 Difference]: With dead ends: 7191
[2022-11-02 20:47:36,462 INFO L226 Difference]: Without dead ends: 4833
[2022-11-02 20:47:36,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2022-11-02 20:47:36,469 INFO L413 NwaCegarLoop]: 4090 mSDtfsCounter, 4107 mSDsluCounter, 8071 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4115 SdHoareTripleChecker+Valid, 12161 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:36,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4115 Valid, 12161 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-11-02 20:47:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states.
[2022-11-02 20:47:36,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4821.
[2022-11-02 20:47:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4821 states, 4302 states have (on average 1.5488145048814506) internal successors, (6663), 4330 states have internal predecessors, (6663), 297 states have call successors, (297), 205 states have call predecessors, (297), 220 states have return successors, (354), 289 states have call predecessors, (354), 295 states have call successors, (354)
[2022-11-02 20:47:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4821 states to 4821 states and 7314 transitions.
[2022-11-02 20:47:36,715 INFO L78 Accepts]: Start accepts. Automaton has 4821 states and 7314 transitions. Word has length 137
[2022-11-02 20:47:36,716 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:36,716 INFO L495 AbstractCegarLoop]: Abstraction has 4821 states and 7314 transitions.
[2022-11-02 20:47:36,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2022-11-02 20:47:36,716 INFO L276 IsEmpty]: Start isEmpty. Operand 4821 states and 7314 transitions.
[2022-11-02 20:47:36,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2022-11-02 20:47:36,721 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:36,722 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:36,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2022-11-02 20:47:36,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:47:36,947 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:36,948 INFO L85 PathProgramCache]: Analyzing trace with hash -991972582, now seen corresponding path program 1 times
[2022-11-02 20:47:36,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:36,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482121348]
[2022-11-02 20:47:36,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:36,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:37,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2022-11-02 20:47:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:37,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-11-02 20:47:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:37,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-11-02 20:47:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:37,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2022-11-02 20:47:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:37,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2022-11-02 20:47:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:37,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2022-11-02 20:47:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:37,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2022-11-02 20:47:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:37,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2022-11-02 20:47:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:37,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:37,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122
[2022-11-02 20:47:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked.
[2022-11-02 20:47:37,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:37,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482121348]
[2022-11-02 20:47:37,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482121348] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:47:37,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945951940]
[2022-11-02 20:47:37,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:37,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:47:37,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:47:37,112 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:47:37,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2022-11-02 20:47:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:37,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core
[2022-11-02 20:47:37,231 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:47:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked.
[2022-11-02 20:47:37,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:47:37,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945951940] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:37,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-11-02 20:47:37,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10
[2022-11-02 20:47:37,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408830839]
[2022-11-02 20:47:37,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:37,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-11-02 20:47:37,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:37,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-11-02 20:47:37,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2022-11-02 20:47:37,334 INFO L87 Difference]: Start difference. First operand 4821 states and 7314 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2022-11-02 20:47:37,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:37,760 INFO L93 Difference]: Finished difference Result 7162 states and 10301 transitions.
[2022-11-02 20:47:37,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-11-02 20:47:37,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137
[2022-11-02 20:47:37,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:37,775 INFO L225 Difference]: With dead ends: 7162
[2022-11-02 20:47:37,775 INFO L226 Difference]: Without dead ends: 4769
[2022-11-02 20:47:37,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2022-11-02 20:47:37,783 INFO L413 NwaCegarLoop]: 4102 mSDtfsCounter, 4128 mSDsluCounter, 8066 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 12168 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:37,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4136 Valid, 12168 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-11-02 20:47:37,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states.
[2022-11-02 20:47:37,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 3795.
[2022-11-02 20:47:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3795 states, 3488 states have (on average 1.6023509174311927) internal successors, (5589), 3504 states have internal predecessors, (5589), 175 states have call successors, (175), 123 states have call predecessors, (175), 130 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203)
[2022-11-02 20:47:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3795 states to 3795 states and 5967 transitions.
[2022-11-02 20:47:37,979 INFO L78 Accepts]: Start accepts. Automaton has 3795 states and 5967 transitions. Word has length 137
[2022-11-02 20:47:37,979 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:37,979 INFO L495 AbstractCegarLoop]: Abstraction has 3795 states and 5967 transitions.
[2022-11-02 20:47:37,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2022-11-02 20:47:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3795 states and 5967 transitions.
[2022-11-02 20:47:37,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2022-11-02 20:47:37,983 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:37,984 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:38,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2022-11-02 20:47:38,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:47:38,195 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:38,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:38,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1995852316, now seen corresponding path program 1 times
[2022-11-02 20:47:38,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:38,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374731336]
[2022-11-02 20:47:38,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:38,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:38,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2022-11-02 20:47:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:38,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-11-02 20:47:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:38,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-11-02 20:47:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:38,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2022-11-02 20:47:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:38,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2022-11-02 20:47:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:38,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2022-11-02 20:47:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:38,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2022-11-02 20:47:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:38,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:38,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2022-11-02 20:47:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:38,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:38,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122
[2022-11-02 20:47:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked.
[2022-11-02 20:47:38,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:38,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374731336]
[2022-11-02 20:47:38,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374731336] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:47:38,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006034551]
[2022-11-02 20:47:38,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:38,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:47:38,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:47:38,367 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:47:38,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2022-11-02 20:47:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:38,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-11-02 20:47:38,475 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:47:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked.
[2022-11-02 20:47:38,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:47:38,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006034551] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:38,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-11-02 20:47:38,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7
[2022-11-02 20:47:38,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276564339]
[2022-11-02 20:47:38,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:38,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-11-02 20:47:38,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:38,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-11-02 20:47:38,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-11-02 20:47:38,511 INFO L87 Difference]: Start difference. First operand 3795 states and 5967 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2022-11-02 20:47:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:38,759 INFO L93 Difference]: Finished difference Result 4934 states and 7353 transitions.
[2022-11-02 20:47:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-11-02 20:47:38,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137
[2022-11-02 20:47:38,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:38,858 INFO L225 Difference]: With dead ends: 4934
[2022-11-02 20:47:38,858 INFO L226 Difference]: Without dead ends: 3270
[2022-11-02 20:47:38,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2022-11-02 20:47:38,863 INFO L413 NwaCegarLoop]: 4102 mSDtfsCounter, 48 mSDsluCounter, 12315 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 16417 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:38,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 16417 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-11-02 20:47:38,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states.
[2022-11-02 20:47:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3234.
[2022-11-02 20:47:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 3034 states have (on average 1.654911008569545) internal successors, (5021), 3046 states have internal predecessors, (5021), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121)
[2022-11-02 20:47:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 5254 transitions.
[2022-11-02 20:47:39,093 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 5254 transitions. Word has length 137
[2022-11-02 20:47:39,093 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:39,094 INFO L495 AbstractCegarLoop]: Abstraction has 3234 states and 5254 transitions.
[2022-11-02 20:47:39,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2022-11-02 20:47:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 5254 transitions.
[2022-11-02 20:47:39,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2022-11-02 20:47:39,097 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:39,098 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:39,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2022-11-02 20:47:39,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2022-11-02 20:47:39,311 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:39,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:39,312 INFO L85 PathProgramCache]: Analyzing trace with hash 688947232, now seen corresponding path program 1 times
[2022-11-02 20:47:39,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:39,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21656695]
[2022-11-02 20:47:39,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:39,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:39,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2022-11-02 20:47:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:39,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-11-02 20:47:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:39,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-11-02 20:47:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:39,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2022-11-02 20:47:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:39,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2022-11-02 20:47:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:39,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2022-11-02 20:47:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:39,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2022-11-02 20:47:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:39,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:39,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2022-11-02 20:47:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:39,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:39,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122
[2022-11-02 20:47:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2022-11-02 20:47:39,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:39,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21656695]
[2022-11-02 20:47:39,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21656695] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:47:39,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986626176]
[2022-11-02 20:47:39,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:39,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:47:39,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:47:39,494 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:47:39,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2022-11-02 20:47:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:39,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-11-02 20:47:39,616 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:47:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2022-11-02 20:47:39,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:47:39,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986626176] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:39,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-11-02 20:47:39,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7
[2022-11-02 20:47:39,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94831024]
[2022-11-02 20:47:39,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:39,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-11-02 20:47:39,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:39,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-11-02 20:47:39,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-11-02 20:47:39,658 INFO L87 Difference]: Start difference. First operand 3234 states and 5254 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2022-11-02 20:47:39,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:39,923 INFO L93 Difference]: Finished difference Result 4365 states and 6615 transitions.
[2022-11-02 20:47:39,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-11-02 20:47:39,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137
[2022-11-02 20:47:39,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:39,934 INFO L225 Difference]: With dead ends: 4365
[2022-11-02 20:47:39,934 INFO L226 Difference]: Without dead ends: 3262
[2022-11-02 20:47:39,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2022-11-02 20:47:39,939 INFO L413 NwaCegarLoop]: 4101 mSDtfsCounter, 10 mSDsluCounter, 12302 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16403 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:39,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 16403 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-11-02 20:47:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states.
[2022-11-02 20:47:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3246.
[2022-11-02 20:47:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 3046 states have (on average 1.6454366382140513) internal successors, (5012), 3058 states have internal predecessors, (5012), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121)
[2022-11-02 20:47:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 5245 transitions.
[2022-11-02 20:47:40,154 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 5245 transitions. Word has length 137
[2022-11-02 20:47:40,154 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:40,154 INFO L495 AbstractCegarLoop]: Abstraction has 3246 states and 5245 transitions.
[2022-11-02 20:47:40,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2022-11-02 20:47:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 5245 transitions.
[2022-11-02 20:47:40,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2022-11-02 20:47:40,167 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:40,167 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:40,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2022-11-02 20:47:40,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2022-11-02 20:47:40,395 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:40,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:40,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1312364636, now seen corresponding path program 1 times
[2022-11-02 20:47:40,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:40,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72265865]
[2022-11-02 20:47:40,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:40,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:40,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2022-11-02 20:47:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:40,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-11-02 20:47:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:40,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-11-02 20:47:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:40,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2022-11-02 20:47:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:40,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2022-11-02 20:47:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:40,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2022-11-02 20:47:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:40,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2022-11-02 20:47:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:40,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:40,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2022-11-02 20:47:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:40,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:40,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122
[2022-11-02 20:47:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2022-11-02 20:47:40,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:40,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72265865]
[2022-11-02 20:47:40,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72265865] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:40,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:47:40,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-02 20:47:40,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020185312]
[2022-11-02 20:47:40,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:40,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:47:40,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:40,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:47:40,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:47:40,611 INFO L87 Difference]: Start difference. First operand 3246 states and 5245 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9)
[2022-11-02 20:47:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:41,426 INFO L93 Difference]: Finished difference Result 4206 states and 6319 transitions.
[2022-11-02 20:47:41,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-11-02 20:47:41,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137
[2022-11-02 20:47:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:41,438 INFO L225 Difference]: With dead ends: 4206
[2022-11-02 20:47:41,439 INFO L226 Difference]: Without dead ends: 4203
[2022-11-02 20:47:41,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156
[2022-11-02 20:47:41,444 INFO L413 NwaCegarLoop]: 4172 mSDtfsCounter, 4444 mSDsluCounter, 12174 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4467 SdHoareTripleChecker+Valid, 16346 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:41,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4467 Valid, 16346 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-11-02 20:47:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states.
[2022-11-02 20:47:41,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3622.
[2022-11-02 20:47:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 3356 states have (on average 1.598331346841478) internal successors, (5364), 3372 states have internal predecessors, (5364), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163)
[2022-11-02 20:47:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 5673 transitions.
[2022-11-02 20:47:41,659 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 5673 transitions. Word has length 137
[2022-11-02 20:47:41,659 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:41,660 INFO L495 AbstractCegarLoop]: Abstraction has 3622 states and 5673 transitions.
[2022-11-02 20:47:41,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9)
[2022-11-02 20:47:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 5673 transitions.
[2022-11-02 20:47:41,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2022-11-02 20:47:41,663 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:41,664 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:41,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-11-02 20:47:41,664 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:41,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1384992052, now seen corresponding path program 1 times
[2022-11-02 20:47:41,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:41,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873606306]
[2022-11-02 20:47:41,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:41,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:41,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2022-11-02 20:47:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:41,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-11-02 20:47:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:41,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-11-02 20:47:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:41,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2022-11-02 20:47:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:41,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2022-11-02 20:47:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:41,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2022-11-02 20:47:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:41,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2022-11-02 20:47:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:41,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:41,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2022-11-02 20:47:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:41,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-11-02 20:47:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:41,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122
[2022-11-02 20:47:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked.
[2022-11-02 20:47:41,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:41,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873606306]
[2022-11-02 20:47:41,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873606306] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:41,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:47:41,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-11-02 20:47:41,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639102533]
[2022-11-02 20:47:41,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:41,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-11-02 20:47:41,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:41,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-11-02 20:47:41,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:47:41,765 INFO L87 Difference]: Start difference. First operand 3622 states and 5673 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8)
[2022-11-02 20:47:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:42,240 INFO L93 Difference]: Finished difference Result 4845 states and 7161 transitions.
[2022-11-02 20:47:42,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-11-02 20:47:42,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141
[2022-11-02 20:47:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:42,253 INFO L225 Difference]: With dead ends: 4845
[2022-11-02 20:47:42,253 INFO L226 Difference]: Without dead ends: 3985
[2022-11-02 20:47:42,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:47:42,257 INFO L413 NwaCegarLoop]: 4150 mSDtfsCounter, 142 mSDsluCounter, 12149 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 16299 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:42,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 16299 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-11-02 20:47:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states.
[2022-11-02 20:47:42,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3624.
[2022-11-02 20:47:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 3358 states have (on average 1.5979749851101845) internal successors, (5366), 3374 states have internal predecessors, (5366), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163)
[2022-11-02 20:47:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 5675 transitions.
[2022-11-02 20:47:42,535 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 5675 transitions. Word has length 141
[2022-11-02 20:47:42,536 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:42,536 INFO L495 AbstractCegarLoop]: Abstraction has 3624 states and 5675 transitions.
[2022-11-02 20:47:42,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8)
[2022-11-02 20:47:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 5675 transitions.
[2022-11-02 20:47:42,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2022-11-02 20:47:42,539 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:42,540 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:42,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2022-11-02 20:47:42,540 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:42,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:42,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1244161439, now seen corresponding path program 1 times
[2022-11-02 20:47:42,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:42,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919705038]
[2022-11-02 20:47:42,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:42,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 20:47:42,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-02 20:47:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 20:47:42,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-11-02 20:47:42,636 INFO L359 BasicCegarLoop]: Counterexample is feasible
[2022-11-02 20:47:42,637 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining)
[2022-11-02 20:47:42,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining)
[2022-11-02 20:47:42,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2022-11-02 20:47:42,643 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:42,650 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-11-02 20:47:42,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:47:42 BoogieIcfgContainer
[2022-11-02 20:47:42,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-11-02 20:47:42,773 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2022-11-02 20:47:42,773 INFO L271 PluginConnector]: Initializing Witness Printer...
[2022-11-02 20:47:42,773 INFO L275 PluginConnector]: Witness Printer initialized
[2022-11-02 20:47:42,774 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:22" (3/4) ...
[2022-11-02 20:47:42,776 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2022-11-02 20:47:42,871 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/witness.graphml
[2022-11-02 20:47:42,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2022-11-02 20:47:42,872 INFO L158 Benchmark]: Toolchain (without parser) took 35109.72ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 76.2MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 268.8MB. Max. memory is 16.1GB.
[2022-11-02 20:47:42,872 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 90.2MB. Free memory was 42.3MB in the beginning and 42.3MB in the end (delta: 49.8kB). There was no memory consumed. Max. memory is 16.1GB.
[2022-11-02 20:47:42,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4150.82ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 75.8MB in the beginning and 80.2MB in the end (delta: -4.4MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB.
[2022-11-02 20:47:42,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 554.10ms. Allocated memory was 192.9MB in the beginning and 264.2MB in the end (delta: 71.3MB). Free memory was 80.2MB in the beginning and 132.5MB in the end (delta: -52.3MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB.
[2022-11-02 20:47:42,873 INFO L158 Benchmark]: Boogie Preprocessor took 538.16ms. Allocated memory is still 264.2MB. Free memory was 132.5MB in the beginning and 104.6MB in the end (delta: 27.9MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB.
[2022-11-02 20:47:42,874 INFO L158 Benchmark]: RCFGBuilder took 9075.68ms. Allocated memory was 264.2MB in the beginning and 784.3MB in the end (delta: 520.1MB). Free memory was 104.6MB in the beginning and 490.0MB in the end (delta: -385.4MB). Peak memory consumption was 333.4MB. Max. memory is 16.1GB.
[2022-11-02 20:47:42,874 INFO L158 Benchmark]: TraceAbstraction took 20681.51ms. Allocated memory was 784.3MB in the beginning and 1.9GB in the end (delta: 1.1GB). Free memory was 489.0MB in the beginning and 1.6GB in the end (delta: -1.1GB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB.
[2022-11-02 20:47:42,874 INFO L158 Benchmark]: Witness Printer took 98.23ms. Allocated memory is still 1.9GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2022-11-02 20:47:42,876 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.22ms. Allocated memory is still 90.2MB. Free memory was 42.3MB in the beginning and 42.3MB in the end (delta: 49.8kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 4150.82ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 75.8MB in the beginning and 80.2MB in the end (delta: -4.4MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 554.10ms. Allocated memory was 192.9MB in the beginning and 264.2MB in the end (delta: 71.3MB). Free memory was 80.2MB in the beginning and 132.5MB in the end (delta: -52.3MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 538.16ms. Allocated memory is still 264.2MB. Free memory was 132.5MB in the beginning and 104.6MB in the end (delta: 27.9MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB.
* RCFGBuilder took 9075.68ms. Allocated memory was 264.2MB in the beginning and 784.3MB in the end (delta: 520.1MB). Free memory was 104.6MB in the beginning and 490.0MB in the end (delta: -385.4MB). Peak memory consumption was 333.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 20681.51ms. Allocated memory was 784.3MB in the beginning and 1.9GB in the end (delta: 1.1GB). Free memory was 489.0MB in the beginning and 1.6GB in the end (delta: -1.1GB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB.
* Witness Printer took 98.23ms. Allocated memory is still 1.9GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. 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
- CounterExampleResult [Line: 11173]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L33] int d= 4;
[L34] int c= 3;
[L35] int e= 5;
[L36] int a= 1;
[L37] int f= 6;
[L38] int b= 2;
[L40] int a9 = 18;
[L41] int a27 = 1;
[L42] int a2 = 10;
[L43] int a16 = 1;
[L44] int a15 = 1;
[L45] int a12 = 4;
[L46] int a25 = 1;
[L47] int a20 = 5;
[L11177] int m_pc = 0;
[L11178] int t1_pc = 0;
[L11179] int m_st ;
[L11180] int t1_st ;
[L11181] int m_i ;
[L11182] int t1_i ;
[L11183] int M_E = 2;
[L11184] int T1_E = 2;
[L11185] int E_M = 2;
[L11186] int E_1 = 2;
[L11190] int token ;
[L11192] int local ;
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0]
[L11651] COND FALSE !(__VERIFIER_nondet_int())
[L11654] CALL main2()
[L11638] int __retres1 ;
[L11642] CALL init_model()
[L11553] m_i = 1
[L11554] t1_i = 1
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11642] RET init_model()
[L11643] CALL start_simulation()
[L11579] int kernel_st ;
[L11580] int tmp ;
[L11581] int tmp___0 ;
[L11585] kernel_st = 0
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11586] FCALL update_channels()
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11587] CALL init_threads()
[L11335] COND TRUE m_i == 1
[L11336] m_st = 0
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11340] COND TRUE t1_i == 1
[L11341] t1_st = 0
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11587] RET init_threads()
[L11588] CALL fire_delta_events()
VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11424] COND FALSE !(M_E == 0)
VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11429] COND FALSE !(T1_E == 0)
VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11434] COND FALSE !(E_M == 0)
VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11439] COND FALSE !(E_1 == 0)
VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11588] RET fire_delta_events()
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11589] CALL activate_threads()
VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11477] int tmp ;
[L11478] int tmp___0 ;
[L11482] CALL, EXPR is_master_triggered()
[L11286] int __retres1 ;
VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11289] COND FALSE !(m_pc == 1)
VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11299] __retres1 = 0
VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11301] return (__retres1);
VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11482] RET, EXPR is_master_triggered()
[L11482] tmp = is_master_triggered()
[L11484] COND FALSE !(\read(tmp))
VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0]
[L11490] CALL, EXPR is_transmit1_triggered()
[L11305] int __retres1 ;
VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11308] COND FALSE !(t1_pc == 1)
VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11318] __retres1 = 0
VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11320] return (__retres1);
VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11490] RET, EXPR is_transmit1_triggered()
[L11490] tmp___0 = is_transmit1_triggered()
[L11492] COND FALSE !(\read(tmp___0))
VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0]
[L11589] RET activate_threads()
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11590] CALL reset_delta_events()
VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11452] COND FALSE !(M_E == 1)
VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11457] COND FALSE !(T1_E == 1)
VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11462] COND FALSE !(E_M == 1)
VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11467] COND FALSE !(E_1 == 1)
VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11590] RET reset_delta_events()
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11593] COND TRUE 1
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11596] kernel_st = 1
[L11597] CALL eval()
[L11371] int tmp ;
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11375] COND TRUE 1
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11378] CALL, EXPR exists_runnable_thread()
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11350] int __retres1 ;
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11353] COND TRUE m_st == 0
[L11354] __retres1 = 1
VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11366] return (__retres1);
VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11378] RET, EXPR exists_runnable_thread()
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L11378] tmp = exists_runnable_thread()
[L11380] COND TRUE \read(tmp)
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0]
[L11385] COND TRUE m_st == 0
[L11386] int tmp_ndt_1;
[L11387] tmp_ndt_1 = __VERIFIER_nondet_int()
[L11388] COND FALSE !(\read(tmp_ndt_1))
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0]
[L11399] COND TRUE t1_st == 0
[L11400] int tmp_ndt_2;
[L11401] tmp_ndt_2 = __VERIFIER_nondet_int()
[L11402] COND TRUE \read(tmp_ndt_2)
[L11404] t1_st = 1
[L11405] CALL transmit1()
[L11253] COND TRUE t1_pc == 0
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0]
[L11264] COND TRUE 1
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0]
[L11266] t1_pc = 1
[L11267] t1_st = 2
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L11405] RET transmit1()
[L11375] COND TRUE 1
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0]
[L11378] CALL, EXPR exists_runnable_thread()
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L11350] int __retres1 ;
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L11353] COND TRUE m_st == 0
[L11354] __retres1 = 1
VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L11366] return (__retres1);
VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L11378] RET, EXPR exists_runnable_thread()
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0]
[L11378] tmp = exists_runnable_thread()
[L11380] COND TRUE \read(tmp)
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0]
[L11385] COND TRUE m_st == 0
[L11386] int tmp_ndt_1;
[L11387] tmp_ndt_1 = __VERIFIER_nondet_int()
[L11388] COND TRUE \read(tmp_ndt_1)
[L11390] m_st = 1
[L11391] CALL master()
[L11195] int tmp_var = __VERIFIER_nondet_int();
[L11197] COND TRUE m_pc == 0
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0]
[L11208] COND TRUE 1
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0]
[L11211] token = __VERIFIER_nondet_int()
[L11212] local = token
[L11213] E_1 = 1
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0]
[L11214] CALL immediate_notify()
VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L11506] CALL activate_threads()
VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L11477] int tmp ;
[L11478] int tmp___0 ;
[L11482] CALL, EXPR is_master_triggered()
[L11286] int __retres1 ;
VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L11289] COND FALSE !(m_pc == 1)
VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L11299] __retres1 = 0
VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L11301] return (__retres1);
VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L11482] RET, EXPR is_master_triggered()
[L11482] tmp = is_master_triggered()
[L11484] COND FALSE !(\read(tmp))
VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0]
[L11490] CALL, EXPR is_transmit1_triggered()
[L11305] int __retres1 ;
VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L11308] COND TRUE t1_pc == 1
VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L11309] COND TRUE E_1 == 1
[L11310] __retres1 = 1
VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L11320] return (__retres1);
VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L11490] RET, EXPR is_transmit1_triggered()
[L11490] tmp___0 = is_transmit1_triggered()
[L11492] COND TRUE \read(tmp___0)
[L11493] t1_st = 0
VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0]
[L11506] RET activate_threads()
VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0]
[L11214] RET immediate_notify()
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0]
[L11215] E_1 = 2
[L11216] m_pc = 1
[L11217] m_st = 2
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0]
[L11391] RET master()
[L11399] COND TRUE t1_st == 0
[L11400] int tmp_ndt_2;
[L11401] tmp_ndt_2 = __VERIFIER_nondet_int()
[L11402] COND TRUE \read(tmp_ndt_2)
[L11404] t1_st = 1
[L11405] CALL transmit1()
[L11253] COND FALSE !(t1_pc == 0)
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0]
[L11256] COND TRUE t1_pc == 1
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0]
[L11272] token += 1
[L11273] E_M = 1
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1]
[L11274] CALL immediate_notify()
VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1]
[L11506] CALL activate_threads()
VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1]
[L11477] int tmp ;
[L11478] int tmp___0 ;
[L11482] CALL, EXPR is_master_triggered()
[L11286] int __retres1 ;
VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1]
[L11289] COND TRUE m_pc == 1
VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1]
[L11290] COND TRUE E_M == 1
[L11291] __retres1 = 1
VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1]
[L11301] return (__retres1);
VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1]
[L11482] RET, EXPR is_master_triggered()
[L11482] tmp = is_master_triggered()
[L11484] COND TRUE \read(tmp)
[L11485] m_st = 0
VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1]
[L11490] CALL, EXPR is_transmit1_triggered()
[L11305] int __retres1 ;
VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1]
[L11308] COND TRUE t1_pc == 1
VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1]
[L11309] COND FALSE !(E_1 == 1)
VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1]
[L11318] __retres1 = 0
VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1]
[L11320] return (__retres1);
VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1]
[L11490] RET, EXPR is_transmit1_triggered()
[L11490] tmp___0 = is_transmit1_triggered()
[L11492] COND FALSE !(\read(tmp___0))
VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1]
[L11506] RET activate_threads()
VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1]
[L11274] RET immediate_notify()
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1]
[L11275] E_M = 2
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1]
[L11264] COND TRUE 1
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1]
[L11266] t1_pc = 1
[L11267] t1_st = 2
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1]
[L11405] RET transmit1()
[L11375] COND TRUE 1
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1]
[L11378] CALL, EXPR exists_runnable_thread()
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1]
[L11350] int __retres1 ;
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1]
[L11353] COND TRUE m_st == 0
[L11354] __retres1 = 1
VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1]
[L11366] return (__retres1);
VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1]
[L11378] RET, EXPR exists_runnable_thread()
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1]
[L11378] tmp = exists_runnable_thread()
[L11380] COND TRUE \read(tmp)
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1]
[L11385] COND TRUE m_st == 0
[L11386] int tmp_ndt_1;
[L11387] tmp_ndt_1 = __VERIFIER_nondet_int()
[L11388] COND TRUE \read(tmp_ndt_1)
[L11390] m_st = 1
[L11391] CALL master()
[L11195] int tmp_var = __VERIFIER_nondet_int();
[L11197] COND FALSE !(m_pc == 0)
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1]
[L11200] COND TRUE m_pc == 1
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1]
[L11222] COND FALSE !(token != local + 1)
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1]
[L11227] COND TRUE tmp_var <= 5
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1]
[L11228] COND TRUE tmp_var >= 5
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1]
[L11233] COND TRUE tmp_var <= 5
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1]
[L11234] COND TRUE tmp_var >= 5
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1]
[L11235] COND TRUE tmp_var == 5
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1]
[L11236] CALL error()
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1]
[L11173] reach_error()
VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1]
- UnprovableResult [Line: 11088]: Unable to prove that call to reach_error is unreachable
Unable to prove that call to reach_error is unreachable
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 8 procedures, 2298 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 20.5s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46867 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46759 mSDsluCounter, 213808 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147255 mSDsCounter, 543 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3724 IncrementalHoareTripleChecker+Invalid, 4267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 543 mSolverCounterUnsat, 66553 mSDtfsCounter, 3724 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1605 GetRequests, 1460 SyntacticMatches, 4 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6635occurred in iteration=8, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 3064 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 3044 NumberOfCodeBlocks, 3044 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2877 ConstructedInterpolants, 0 QuantifiedInterpolants, 4619 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3878 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 1302/1472 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2022-11-02 20:47:42,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aec73d2a-f96f-4009-8e61-04dc679d040d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE