./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab01c7-3ecb-4a31-8728-e6552a839807/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab01c7-3ecb-4a31-8728-e6552a839807/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_2bab01c7-3ecb-4a31-8728-e6552a839807/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab01c7-3ecb-4a31-8728-e6552a839807/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab01c7-3ecb-4a31-8728-e6552a839807/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_2bab01c7-3ecb-4a31-8728-e6552a839807/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 db1e722f73dbd7795cdbaca4c816f6c8a0f90138145d9f90bf0f222b7dd371eb --- 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:14:15,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:14:15,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:14:15,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:14:15,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:14:15,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:14:15,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:14:15,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:14:15,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:14:15,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:14:15,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:14:15,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:14:15,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:14:15,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:14:15,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:14:15,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:14:15,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:14:15,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:14:15,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:14:15,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:14:15,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:14:15,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:14:15,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:14:15,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:14:15,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:14:15,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:14:15,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:14:15,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:14:15,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:14:15,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:14:15,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:14:15,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:14:15,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:14:15,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:14:15,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:14:15,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:14:15,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:14:15,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:14:15,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:14:15,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:14:15,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:14:15,775 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab01c7-3ecb-4a31-8728-e6552a839807/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:14:15,799 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:14:15,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:14:15,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:14:15,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:14:15,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:14:15,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:14:15,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:14:15,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:14:15,803 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:14:15,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:14:15,803 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:14:15,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:14:15,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:14:15,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:14:15,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:14:15,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:14:15,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:14:15,805 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:14:15,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:14:15,806 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:14:15,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:14:15,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:14:15,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:14:15,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:14:15,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:14:15,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:14:15,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:14:15,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:14:15,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:14:15,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:14:15,809 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:14:15,809 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:14:15,810 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:14:15,810 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_2bab01c7-3ecb-4a31-8728-e6552a839807/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_2bab01c7-3ecb-4a31-8728-e6552a839807/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 -> db1e722f73dbd7795cdbaca4c816f6c8a0f90138145d9f90bf0f222b7dd371eb [2022-11-02 20:14:16,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:14:16,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:14:16,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:14:16,163 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:14:16,164 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:14:16,166 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab01c7-3ecb-4a31-8728-e6552a839807/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-11-02 20:14:16,255 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab01c7-3ecb-4a31-8728-e6552a839807/bin/uautomizer-Dbtcem3rbc/data/cd0366372/c5b5a39d8ded40fd9863d67b0998ee21/FLAGa35888b06 [2022-11-02 20:14:16,872 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:14:16,874 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab01c7-3ecb-4a31-8728-e6552a839807/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-11-02 20:14:16,902 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab01c7-3ecb-4a31-8728-e6552a839807/bin/uautomizer-Dbtcem3rbc/data/cd0366372/c5b5a39d8ded40fd9863d67b0998ee21/FLAGa35888b06 [2022-11-02 20:14:17,166 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab01c7-3ecb-4a31-8728-e6552a839807/bin/uautomizer-Dbtcem3rbc/data/cd0366372/c5b5a39d8ded40fd9863d67b0998ee21 [2022-11-02 20:14:17,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:14:17,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:14:17,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:14:17,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:14:17,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:14:17,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:14:17" (1/1) ... [2022-11-02 20:14:17,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b525be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:17, skipping insertion in model container [2022-11-02 20:14:17,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:14:17" (1/1) ... [2022-11-02 20:14:17,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:14:17,252 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:14:17,605 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_2bab01c7-3ecb-4a31-8728-e6552a839807/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2022-11-02 20:14:17,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:14:17,631 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:14:17,736 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_2bab01c7-3ecb-4a31-8728-e6552a839807/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2022-11-02 20:14:17,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:14:17,761 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:14:17,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:17 WrapperNode [2022-11-02 20:14:17,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:14:17,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:14:17,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:14:17,765 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:14:17,774 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:14:17" (1/1) ... [2022-11-02 20:14:17,802 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:14:17" (1/1) ... [2022-11-02 20:14:17,857 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 423 [2022-11-02 20:14:17,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:14:17,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:14:17,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:14:17,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:14:17,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:17" (1/1) ... [2022-11-02 20:14:17,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:17" (1/1) ... [2022-11-02 20:14:17,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:17" (1/1) ... [2022-11-02 20:14:17,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:17" (1/1) ... [2022-11-02 20:14:17,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:17" (1/1) ... [2022-11-02 20:14:17,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:17" (1/1) ... [2022-11-02 20:14:17,890 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:17" (1/1) ... [2022-11-02 20:14:17,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:17" (1/1) ... [2022-11-02 20:14:17,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:14:17,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:14:17,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:14:17,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:14:17,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:17" (1/1) ... [2022-11-02 20:14:17,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:14:17,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab01c7-3ecb-4a31-8728-e6552a839807/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:14:17,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab01c7-3ecb-4a31-8728-e6552a839807/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:14:17,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab01c7-3ecb-4a31-8728-e6552a839807/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:14:18,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:14:18,022 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-02 20:14:18,022 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-02 20:14:18,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:14:18,022 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-02 20:14:18,022 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-02 20:14:18,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:14:18,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:14:18,186 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:14:18,189 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:14:18,267 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:14:18,290 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:14:18,295 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:14:18,775 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##82: assume !false; [2022-11-02 20:14:18,775 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##81: assume false; [2022-11-02 20:14:18,775 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !false; [2022-11-02 20:14:18,775 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume false; [2022-11-02 20:14:18,776 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2022-11-02 20:14:18,776 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2022-11-02 20:14:18,778 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:14:18,830 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-11-02 20:14:18,830 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-11-02 20:14:18,834 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:14:18,842 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:14:18,842 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:14:18,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:14:18 BoogieIcfgContainer [2022-11-02 20:14:18,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:14:18,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:14:18,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:14:18,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:14:18,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:14:17" (1/3) ... [2022-11-02 20:14:18,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a6acd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:14:18, skipping insertion in model container [2022-11-02 20:14:18,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:17" (2/3) ... [2022-11-02 20:14:18,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a6acd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:14:18, skipping insertion in model container [2022-11-02 20:14:18,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:14:18" (3/3) ... [2022-11-02 20:14:18,854 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2022-11-02 20:14:18,873 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:14:18,874 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:14:18,929 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:14:18,937 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;@137c73c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:14:18,937 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:14:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 103 states have (on average 1.6116504854368932) internal successors, (166), 114 states have internal predecessors, (166), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-02 20:14:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:14:18,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:18,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:14:18,952 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:18,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:18,958 INFO L85 PathProgramCache]: Analyzing trace with hash -454322622, now seen corresponding path program 1 times [2022-11-02 20:14:18,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:18,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284438152] [2022-11-02 20:14:18,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:18,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:19,223 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:14:19,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:19,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284438152] [2022-11-02 20:14:19,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284438152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:19,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:19,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:19,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327989622] [2022-11-02 20:14:19,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:19,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:19,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:19,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:19,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:19,271 INFO L87 Difference]: Start difference. First operand has 121 states, 103 states have (on average 1.6116504854368932) internal successors, (166), 114 states have internal predecessors, (166), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:19,382 INFO L93 Difference]: Finished difference Result 235 states and 382 transitions. [2022-11-02 20:14:19,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:19,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 20:14:19,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:19,403 INFO L225 Difference]: With dead ends: 235 [2022-11-02 20:14:19,404 INFO L226 Difference]: Without dead ends: 111 [2022-11-02 20:14:19,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:19,419 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 102 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:19,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 242 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-02 20:14:19,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-02 20:14:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.5052631578947369) internal successors, (143), 104 states have internal predecessors, (143), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:14:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2022-11-02 20:14:19,480 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 13 [2022-11-02 20:14:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:19,481 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2022-11-02 20:14:19,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2022-11-02 20:14:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:14:19,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:19,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:14:19,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:14:19,483 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:19,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:19,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1664019001, now seen corresponding path program 1 times [2022-11-02 20:14:19,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:19,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207294404] [2022-11-02 20:14:19,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:19,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:19,588 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:14:19,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:19,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207294404] [2022-11-02 20:14:19,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207294404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:19,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:19,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:19,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416374514] [2022-11-02 20:14:19,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:19,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:19,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:19,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:19,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:19,593 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:19,730 INFO L93 Difference]: Finished difference Result 203 states and 288 transitions. [2022-11-02 20:14:19,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:19,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:14:19,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:19,734 INFO L225 Difference]: With dead ends: 203 [2022-11-02 20:14:19,734 INFO L226 Difference]: Without dead ends: 156 [2022-11-02 20:14:19,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:19,736 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 112 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:19,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 237 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:14:19,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-02 20:14:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2022-11-02 20:14:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 130 states have (on average 1.4230769230769231) internal successors, (185), 131 states have internal predecessors, (185), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-02 20:14:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 203 transitions. [2022-11-02 20:14:19,765 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 203 transitions. Word has length 16 [2022-11-02 20:14:19,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:19,766 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 203 transitions. [2022-11-02 20:14:19,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 203 transitions. [2022-11-02 20:14:19,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:14:19,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:19,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:14:19,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:14:19,768 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:19,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:19,768 INFO L85 PathProgramCache]: Analyzing trace with hash -45143919, now seen corresponding path program 1 times [2022-11-02 20:14:19,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:19,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686948783] [2022-11-02 20:14:19,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:19,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:19,888 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:14:19,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:19,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686948783] [2022-11-02 20:14:19,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686948783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:19,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:19,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:19,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704715554] [2022-11-02 20:14:19,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:19,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:19,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:19,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:19,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:19,892 INFO L87 Difference]: Start difference. First operand 143 states and 203 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:19,936 INFO L93 Difference]: Finished difference Result 246 states and 339 transitions. [2022-11-02 20:14:19,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:19,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:14:19,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:19,939 INFO L225 Difference]: With dead ends: 246 [2022-11-02 20:14:19,939 INFO L226 Difference]: Without dead ends: 198 [2022-11-02 20:14:19,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:19,942 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 128 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:19,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 222 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-02 20:14:19,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 154. [2022-11-02 20:14:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 141 states have (on average 1.4113475177304964) internal successors, (199), 142 states have internal predecessors, (199), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:14:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 216 transitions. [2022-11-02 20:14:19,973 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 216 transitions. Word has length 17 [2022-11-02 20:14:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:19,974 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 216 transitions. [2022-11-02 20:14:19,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 216 transitions. [2022-11-02 20:14:19,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:14:19,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:19,976 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] [2022-11-02 20:14:19,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:14:19,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:19,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:19,978 INFO L85 PathProgramCache]: Analyzing trace with hash 111527333, now seen corresponding path program 1 times [2022-11-02 20:14:19,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:19,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933557280] [2022-11-02 20:14:19,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:19,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:20,094 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:14:20,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:20,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933557280] [2022-11-02 20:14:20,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933557280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:20,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:20,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:20,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234614154] [2022-11-02 20:14:20,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:20,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:20,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:20,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:20,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:20,098 INFO L87 Difference]: Start difference. First operand 154 states and 216 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:20,178 INFO L93 Difference]: Finished difference Result 157 states and 218 transitions. [2022-11-02 20:14:20,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:20,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 20:14:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:20,183 INFO L225 Difference]: With dead ends: 157 [2022-11-02 20:14:20,183 INFO L226 Difference]: Without dead ends: 154 [2022-11-02 20:14:20,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:20,185 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 10 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:20,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 262 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:14:20,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-02 20:14:20,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-11-02 20:14:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 141 states have (on average 1.4042553191489362) internal successors, (198), 142 states have internal predecessors, (198), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:14:20,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 215 transitions. [2022-11-02 20:14:20,210 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 215 transitions. Word has length 27 [2022-11-02 20:14:20,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:20,210 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 215 transitions. [2022-11-02 20:14:20,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:20,211 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 215 transitions. [2022-11-02 20:14:20,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:14:20,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:20,213 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] [2022-11-02 20:14:20,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:14:20,214 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:20,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:20,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1365306542, now seen corresponding path program 1 times [2022-11-02 20:14:20,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:20,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010686198] [2022-11-02 20:14:20,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:20,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:20,295 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:14:20,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:20,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010686198] [2022-11-02 20:14:20,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010686198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:20,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:20,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:20,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106569506] [2022-11-02 20:14:20,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:20,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:20,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:20,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:20,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:20,299 INFO L87 Difference]: Start difference. First operand 154 states and 215 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:20,366 INFO L93 Difference]: Finished difference Result 200 states and 276 transitions. [2022-11-02 20:14:20,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:20,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 20:14:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:20,369 INFO L225 Difference]: With dead ends: 200 [2022-11-02 20:14:20,369 INFO L226 Difference]: Without dead ends: 152 [2022-11-02 20:14:20,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:20,371 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 5 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:20,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 269 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:20,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-02 20:14:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-11-02 20:14:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 140 states have internal predecessors, (195), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 8 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:14:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 211 transitions. [2022-11-02 20:14:20,408 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 211 transitions. Word has length 31 [2022-11-02 20:14:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:20,408 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 211 transitions. [2022-11-02 20:14:20,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 211 transitions. [2022-11-02 20:14:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:14:20,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:20,412 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] [2022-11-02 20:14:20,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:14:20,413 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:20,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:20,419 INFO L85 PathProgramCache]: Analyzing trace with hash 52355391, now seen corresponding path program 1 times [2022-11-02 20:14:20,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:20,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117246791] [2022-11-02 20:14:20,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:20,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:20,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:14:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:20,634 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:14:20,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:20,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117246791] [2022-11-02 20:14:20,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117246791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:20,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:20,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:14:20,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867352538] [2022-11-02 20:14:20,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:20,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:14:20,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:20,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:14:20,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:14:20,640 INFO L87 Difference]: Start difference. First operand 152 states and 211 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:20,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:20,880 INFO L93 Difference]: Finished difference Result 214 states and 290 transitions. [2022-11-02 20:14:20,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:14:20,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-11-02 20:14:20,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:20,883 INFO L225 Difference]: With dead ends: 214 [2022-11-02 20:14:20,883 INFO L226 Difference]: Without dead ends: 161 [2022-11-02 20:14:20,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:14:20,895 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 293 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:20,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 480 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:14:20,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-11-02 20:14:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 145. [2022-11-02 20:14:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 133 states have (on average 1.3909774436090225) internal successors, (185), 133 states have internal predecessors, (185), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-02 20:14:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2022-11-02 20:14:20,936 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 33 [2022-11-02 20:14:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:20,936 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2022-11-02 20:14:20,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2022-11-02 20:14:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:14:20,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:20,939 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] [2022-11-02 20:14:20,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:14:20,939 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:20,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:20,940 INFO L85 PathProgramCache]: Analyzing trace with hash -572632936, now seen corresponding path program 1 times [2022-11-02 20:14:20,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:20,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657466687] [2022-11-02 20:14:20,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:20,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:21,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:14:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:21,199 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:14:21,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:21,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657466687] [2022-11-02 20:14:21,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657466687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:21,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:21,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:14:21,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917251856] [2022-11-02 20:14:21,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:21,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:14:21,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:21,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:14:21,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:14:21,203 INFO L87 Difference]: Start difference. First operand 145 states and 200 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:21,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:21,485 INFO L93 Difference]: Finished difference Result 191 states and 261 transitions. [2022-11-02 20:14:21,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:14:21,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-11-02 20:14:21,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:21,488 INFO L225 Difference]: With dead ends: 191 [2022-11-02 20:14:21,488 INFO L226 Difference]: Without dead ends: 145 [2022-11-02 20:14:21,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:14:21,490 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 160 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:21,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 465 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:14:21,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-02 20:14:21,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-11-02 20:14:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 133 states have (on average 1.3834586466165413) internal successors, (184), 133 states have internal predecessors, (184), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-02 20:14:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 199 transitions. [2022-11-02 20:14:21,527 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 199 transitions. Word has length 37 [2022-11-02 20:14:21,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:21,527 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 199 transitions. [2022-11-02 20:14:21,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 199 transitions. [2022-11-02 20:14:21,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:14:21,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:21,530 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] [2022-11-02 20:14:21,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:14:21,531 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:21,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1593142548, now seen corresponding path program 1 times [2022-11-02 20:14:21,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:21,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925895642] [2022-11-02 20:14:21,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:21,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:21,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:14:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:21,661 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:14:21,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:21,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925895642] [2022-11-02 20:14:21,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925895642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:21,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:21,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:14:21,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746056299] [2022-11-02 20:14:21,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:21,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:14:21,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:21,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:14:21,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:14:21,665 INFO L87 Difference]: Start difference. First operand 145 states and 199 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:21,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:21,887 INFO L93 Difference]: Finished difference Result 179 states and 240 transitions. [2022-11-02 20:14:21,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:14:21,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-11-02 20:14:21,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:21,889 INFO L225 Difference]: With dead ends: 179 [2022-11-02 20:14:21,890 INFO L226 Difference]: Without dead ends: 157 [2022-11-02 20:14:21,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:14:21,891 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 196 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:21,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 585 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:14:21,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-02 20:14:21,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2022-11-02 20:14:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-02 20:14:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 198 transitions. [2022-11-02 20:14:21,910 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 198 transitions. Word has length 38 [2022-11-02 20:14:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:21,910 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 198 transitions. [2022-11-02 20:14:21,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 198 transitions. [2022-11-02 20:14:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:14:21,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:21,913 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] [2022-11-02 20:14:21,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:14:21,913 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:21,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:21,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1687313027, now seen corresponding path program 1 times [2022-11-02 20:14:21,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:21,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980730377] [2022-11-02 20:14:21,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:21,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:21,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:14:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:22,024 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:14:22,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:22,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980730377] [2022-11-02 20:14:22,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980730377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:22,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:22,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:14:22,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842619644] [2022-11-02 20:14:22,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:22,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:14:22,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:22,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:14:22,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:14:22,028 INFO L87 Difference]: Start difference. First operand 145 states and 198 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:22,137 INFO L93 Difference]: Finished difference Result 207 states and 282 transitions. [2022-11-02 20:14:22,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:14:22,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-11-02 20:14:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:22,139 INFO L225 Difference]: With dead ends: 207 [2022-11-02 20:14:22,140 INFO L226 Difference]: Without dead ends: 155 [2022-11-02 20:14:22,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:14:22,141 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 21 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:22,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 376 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:14:22,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-02 20:14:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2022-11-02 20:14:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 139 states have (on average 1.3669064748201438) internal successors, (190), 139 states have internal predecessors, (190), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-02 20:14:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2022-11-02 20:14:22,162 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 205 transitions. Word has length 39 [2022-11-02 20:14:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:22,163 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 205 transitions. [2022-11-02 20:14:22,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 205 transitions. [2022-11-02 20:14:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:14:22,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:22,165 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] [2022-11-02 20:14:22,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:14:22,165 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:22,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:22,166 INFO L85 PathProgramCache]: Analyzing trace with hash -986248449, now seen corresponding path program 1 times [2022-11-02 20:14:22,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:22,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687948065] [2022-11-02 20:14:22,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:22,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:22,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:14:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:22,333 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:14:22,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:22,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687948065] [2022-11-02 20:14:22,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687948065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:22,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:22,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:14:22,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70476468] [2022-11-02 20:14:22,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:22,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:14:22,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:22,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:14:22,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:14:22,337 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:22,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:22,541 INFO L93 Difference]: Finished difference Result 218 states and 296 transitions. [2022-11-02 20:14:22,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:14:22,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-11-02 20:14:22,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:22,544 INFO L225 Difference]: With dead ends: 218 [2022-11-02 20:14:22,544 INFO L226 Difference]: Without dead ends: 187 [2022-11-02 20:14:22,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:14:22,545 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 46 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:22,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 856 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:14:22,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-02 20:14:22,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 156. [2022-11-02 20:14:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:14:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 210 transitions. [2022-11-02 20:14:22,569 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 210 transitions. Word has length 39 [2022-11-02 20:14:22,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:22,569 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 210 transitions. [2022-11-02 20:14:22,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:22,570 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 210 transitions. [2022-11-02 20:14:22,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:14:22,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:22,571 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] [2022-11-02 20:14:22,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:14:22,572 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:22,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:22,572 INFO L85 PathProgramCache]: Analyzing trace with hash 368817782, now seen corresponding path program 1 times [2022-11-02 20:14:22,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:22,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125337366] [2022-11-02 20:14:22,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:22,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:22,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:14:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:22,639 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:14:22,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:22,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125337366] [2022-11-02 20:14:22,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125337366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:22,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:22,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:14:22,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577779635] [2022-11-02 20:14:22,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:22,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:14:22,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:22,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:14:22,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:14:22,643 INFO L87 Difference]: Start difference. First operand 156 states and 210 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:22,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:22,782 INFO L93 Difference]: Finished difference Result 214 states and 286 transitions. [2022-11-02 20:14:22,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:14:22,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-11-02 20:14:22,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:22,784 INFO L225 Difference]: With dead ends: 214 [2022-11-02 20:14:22,785 INFO L226 Difference]: Without dead ends: 174 [2022-11-02 20:14:22,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:14:22,786 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 51 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:22,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 404 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:14:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-02 20:14:22,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 161. [2022-11-02 20:14:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 145 states have internal predecessors, (195), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-02 20:14:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 214 transitions. [2022-11-02 20:14:22,812 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 214 transitions. Word has length 40 [2022-11-02 20:14:22,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:22,813 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 214 transitions. [2022-11-02 20:14:22,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:22,813 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 214 transitions. [2022-11-02 20:14:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:14:22,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:22,815 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] [2022-11-02 20:14:22,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:14:22,815 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:22,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:22,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1582571415, now seen corresponding path program 1 times [2022-11-02 20:14:22,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:22,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005951408] [2022-11-02 20:14:22,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:22,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:22,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:14:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:22,974 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:14:22,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:22,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005951408] [2022-11-02 20:14:22,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005951408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:22,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:22,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:14:22,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905938117] [2022-11-02 20:14:22,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:22,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:14:22,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:22,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:14:22,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:14:22,978 INFO L87 Difference]: Start difference. First operand 161 states and 214 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:23,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:23,188 INFO L93 Difference]: Finished difference Result 209 states and 276 transitions. [2022-11-02 20:14:23,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:14:23,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-11-02 20:14:23,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:23,193 INFO L225 Difference]: With dead ends: 209 [2022-11-02 20:14:23,193 INFO L226 Difference]: Without dead ends: 187 [2022-11-02 20:14:23,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:14:23,195 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 57 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:23,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 894 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:14:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-02 20:14:23,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 162. [2022-11-02 20:14:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 148 states have (on average 1.3175675675675675) internal successors, (195), 146 states have internal predecessors, (195), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-02 20:14:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 214 transitions. [2022-11-02 20:14:23,227 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 214 transitions. Word has length 40 [2022-11-02 20:14:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:23,229 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 214 transitions. [2022-11-02 20:14:23,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 214 transitions. [2022-11-02 20:14:23,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:14:23,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:23,233 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] [2022-11-02 20:14:23,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:14:23,233 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:23,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:23,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1069882360, now seen corresponding path program 1 times [2022-11-02 20:14:23,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:23,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530177543] [2022-11-02 20:14:23,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:23,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:23,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:14:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:23,334 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:14:23,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:23,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530177543] [2022-11-02 20:14:23,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530177543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:23,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:23,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:14:23,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994146796] [2022-11-02 20:14:23,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:23,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:14:23,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:23,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:14:23,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:14:23,337 INFO L87 Difference]: Start difference. First operand 162 states and 214 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:23,453 INFO L93 Difference]: Finished difference Result 205 states and 268 transitions. [2022-11-02 20:14:23,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:14:23,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-11-02 20:14:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:23,456 INFO L225 Difference]: With dead ends: 205 [2022-11-02 20:14:23,456 INFO L226 Difference]: Without dead ends: 158 [2022-11-02 20:14:23,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:14:23,459 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 18 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:23,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 388 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:14:23,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-02 20:14:23,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2022-11-02 20:14:23,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 141 states have (on average 1.2907801418439717) internal successors, (182), 139 states have internal predecessors, (182), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 11 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-02 20:14:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 200 transitions. [2022-11-02 20:14:23,485 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 200 transitions. Word has length 40 [2022-11-02 20:14:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:23,485 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 200 transitions. [2022-11-02 20:14:23,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:23,486 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 200 transitions. [2022-11-02 20:14:23,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:14:23,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:23,487 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] [2022-11-02 20:14:23,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:14:23,488 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:23,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:23,489 INFO L85 PathProgramCache]: Analyzing trace with hash -760530929, now seen corresponding path program 1 times [2022-11-02 20:14:23,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:23,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797573685] [2022-11-02 20:14:23,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:23,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:23,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:14:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:23,626 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:14:23,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:23,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797573685] [2022-11-02 20:14:23,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797573685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:23,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:23,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:14:23,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815118245] [2022-11-02 20:14:23,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:23,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:14:23,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:23,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:14:23,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:14:23,630 INFO L87 Difference]: Start difference. First operand 154 states and 200 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:23,756 INFO L93 Difference]: Finished difference Result 164 states and 212 transitions. [2022-11-02 20:14:23,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:14:23,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-11-02 20:14:23,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:23,757 INFO L225 Difference]: With dead ends: 164 [2022-11-02 20:14:23,758 INFO L226 Difference]: Without dead ends: 47 [2022-11-02 20:14:23,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:14:23,759 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 246 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:23,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 241 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:14:23,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-02 20:14:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-02 20:14:23,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 43 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-11-02 20:14:23,767 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 40 [2022-11-02 20:14:23,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:23,768 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-11-02 20:14:23,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:23,768 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-11-02 20:14:23,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:14:23,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:23,769 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] [2022-11-02 20:14:23,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:14:23,770 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:23,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1689213541, now seen corresponding path program 1 times [2022-11-02 20:14:23,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:23,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404792641] [2022-11-02 20:14:23,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:23,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:23,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:14:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:23,838 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:14:23,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:23,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404792641] [2022-11-02 20:14:23,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404792641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:23,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:23,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:14:23,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085657248] [2022-11-02 20:14:23,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:23,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:14:23,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:23,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:14:23,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:14:23,841 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:23,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:23,881 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-11-02 20:14:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:14:23,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-02 20:14:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:23,882 INFO L225 Difference]: With dead ends: 49 [2022-11-02 20:14:23,882 INFO L226 Difference]: Without dead ends: 42 [2022-11-02 20:14:23,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:14:23,883 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:23,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:23,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-02 20:14:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-02 20:14:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2022-11-02 20:14:23,891 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2022-11-02 20:14:23,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:23,891 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-11-02 20:14:23,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:23,892 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-11-02 20:14:23,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:14:23,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:23,892 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] [2022-11-02 20:14:23,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:14:23,893 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:23,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:23,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1579234754, now seen corresponding path program 1 times [2022-11-02 20:14:23,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:23,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590424993] [2022-11-02 20:14:23,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:23,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:23,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:14:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:23,965 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:14:23,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:23,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590424993] [2022-11-02 20:14:23,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590424993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:23,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:23,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:14:23,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142122679] [2022-11-02 20:14:23,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:23,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:14:23,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:23,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:14:23,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:14:23,968 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:24,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:24,024 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-11-02 20:14:24,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:14:24,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-02 20:14:24,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:24,026 INFO L225 Difference]: With dead ends: 80 [2022-11-02 20:14:24,026 INFO L226 Difference]: Without dead ends: 75 [2022-11-02 20:14:24,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:14:24,028 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 20 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:24,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 106 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:24,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-02 20:14:24,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-11-02 20:14:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:14:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2022-11-02 20:14:24,040 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 41 [2022-11-02 20:14:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:24,041 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2022-11-02 20:14:24,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-11-02 20:14:24,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:14:24,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:24,042 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] [2022-11-02 20:14:24,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:14:24,043 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:24,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:24,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1581081796, now seen corresponding path program 1 times [2022-11-02 20:14:24,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:24,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418177226] [2022-11-02 20:14:24,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:24,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:24,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:14:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:24,277 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:14:24,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:24,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418177226] [2022-11-02 20:14:24,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418177226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:24,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:24,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:14:24,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652173166] [2022-11-02 20:14:24,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:24,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:14:24,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:24,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:14:24,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:14:24,280 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:24,336 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-11-02 20:14:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:14:24,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-02 20:14:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:24,337 INFO L225 Difference]: With dead ends: 74 [2022-11-02 20:14:24,338 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:14:24,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:14:24,339 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:24,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 171 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:24,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:14:24,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:14:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:14:24,341 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-11-02 20:14:24,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:24,341 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:14:24,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:14:24,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:14:24,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:14:24,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:14:24,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:14:24,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:14:26,621 INFO L902 garLoopResultBuilder]: At program point errorFnENTRY(lines 577 584) the Hoare annotation is: true [2022-11-02 20:14:26,621 INFO L899 garLoopResultBuilder]: For program point errorFnFINAL(lines 577 584) no Hoare annotation was computed. [2022-11-02 20:14:26,621 INFO L899 garLoopResultBuilder]: For program point errorFnEXIT(lines 577 584) no Hoare annotation was computed. [2022-11-02 20:14:26,621 INFO L899 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-11-02 20:14:26,621 INFO L899 garLoopResultBuilder]: For program point L201(lines 201 205) no Hoare annotation was computed. [2022-11-02 20:14:26,621 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 273) no Hoare annotation was computed. [2022-11-02 20:14:26,622 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 284) no Hoare annotation was computed. [2022-11-02 20:14:26,622 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:14:26,622 INFO L895 garLoopResultBuilder]: At program point L251(line 251) the Hoare annotation is: false [2022-11-02 20:14:26,622 INFO L899 garLoopResultBuilder]: For program point L251-1(lines 247 253) no Hoare annotation was computed. [2022-11-02 20:14:26,622 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: false [2022-11-02 20:14:26,623 INFO L895 garLoopResultBuilder]: At program point L103(lines 102 284) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-02 20:14:26,623 INFO L895 garLoopResultBuilder]: At program point L70(lines 51 72) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~s~0 ~NP~0)) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-02 20:14:26,623 INFO L895 garLoopResultBuilder]: At program point L384(lines 377 417) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-11-02 20:14:26,623 INFO L895 garLoopResultBuilder]: At program point L285(lines 75 287) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-11-02 20:14:26,623 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 267) no Hoare annotation was computed. [2022-11-02 20:14:26,624 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 278) no Hoare annotation was computed. [2022-11-02 20:14:26,624 INFO L895 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: false [2022-11-02 20:14:26,624 INFO L899 garLoopResultBuilder]: For program point L236-1(lines 232 238) no Hoare annotation was computed. [2022-11-02 20:14:26,624 INFO L899 garLoopResultBuilder]: For program point L550(lines 550 562) no Hoare annotation was computed. [2022-11-02 20:14:26,624 INFO L899 garLoopResultBuilder]: For program point L385(lines 369 418) no Hoare annotation was computed. [2022-11-02 20:14:26,624 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 367) no Hoare annotation was computed. [2022-11-02 20:14:26,624 INFO L895 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: false [2022-11-02 20:14:26,625 INFO L895 garLoopResultBuilder]: At program point L187(lines 187 188) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-11-02 20:14:26,625 INFO L899 garLoopResultBuilder]: For program point L220-1(lines 216 222) no Hoare annotation was computed. [2022-11-02 20:14:26,625 INFO L899 garLoopResultBuilder]: For program point L187-1(lines 187 188) no Hoare annotation was computed. [2022-11-02 20:14:26,625 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 183) no Hoare annotation was computed. [2022-11-02 20:14:26,625 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 272) no Hoare annotation was computed. [2022-11-02 20:14:26,625 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 283) no Hoare annotation was computed. [2022-11-02 20:14:26,625 INFO L895 garLoopResultBuilder]: At program point L551(lines 550 562) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 259 |ULTIMATE.start_KbFilter_PnP_~status~0#1|) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-11-02 20:14:26,626 INFO L899 garLoopResultBuilder]: For program point L386(lines 386 415) no Hoare annotation was computed. [2022-11-02 20:14:26,626 INFO L895 garLoopResultBuilder]: At program point L353(lines 352 367) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-02 20:14:26,626 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2022-11-02 20:14:26,626 INFO L895 garLoopResultBuilder]: At program point L106(lines 105 283) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-02 20:14:26,626 INFO L902 garLoopResultBuilder]: At program point L420(lines 288 422) the Hoare annotation is: true [2022-11-02 20:14:26,626 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 414) no Hoare annotation was computed. [2022-11-02 20:14:26,627 INFO L899 garLoopResultBuilder]: For program point L156(lines 156 266) no Hoare annotation was computed. [2022-11-02 20:14:26,627 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 277) no Hoare annotation was computed. [2022-11-02 20:14:26,627 INFO L895 garLoopResultBuilder]: At program point L536(lines 528 547) the Hoare annotation is: false [2022-11-02 20:14:26,627 INFO L899 garLoopResultBuilder]: For program point L404(lines 404 412) no Hoare annotation was computed. [2022-11-02 20:14:26,628 INFO L895 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: false [2022-11-02 20:14:26,629 INFO L895 garLoopResultBuilder]: At program point L553(lines 552 562) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 259 |ULTIMATE.start_KbFilter_PnP_~status~0#1|) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-11-02 20:14:26,629 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-11-02 20:14:26,629 INFO L895 garLoopResultBuilder]: At program point L355(lines 354 367) the Hoare annotation is: (= |ULTIMATE.start_main_~status~1#1| 0) [2022-11-02 20:14:26,629 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:14:26,630 INFO L899 garLoopResultBuilder]: For program point L405(lines 405 407) no Hoare annotation was computed. [2022-11-02 20:14:26,630 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 271) no Hoare annotation was computed. [2022-11-02 20:14:26,630 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 282) no Hoare annotation was computed. [2022-11-02 20:14:26,630 INFO L899 garLoopResultBuilder]: For program point L389(lines 389 391) no Hoare annotation was computed. [2022-11-02 20:14:26,630 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 368) no Hoare annotation was computed. [2022-11-02 20:14:26,631 INFO L895 garLoopResultBuilder]: At program point L323-1(lines 297 421) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-11-02 20:14:26,631 INFO L895 garLoopResultBuilder]: At program point L257(lines 257 258) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-02 20:14:26,631 INFO L899 garLoopResultBuilder]: For program point L257-1(lines 257 258) no Hoare annotation was computed. [2022-11-02 20:14:26,631 INFO L899 garLoopResultBuilder]: For program point L505(lines 505 511) no Hoare annotation was computed. [2022-11-02 20:14:26,631 INFO L899 garLoopResultBuilder]: For program point L340(lines 340 345) no Hoare annotation was computed. [2022-11-02 20:14:26,632 INFO L899 garLoopResultBuilder]: For program point L340-2(lines 339 349) no Hoare annotation was computed. [2022-11-02 20:14:26,632 INFO L895 garLoopResultBuilder]: At program point L109(lines 108 282) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-02 20:14:26,632 INFO L899 garLoopResultBuilder]: For program point L192(lines 192 198) no Hoare annotation was computed. [2022-11-02 20:14:26,632 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 265) no Hoare annotation was computed. [2022-11-02 20:14:26,633 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 276) no Hoare annotation was computed. [2022-11-02 20:14:26,633 INFO L899 garLoopResultBuilder]: For program point L192-2(lines 166 261) no Hoare annotation was computed. [2022-11-02 20:14:26,633 INFO L895 garLoopResultBuilder]: At program point L242(line 242) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-02 20:14:26,633 INFO L899 garLoopResultBuilder]: For program point L242-1(line 242) no Hoare annotation was computed. [2022-11-02 20:14:26,633 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 182) no Hoare annotation was computed. [2022-11-02 20:14:26,634 INFO L899 garLoopResultBuilder]: For program point L176-1(lines 171 183) no Hoare annotation was computed. [2022-11-02 20:14:26,634 INFO L895 garLoopResultBuilder]: At program point L523(lines 523 564) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 259 |ULTIMATE.start_KbFilter_PnP_~status~0#1|) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-11-02 20:14:26,634 INFO L895 garLoopResultBuilder]: At program point L226(lines 226 227) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-02 20:14:26,634 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 226 227) no Hoare annotation was computed. [2022-11-02 20:14:26,635 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:14:26,635 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 270) no Hoare annotation was computed. [2022-11-02 20:14:26,635 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 281) no Hoare annotation was computed. [2022-11-02 20:14:26,635 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 545) no Hoare annotation was computed. [2022-11-02 20:14:26,635 INFO L899 garLoopResultBuilder]: For program point L541-1(lines 528 547) no Hoare annotation was computed. [2022-11-02 20:14:26,636 INFO L899 garLoopResultBuilder]: For program point L409(lines 409 411) no Hoare annotation was computed. [2022-11-02 20:14:26,636 INFO L895 garLoopResultBuilder]: At program point L376(lines 369 418) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-11-02 20:14:26,636 INFO L895 garLoopResultBuilder]: At program point L178(line 178) the Hoare annotation is: false [2022-11-02 20:14:26,636 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 264) no Hoare annotation was computed. [2022-11-02 20:14:26,637 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 275) no Hoare annotation was computed. [2022-11-02 20:14:26,637 INFO L895 garLoopResultBuilder]: At program point L509(line 509) the Hoare annotation is: false [2022-11-02 20:14:26,637 INFO L895 garLoopResultBuilder]: At program point L509-1(lines 501 514) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-11-02 20:14:26,637 INFO L895 garLoopResultBuilder]: At program point L262(lines 166 263) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-11-02 20:14:26,638 INFO L895 garLoopResultBuilder]: At program point L543(line 543) the Hoare annotation is: false [2022-11-02 20:14:26,638 INFO L899 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2022-11-02 20:14:26,638 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 269) no Hoare annotation was computed. [2022-11-02 20:14:26,638 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 280) no Hoare annotation was computed. [2022-11-02 20:14:26,639 INFO L895 garLoopResultBuilder]: At program point L48(lines 37 50) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-02 20:14:26,639 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:14:26,639 INFO L899 garLoopResultBuilder]: For program point L528(lines 528 547) no Hoare annotation was computed. [2022-11-02 20:14:26,639 INFO L895 garLoopResultBuilder]: At program point L396(lines 387 414) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-11-02 20:14:26,639 INFO L895 garLoopResultBuilder]: At program point L165(lines 111 281) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-02 20:14:26,640 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 274) no Hoare annotation was computed. [2022-11-02 20:14:26,640 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2022-11-02 20:14:26,640 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 238) no Hoare annotation was computed. [2022-11-02 20:14:26,640 INFO L899 garLoopResultBuilder]: For program point L216(lines 216 222) no Hoare annotation was computed. [2022-11-02 20:14:26,640 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 268) no Hoare annotation was computed. [2022-11-02 20:14:26,641 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 279) no Hoare annotation was computed. [2022-11-02 20:14:26,641 INFO L899 garLoopResultBuilder]: For program point L398(lines 398 402) no Hoare annotation was computed. [2022-11-02 20:14:26,641 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 335) no Hoare annotation was computed. [2022-11-02 20:14:26,641 INFO L899 garLoopResultBuilder]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2022-11-02 20:14:26,641 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 206) no Hoare annotation was computed. [2022-11-02 20:14:26,642 INFO L895 garLoopResultBuilder]: At program point L457(lines 456 473) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse3 (= ~compRegistered~0 0)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~NP~0 |old(~s~0)|)) (.cse4 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse1) .cse2 (= ~MPR1~0 ~s~0) .cse3 .cse4) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse3) .cse2 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-11-02 20:14:26,642 INFO L899 garLoopResultBuilder]: For program point L445(lines 445 448) no Hoare annotation was computed. [2022-11-02 20:14:26,642 INFO L895 garLoopResultBuilder]: At program point L573(lines 565 575) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse3 (= ~compRegistered~0 0)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~NP~0 |old(~s~0)|)) (.cse4 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse1) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|)) .cse2 .cse3 .cse4) (or .cse0 (not .cse3) .cse2 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-11-02 20:14:26,643 INFO L899 garLoopResultBuilder]: For program point L445-2(lines 445 448) no Hoare annotation was computed. [2022-11-02 20:14:26,643 INFO L895 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 437 500) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse4 (= ~compRegistered~0 0)) (.cse3 (not (<= 5 ~MPR1~0))) (.cse2 (= ~NP~0 |old(~s~0)|)) (.cse5 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5) (or .cse0 .cse1 (not .cse4) .cse3 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5))) [2022-11-02 20:14:26,643 INFO L895 garLoopResultBuilder]: At program point L520(lines 515 522) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse3 (= ~compRegistered~0 0)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~NP~0 |old(~s~0)|)) (.cse4 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse1) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|)) .cse2 .cse3 .cse4) (or .cse0 (not .cse3) .cse2 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-11-02 20:14:26,643 INFO L899 garLoopResultBuilder]: For program point IofCallDriverFINAL(lines 437 500) no Hoare annotation was computed. [2022-11-02 20:14:26,644 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 496) no Hoare annotation was computed. [2022-11-02 20:14:26,644 INFO L895 garLoopResultBuilder]: At program point L471(lines 444 499) the Hoare annotation is: (let ((.cse5 (<= |IofCallDriver_~returnVal2~0#1| 0)) (.cse2 (not (= ~NP~0 1))) (.cse0 (= 259 |IofCallDriver_~returnVal2~0#1|)) (.cse6 (= ~compRegistered~0 0)) (.cse4 (not (<= 5 ~MPR1~0))) (.cse3 (= ~NP~0 |old(~s~0)|)) (.cse7 (not (= ~pended~0 0)))) (and (let ((.cse1 (= ~MPR1~0 ~s~0))) (or (and (= ~setEventCalled~0 1) .cse0 .cse1) (= ~SKIP1~0 ~NP~0) .cse2 (not .cse3) .cse4 (and .cse5 .cse1) .cse6 .cse7)) (let ((.cse8 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse9 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse10 (= ~s~0 |old(~s~0)|))) (or (and .cse8 .cse5 .cse9 .cse10) .cse2 (and .cse8 .cse0 .cse9 .cse10) (not .cse6) .cse4 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse7)))) [2022-11-02 20:14:26,644 INFO L899 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 437 500) no Hoare annotation was computed. [2022-11-02 20:14:26,645 INFO L895 garLoopResultBuilder]: At program point L459(lines 458 473) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse3 (= ~compRegistered~0 0)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~NP~0 |old(~s~0)|)) (.cse4 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse1) .cse2 (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse3 .cse4) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse3) .cse2 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-11-02 20:14:26,645 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 495) no Hoare annotation was computed. [2022-11-02 20:14:26,645 INFO L899 garLoopResultBuilder]: For program point L451(lines 451 474) no Hoare annotation was computed. [2022-11-02 20:14:26,645 INFO L899 garLoopResultBuilder]: For program point L480(lines 480 486) no Hoare annotation was computed. [2022-11-02 20:14:26,646 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse3 (= ~NP~0 |old(~s~0)|)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~compRegistered~0 0)) (.cse4 (not (= ~pended~0 0)))) (and (or .cse0 (not .cse1) .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse3) .cse2 .cse1 .cse4))) [2022-11-02 20:14:26,646 INFO L895 garLoopResultBuilder]: At program point L431-1(lines 423 436) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse3 (= ~compRegistered~0 0)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~NP~0 |old(~s~0)|)) (.cse4 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse1) .cse2 (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse3 .cse4) (or .cse0 (not .cse3) .cse2 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-11-02 20:14:26,646 INFO L895 garLoopResultBuilder]: At program point L493(line 493) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse3 (= ~NP~0 |old(~s~0)|)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~compRegistered~0 0)) (.cse4 (not (= ~pended~0 0)))) (and (or .cse0 (not .cse1) .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse3) .cse2 .cse1 .cse4))) [2022-11-02 20:14:26,646 INFO L899 garLoopResultBuilder]: For program point L493-1(lines 475 497) no Hoare annotation was computed. [2022-11-02 20:14:26,647 INFO L899 garLoopResultBuilder]: For program point L427(lines 427 433) no Hoare annotation was computed. [2022-11-02 20:14:26,647 INFO L899 garLoopResultBuilder]: For program point L456(lines 456 473) no Hoare annotation was computed. [2022-11-02 20:14:26,647 INFO L895 garLoopResultBuilder]: At program point L452(lines 451 474) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse3 (= ~compRegistered~0 0)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~NP~0 |old(~s~0)|)) (.cse4 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse1) .cse2 (= ~MPR1~0 ~s~0) .cse3 .cse4) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse3) .cse2 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-11-02 20:14:26,651 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:14:26,654 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:14:26,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:14:26 BoogieIcfgContainer [2022-11-02 20:14:26,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:14:26,712 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:14:26,713 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:14:26,714 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:14:26,714 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:14:18" (3/4) ... [2022-11-02 20:14:26,718 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:14:26,726 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-11-02 20:14:26,727 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-11-02 20:14:26,747 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-11-02 20:14:26,748 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-02 20:14:26,749 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-02 20:14:26,750 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:14:26,788 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && (((((!(NP == 1) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) [2022-11-02 20:14:26,790 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((((!(NP == 1) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) [2022-11-02 20:14:26,791 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((setEventCalled == 1 && 259 == returnVal2) && MPR1 == s) || SKIP1 == NP) || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (returnVal2 <= 0 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && ((((((((((setEventCalled == \old(setEventCalled) && returnVal2 <= 0) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(NP == 1)) || (((setEventCalled == \old(setEventCalled) && 259 == returnVal2) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) [2022-11-02 20:14:26,796 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((((!(NP == 1) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) [2022-11-02 20:14:26,796 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && ((((((!(NP == 1) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) [2022-11-02 20:14:26,800 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || (setEventCalled == 1 && s == \old(s))) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0)) && (((((!(NP == 1) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) [2022-11-02 20:14:26,800 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || (setEventCalled == 1 && s == \old(s))) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0)) && (((((!(NP == 1) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) [2022-11-02 20:14:26,878 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab01c7-3ecb-4a31-8728-e6552a839807/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:14:26,879 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:14:26,881 INFO L158 Benchmark]: Toolchain (without parser) took 9709.12ms. Allocated memory was 94.4MB in the beginning and 172.0MB in the end (delta: 77.6MB). Free memory was 62.6MB in the beginning and 53.0MB in the end (delta: 9.6MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. [2022-11-02 20:14:26,882 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 94.4MB. Free memory was 49.2MB in the beginning and 49.2MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:14:26,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 580.59ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 62.4MB in the beginning and 88.8MB in the end (delta: -26.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:14:26,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.69ms. Allocated memory is still 117.4MB. Free memory was 88.8MB in the beginning and 86.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:14:26,883 INFO L158 Benchmark]: Boogie Preprocessor took 38.16ms. Allocated memory is still 117.4MB. Free memory was 86.2MB in the beginning and 84.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:14:26,884 INFO L158 Benchmark]: RCFGBuilder took 947.45ms. Allocated memory is still 117.4MB. Free memory was 84.2MB in the beginning and 89.8MB in the end (delta: -5.6MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2022-11-02 20:14:26,884 INFO L158 Benchmark]: TraceAbstraction took 7864.23ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 89.2MB in the beginning and 61.5MB in the end (delta: 27.7MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2022-11-02 20:14:26,885 INFO L158 Benchmark]: Witness Printer took 167.39ms. Allocated memory is still 172.0MB. Free memory was 60.4MB in the beginning and 53.0MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:14:26,890 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.34ms. Allocated memory is still 94.4MB. Free memory was 49.2MB in the beginning and 49.2MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 580.59ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 62.4MB in the beginning and 88.8MB in the end (delta: -26.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.69ms. Allocated memory is still 117.4MB. Free memory was 88.8MB in the beginning and 86.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.16ms. Allocated memory is still 117.4MB. Free memory was 86.2MB in the beginning and 84.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 947.45ms. Allocated memory is still 117.4MB. Free memory was 84.2MB in the beginning and 89.8MB in the end (delta: -5.6MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7864.23ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 89.2MB in the beginning and 61.5MB in the end (delta: 27.7MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. * Witness Printer took 167.39ms. Allocated memory is still 172.0MB. Free memory was 60.4MB in the beginning and 53.0MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1487 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1478 mSDsluCounter, 6286 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3997 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1107 IncrementalHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 2289 mSDtfsCounter, 1107 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=12, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 163 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 173 PreInvPairs, 233 NumberOfFragments, 1125 HoareAnnotationTreeSize, 173 FomulaSimplifications, 265 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 43 FomulaSimplificationsInter, 3217 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 573 NumberOfCodeBlocks, 573 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 556 ConstructedInterpolants, 0 QuantifiedInterpolants, 1227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: status == 0 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 423]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && (((((!(NP == 1) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((((((((setEventCalled == 1 && 259 == returnVal2) && MPR1 == s) || SKIP1 == NP) || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (returnVal2 <= 0 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && ((((((((((setEventCalled == \old(setEventCalled) && returnVal2 <= 0) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(NP == 1)) || (((setEventCalled == \old(setEventCalled) && 259 == returnVal2) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && ((((((!(NP == 1) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((5 <= MPR1 && !(SKIP1 == NP)) && NP == 1) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((((5 <= MPR1 && !(compRegistered == 0)) && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && 259 <= status) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 523]: Loop Invariant Derived loop invariant: (((((((5 <= MPR1 && !(compRegistered == 0)) && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && 259 <= status) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((((5 <= MPR1 && !(SKIP1 == NP)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 501]: Loop Invariant Derived loop invariant: (((((5 <= MPR1 && !(compRegistered == 0)) && !(SKIP1 == NP)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((5 <= MPR1 && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((5 <= MPR1 && !(SKIP1 == NP)) && NP == 1) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (((5 <= MPR1 && !(SKIP1 == NP)) && NP == 1) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((5 <= MPR1 && !(SKIP1 == NP)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || (setEventCalled == 1 && s == \old(s))) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0)) && (((((!(NP == 1) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 565]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || (setEventCalled == 1 && s == \old(s))) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0)) && (((((!(NP == 1) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((((!(NP == 1) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((5 <= MPR1 && !(compRegistered == 0)) && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && 259 <= status) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((((!(NP == 1) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((5 <= MPR1 && !(SKIP1 == NP)) && NP == 1) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: (((((5 <= MPR1 && !(s == NP)) && !(SKIP1 == NP)) && NP == 1) && status == 0) && pended == 0) && compRegistered == 0 RESULT: Ultimate proved your program to be correct! [2022-11-02 20:14:27,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab01c7-3ecb-4a31-8728-e6552a839807/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 Result: TRUE