./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c93dc56-9253-4b34-af50-de167d3d4f8f/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c93dc56-9253-4b34-af50-de167d3d4f8f/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_5c93dc56-9253-4b34-af50-de167d3d4f8f/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c93dc56-9253-4b34-af50-de167d3d4f8f/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c93dc56-9253-4b34-af50-de167d3d4f8f/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_5c93dc56-9253-4b34-af50-de167d3d4f8f/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 bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 --- 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:24:47,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:24:47,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:24:47,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:24:47,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:24:47,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:24:47,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:24:47,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:24:47,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:24:47,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:24:47,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:24:47,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:24:47,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:24:47,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:24:47,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:24:47,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:24:47,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:24:47,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:24:47,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:24:47,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:24:47,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:24:47,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:24:47,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:24:47,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:24:47,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:24:47,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:24:47,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:24:47,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:24:47,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:24:47,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:24:47,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:24:47,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:24:47,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:24:47,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:24:47,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:24:47,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:24:47,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:24:47,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:24:47,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:24:47,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:24:47,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:24:47,160 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c93dc56-9253-4b34-af50-de167d3d4f8f/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:24:47,182 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:24:47,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:24:47,183 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:24:47,183 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:24:47,184 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:24:47,184 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:24:47,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:24:47,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:24:47,185 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:24:47,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:24:47,186 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:24:47,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:24:47,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:24:47,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:24:47,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:24:47,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:24:47,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:24:47,213 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:24:47,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:24:47,213 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:24:47,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:24:47,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:24:47,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:24:47,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:24:47,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:24:47,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:24:47,215 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:24:47,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:24:47,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:24:47,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:24:47,217 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:24:47,217 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:24:47,218 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:24:47,218 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_5c93dc56-9253-4b34-af50-de167d3d4f8f/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_5c93dc56-9253-4b34-af50-de167d3d4f8f/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 -> bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 [2022-11-02 20:24:47,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:24:47,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:24:47,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:24:47,497 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:24:47,498 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:24:47,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c93dc56-9253-4b34-af50-de167d3d4f8f/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2022-11-02 20:24:47,582 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c93dc56-9253-4b34-af50-de167d3d4f8f/bin/uautomizer-Dbtcem3rbc/data/f0f1456b6/8aafda74fe4242c99f2b20039790b490/FLAG66a11f041 [2022-11-02 20:24:48,181 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:24:48,190 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c93dc56-9253-4b34-af50-de167d3d4f8f/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2022-11-02 20:24:48,219 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c93dc56-9253-4b34-af50-de167d3d4f8f/bin/uautomizer-Dbtcem3rbc/data/f0f1456b6/8aafda74fe4242c99f2b20039790b490/FLAG66a11f041 [2022-11-02 20:24:48,393 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c93dc56-9253-4b34-af50-de167d3d4f8f/bin/uautomizer-Dbtcem3rbc/data/f0f1456b6/8aafda74fe4242c99f2b20039790b490 [2022-11-02 20:24:48,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:24:48,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:24:48,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:24:48,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:24:48,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:24:48,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:24:48" (1/1) ... [2022-11-02 20:24:48,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f72e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:48, skipping insertion in model container [2022-11-02 20:24:48,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:24:48" (1/1) ... [2022-11-02 20:24:48,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:24:48,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:24:48,703 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_5c93dc56-9253-4b34-af50-de167d3d4f8f/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2022-11-02 20:24:48,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:24:48,891 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:24:48,906 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_5c93dc56-9253-4b34-af50-de167d3d4f8f/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2022-11-02 20:24:49,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:24:49,030 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:24:49,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:49 WrapperNode [2022-11-02 20:24:49,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:24:49,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:24:49,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:24:49,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:24:49,045 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:24:49" (1/1) ... [2022-11-02 20:24:49,087 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:24:49" (1/1) ... [2022-11-02 20:24:49,184 INFO L138 Inliner]: procedures = 41, calls = 108, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 1583 [2022-11-02 20:24:49,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:24:49,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:24:49,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:24:49,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:24:49,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:49" (1/1) ... [2022-11-02 20:24:49,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:49" (1/1) ... [2022-11-02 20:24:49,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:49" (1/1) ... [2022-11-02 20:24:49,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:49" (1/1) ... [2022-11-02 20:24:49,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:49" (1/1) ... [2022-11-02 20:24:49,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:49" (1/1) ... [2022-11-02 20:24:49,239 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:49" (1/1) ... [2022-11-02 20:24:49,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:49" (1/1) ... [2022-11-02 20:24:49,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:24:49,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:24:49,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:24:49,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:24:49,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:49" (1/1) ... [2022-11-02 20:24:49,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:24:49,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c93dc56-9253-4b34-af50-de167d3d4f8f/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:24:49,320 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c93dc56-9253-4b34-af50-de167d3d4f8f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:24:49,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c93dc56-9253-4b34-af50-de167d3d4f8f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:24:49,398 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-11-02 20:24:49,399 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-11-02 20:24:49,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:24:49,399 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2022-11-02 20:24:49,399 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2022-11-02 20:24:49,399 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-11-02 20:24:49,400 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-11-02 20:24:49,401 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-11-02 20:24:49,402 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-11-02 20:24:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-11-02 20:24:49,402 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-11-02 20:24:49,403 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-11-02 20:24:49,403 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-11-02 20:24:49,403 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-11-02 20:24:49,403 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-11-02 20:24:49,403 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-11-02 20:24:49,404 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-11-02 20:24:49,404 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-11-02 20:24:49,404 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-11-02 20:24:49,404 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-02 20:24:49,404 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-02 20:24:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:24:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-02 20:24:49,406 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-02 20:24:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-11-02 20:24:49,406 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-11-02 20:24:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:24:49,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:24:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-11-02 20:24:49,407 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-11-02 20:24:49,807 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:24:49,810 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:24:50,008 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:24:50,110 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-11-02 20:24:50,111 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-11-02 20:24:50,215 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:24:50,234 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-11-02 20:24:50,235 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-11-02 20:24:50,243 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:24:50,244 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:24:50,248 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:24:50,261 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:24:50,277 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:24:50,281 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:24:50,286 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:24:51,023 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res#1 := 0; [2022-11-02 20:24:51,024 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume !false; [2022-11-02 20:24:51,024 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##257: assume false; [2022-11-02 20:24:51,024 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##286: assume !false; [2022-11-02 20:24:51,025 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume false; [2022-11-02 20:24:51,025 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2022-11-02 20:24:51,025 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2022-11-02 20:24:51,025 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##133: assume false; [2022-11-02 20:24:51,026 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##134: assume !false; [2022-11-02 20:24:51,026 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-11-02 20:24:51,026 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-11-02 20:24:51,027 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-11-02 20:24:51,027 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-11-02 20:24:51,028 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2022-11-02 20:24:51,028 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2022-11-02 20:24:51,083 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:24:51,104 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:24:51,104 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:24:51,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:24:51 BoogieIcfgContainer [2022-11-02 20:24:51,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:24:51,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:24:51,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:24:51,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:24:51,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:24:48" (1/3) ... [2022-11-02 20:24:51,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a74c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:24:51, skipping insertion in model container [2022-11-02 20:24:51,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:49" (2/3) ... [2022-11-02 20:24:51,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a74c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:24:51, skipping insertion in model container [2022-11-02 20:24:51,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:24:51" (3/3) ... [2022-11-02 20:24:51,121 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2022-11-02 20:24:51,144 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:24:51,144 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:24:51,252 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:24:51,269 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;@43670360, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:24:51,270 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:24:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 470 states, 368 states have (on average 1.5081521739130435) internal successors, (555), 387 states have internal predecessors, (555), 87 states have call successors, (87), 13 states have call predecessors, (87), 13 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-11-02 20:24:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:24:51,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:51,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:51,295 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:51,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:51,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1469618458, now seen corresponding path program 1 times [2022-11-02 20:24:51,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:51,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126962476] [2022-11-02 20:24:51,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:51,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:51,575 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:24:51,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:51,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126962476] [2022-11-02 20:24:51,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126962476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:51,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:51,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:24:51,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282464707] [2022-11-02 20:24:51,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:51,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:24:51,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:51,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:24:51,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:24:51,616 INFO L87 Difference]: Start difference. First operand has 470 states, 368 states have (on average 1.5081521739130435) internal successors, (555), 387 states have internal predecessors, (555), 87 states have call successors, (87), 13 states have call predecessors, (87), 13 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) 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:24:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:51,784 INFO L93 Difference]: Finished difference Result 813 states and 1302 transitions. [2022-11-02 20:24:51,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:24:51,787 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:24:51,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:51,806 INFO L225 Difference]: With dead ends: 813 [2022-11-02 20:24:51,811 INFO L226 Difference]: Without dead ends: 463 [2022-11-02 20:24:51,820 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:24:51,824 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 8 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:51,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1357 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:24:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-11-02 20:24:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2022-11-02 20:24:51,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 363 states have (on average 1.4765840220385675) internal successors, (536), 380 states have internal predecessors, (536), 87 states have call successors, (87), 13 states have call predecessors, (87), 12 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2022-11-02 20:24:51,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 694 transitions. [2022-11-02 20:24:51,949 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 694 transitions. Word has length 13 [2022-11-02 20:24:51,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:51,956 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 694 transitions. [2022-11-02 20:24:51,957 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:24:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 694 transitions. [2022-11-02 20:24:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:24:51,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:51,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:51,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:24:51,959 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:51,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:51,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1712839840, now seen corresponding path program 1 times [2022-11-02 20:24:51,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:51,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175399903] [2022-11-02 20:24:51,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:51,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:52,101 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:24:52,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:52,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175399903] [2022-11-02 20:24:52,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175399903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:52,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:52,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:24:52,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749305655] [2022-11-02 20:24:52,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:52,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:24:52,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:52,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:24:52,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:24:52,107 INFO L87 Difference]: Start difference. First operand 463 states and 694 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:24:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:52,353 INFO L93 Difference]: Finished difference Result 708 states and 1039 transitions. [2022-11-02 20:24:52,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:24:52,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 15 [2022-11-02 20:24:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:52,364 INFO L225 Difference]: With dead ends: 708 [2022-11-02 20:24:52,365 INFO L226 Difference]: Without dead ends: 601 [2022-11-02 20:24:52,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:24:52,372 INFO L413 NwaCegarLoop]: 818 mSDtfsCounter, 569 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:52,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1045 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:24:52,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-11-02 20:24:52,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 581. [2022-11-02 20:24:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 467 states have (on average 1.436830835117773) internal successors, (671), 470 states have internal predecessors, (671), 93 states have call successors, (93), 21 states have call predecessors, (93), 20 states have return successors, (97), 91 states have call predecessors, (97), 81 states have call successors, (97) [2022-11-02 20:24:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 861 transitions. [2022-11-02 20:24:52,444 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 861 transitions. Word has length 15 [2022-11-02 20:24:52,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:52,444 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 861 transitions. [2022-11-02 20:24:52,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:24:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 861 transitions. [2022-11-02 20:24:52,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:24:52,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:52,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:52,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:24:52,446 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:52,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:52,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1900703522, now seen corresponding path program 1 times [2022-11-02 20:24:52,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:52,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009312235] [2022-11-02 20:24:52,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:52,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:52,604 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:24:52,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:52,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009312235] [2022-11-02 20:24:52,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009312235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:52,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:52,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:24:52,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671199002] [2022-11-02 20:24:52,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:52,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:24:52,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:24:52,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:24:52,606 INFO L87 Difference]: Start difference. First operand 581 states and 861 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:24:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:52,661 INFO L93 Difference]: Finished difference Result 864 states and 1250 transitions. [2022-11-02 20:24:52,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:24:52,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-11-02 20:24:52,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:52,667 INFO L225 Difference]: With dead ends: 864 [2022-11-02 20:24:52,667 INFO L226 Difference]: Without dead ends: 727 [2022-11-02 20:24:52,668 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:24:52,669 INFO L413 NwaCegarLoop]: 682 mSDtfsCounter, 608 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:52,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 872 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:24:52,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-11-02 20:24:52,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 689. [2022-11-02 20:24:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 565 states have (on average 1.4336283185840708) internal successors, (810), 564 states have internal predecessors, (810), 94 states have call successors, (94), 26 states have call predecessors, (94), 29 states have return successors, (110), 98 states have call predecessors, (110), 85 states have call successors, (110) [2022-11-02 20:24:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1014 transitions. [2022-11-02 20:24:52,758 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1014 transitions. Word has length 19 [2022-11-02 20:24:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:52,759 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 1014 transitions. [2022-11-02 20:24:52,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:24:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1014 transitions. [2022-11-02 20:24:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:24:52,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:52,770 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] [2022-11-02 20:24:52,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:24:52,771 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:52,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2011147442, now seen corresponding path program 1 times [2022-11-02 20:24:52,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:52,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39857391] [2022-11-02 20:24:52,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:52,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:52,854 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:24:52,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:52,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39857391] [2022-11-02 20:24:52,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39857391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:52,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:52,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:24:52,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596852488] [2022-11-02 20:24:52,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:52,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:24:52,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:52,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:24:52,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:24:52,858 INFO L87 Difference]: Start difference. First operand 689 states and 1014 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:24:53,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:53,121 INFO L93 Difference]: Finished difference Result 1296 states and 1967 transitions. [2022-11-02 20:24:53,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:24:53,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 21 [2022-11-02 20:24:53,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:53,130 INFO L225 Difference]: With dead ends: 1296 [2022-11-02 20:24:53,130 INFO L226 Difference]: Without dead ends: 1061 [2022-11-02 20:24:53,132 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:24:53,133 INFO L413 NwaCegarLoop]: 1012 mSDtfsCounter, 341 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:53,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1631 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:24:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2022-11-02 20:24:53,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 821. [2022-11-02 20:24:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 674 states have (on average 1.4347181008902077) internal successors, (967), 672 states have internal predecessors, (967), 107 states have call successors, (107), 34 states have call predecessors, (107), 39 states have return successors, (172), 114 states have call predecessors, (172), 98 states have call successors, (172) [2022-11-02 20:24:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1246 transitions. [2022-11-02 20:24:53,226 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1246 transitions. Word has length 21 [2022-11-02 20:24:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:53,226 INFO L495 AbstractCegarLoop]: Abstraction has 821 states and 1246 transitions. [2022-11-02 20:24:53,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:24:53,227 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1246 transitions. [2022-11-02 20:24:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:24:53,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:53,229 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] [2022-11-02 20:24:53,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:24:53,229 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:53,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:53,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1977476652, now seen corresponding path program 1 times [2022-11-02 20:24:53,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:53,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313554745] [2022-11-02 20:24:53,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:53,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:53,409 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:24:53,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:53,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313554745] [2022-11-02 20:24:53,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313554745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:53,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:53,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:53,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673160360] [2022-11-02 20:24:53,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:53,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:53,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:53,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:53,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:53,412 INFO L87 Difference]: Start difference. First operand 821 states and 1246 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:24:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:53,949 INFO L93 Difference]: Finished difference Result 1378 states and 2097 transitions. [2022-11-02 20:24:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:53,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 22 [2022-11-02 20:24:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:53,954 INFO L225 Difference]: With dead ends: 1378 [2022-11-02 20:24:53,955 INFO L226 Difference]: Without dead ends: 833 [2022-11-02 20:24:53,957 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:24:53,962 INFO L413 NwaCegarLoop]: 712 mSDtfsCounter, 1042 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:53,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 866 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:24:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2022-11-02 20:24:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 809. [2022-11-02 20:24:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 664 states have (on average 1.4292168674698795) internal successors, (949), 662 states have internal predecessors, (949), 105 states have call successors, (105), 32 states have call predecessors, (105), 39 states have return successors, (168), 114 states have call predecessors, (168), 96 states have call successors, (168) [2022-11-02 20:24:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1222 transitions. [2022-11-02 20:24:54,050 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1222 transitions. Word has length 22 [2022-11-02 20:24:54,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:54,051 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1222 transitions. [2022-11-02 20:24:54,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:24:54,051 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1222 transitions. [2022-11-02 20:24:54,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:24:54,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:54,055 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] [2022-11-02 20:24:54,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:24:54,056 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:54,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:54,057 INFO L85 PathProgramCache]: Analyzing trace with hash -401986458, now seen corresponding path program 1 times [2022-11-02 20:24:54,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:54,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416678742] [2022-11-02 20:24:54,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:54,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:54,109 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:24:54,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:54,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416678742] [2022-11-02 20:24:54,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416678742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:54,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:54,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:24:54,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230929260] [2022-11-02 20:24:54,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:54,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:24:54,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:54,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:24:54,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:24:54,114 INFO L87 Difference]: Start difference. First operand 809 states and 1222 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:24:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:54,218 INFO L93 Difference]: Finished difference Result 812 states and 1224 transitions. [2022-11-02 20:24:54,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:24:54,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 23 [2022-11-02 20:24:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:54,224 INFO L225 Difference]: With dead ends: 812 [2022-11-02 20:24:54,224 INFO L226 Difference]: Without dead ends: 808 [2022-11-02 20:24:54,225 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:24:54,228 INFO L413 NwaCegarLoop]: 652 mSDtfsCounter, 22 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:54,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1258 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:24:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-11-02 20:24:54,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2022-11-02 20:24:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 664 states have (on average 1.4262048192771084) internal successors, (947), 661 states have internal predecessors, (947), 104 states have call successors, (104), 32 states have call predecessors, (104), 39 states have return successors, (168), 114 states have call predecessors, (168), 96 states have call successors, (168) [2022-11-02 20:24:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1219 transitions. [2022-11-02 20:24:54,296 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1219 transitions. Word has length 23 [2022-11-02 20:24:54,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:54,296 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 1219 transitions. [2022-11-02 20:24:54,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:24:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1219 transitions. [2022-11-02 20:24:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:24:54,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:54,299 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] [2022-11-02 20:24:54,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:24:54,299 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:54,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:54,300 INFO L85 PathProgramCache]: Analyzing trace with hash 18720905, now seen corresponding path program 1 times [2022-11-02 20:24:54,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:54,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831892216] [2022-11-02 20:24:54,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:54,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:54,388 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:24:54,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:54,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831892216] [2022-11-02 20:24:54,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831892216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:54,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:54,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:54,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183050657] [2022-11-02 20:24:54,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:54,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:54,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:54,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:54,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:54,391 INFO L87 Difference]: Start difference. First operand 808 states and 1219 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:54,576 INFO L93 Difference]: Finished difference Result 1228 states and 1788 transitions. [2022-11-02 20:24:54,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:24:54,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:24:54,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:54,582 INFO L225 Difference]: With dead ends: 1228 [2022-11-02 20:24:54,582 INFO L226 Difference]: Without dead ends: 812 [2022-11-02 20:24:54,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:24:54,589 INFO L413 NwaCegarLoop]: 766 mSDtfsCounter, 323 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:54,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1958 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:24:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-02 20:24:54,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 683. [2022-11-02 20:24:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 560 states have (on average 1.4089285714285715) internal successors, (789), 559 states have internal predecessors, (789), 89 states have call successors, (89), 28 states have call predecessors, (89), 33 states have return successors, (109), 95 states have call predecessors, (109), 81 states have call successors, (109) [2022-11-02 20:24:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 987 transitions. [2022-11-02 20:24:54,660 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 987 transitions. Word has length 28 [2022-11-02 20:24:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:54,662 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 987 transitions. [2022-11-02 20:24:54,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 987 transitions. [2022-11-02 20:24:54,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:24:54,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:54,666 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] [2022-11-02 20:24:54,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:24:54,667 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:54,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:54,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1728135655, now seen corresponding path program 1 times [2022-11-02 20:24:54,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:54,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077856224] [2022-11-02 20:24:54,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:54,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:54,787 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:24:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:54,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077856224] [2022-11-02 20:24:54,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077856224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:54,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:54,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:24:54,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245363446] [2022-11-02 20:24:54,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:54,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:24:54,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:54,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:24:54,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:24:54,790 INFO L87 Difference]: Start difference. First operand 683 states and 987 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:54,869 INFO L93 Difference]: Finished difference Result 768 states and 1098 transitions. [2022-11-02 20:24:54,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:24:54,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:24:54,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:54,874 INFO L225 Difference]: With dead ends: 768 [2022-11-02 20:24:54,874 INFO L226 Difference]: Without dead ends: 748 [2022-11-02 20:24:54,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:24:54,878 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 628 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:54,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 721 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:24:54,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-11-02 20:24:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 711. [2022-11-02 20:24:54,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 586 states have (on average 1.418088737201365) internal successors, (831), 592 states have internal predecessors, (831), 89 states have call successors, (89), 29 states have call predecessors, (89), 35 states have return successors, (104), 89 states have call predecessors, (104), 82 states have call successors, (104) [2022-11-02 20:24:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1024 transitions. [2022-11-02 20:24:54,940 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1024 transitions. Word has length 29 [2022-11-02 20:24:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:54,941 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 1024 transitions. [2022-11-02 20:24:54,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1024 transitions. [2022-11-02 20:24:54,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:24:54,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:54,946 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] [2022-11-02 20:24:54,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:24:54,947 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:54,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:54,947 INFO L85 PathProgramCache]: Analyzing trace with hash -881374565, now seen corresponding path program 1 times [2022-11-02 20:24:54,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:54,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433745807] [2022-11-02 20:24:54,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:54,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:55,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:24:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:55,029 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:24:55,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:55,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433745807] [2022-11-02 20:24:55,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433745807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:55,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:55,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:55,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705035318] [2022-11-02 20:24:55,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:55,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:55,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:55,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:55,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:55,036 INFO L87 Difference]: Start difference. First operand 711 states and 1024 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:24:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:55,365 INFO L93 Difference]: Finished difference Result 1007 states and 1455 transitions. [2022-11-02 20:24:55,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:24:55,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-11-02 20:24:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:55,370 INFO L225 Difference]: With dead ends: 1007 [2022-11-02 20:24:55,370 INFO L226 Difference]: Without dead ends: 780 [2022-11-02 20:24:55,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:24:55,374 INFO L413 NwaCegarLoop]: 732 mSDtfsCounter, 254 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:55,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1782 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:24:55,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2022-11-02 20:24:55,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 694. [2022-11-02 20:24:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 571 states have (on average 1.4133099824868651) internal successors, (807), 579 states have internal predecessors, (807), 88 states have call successors, (88), 28 states have call predecessors, (88), 34 states have return successors, (100), 86 states have call predecessors, (100), 81 states have call successors, (100) [2022-11-02 20:24:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 995 transitions. [2022-11-02 20:24:55,445 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 995 transitions. Word has length 35 [2022-11-02 20:24:55,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:55,446 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 995 transitions. [2022-11-02 20:24:55,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:24:55,446 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 995 transitions. [2022-11-02 20:24:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:24:55,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:55,450 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] [2022-11-02 20:24:55,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:24:55,450 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:55,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:55,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1008894041, now seen corresponding path program 1 times [2022-11-02 20:24:55,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:55,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067450716] [2022-11-02 20:24:55,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:55,531 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:24:55,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:55,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067450716] [2022-11-02 20:24:55,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067450716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:55,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:55,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:55,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764084793] [2022-11-02 20:24:55,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:55,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:55,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:55,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:55,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:55,533 INFO L87 Difference]: Start difference. First operand 694 states and 995 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:24:55,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:55,939 INFO L93 Difference]: Finished difference Result 754 states and 1071 transitions. [2022-11-02 20:24:55,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:55,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 32 [2022-11-02 20:24:55,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:55,944 INFO L225 Difference]: With dead ends: 754 [2022-11-02 20:24:55,944 INFO L226 Difference]: Without dead ends: 712 [2022-11-02 20:24:55,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:24:55,945 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 696 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:55,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1109 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:24:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-11-02 20:24:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 694. [2022-11-02 20:24:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 571 states have (on average 1.4098073555166375) internal successors, (805), 579 states have internal predecessors, (805), 88 states have call successors, (88), 28 states have call predecessors, (88), 34 states have return successors, (100), 86 states have call predecessors, (100), 81 states have call successors, (100) [2022-11-02 20:24:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 993 transitions. [2022-11-02 20:24:56,042 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 993 transitions. Word has length 32 [2022-11-02 20:24:56,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:56,043 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 993 transitions. [2022-11-02 20:24:56,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:24:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 993 transitions. [2022-11-02 20:24:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:24:56,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:56,046 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] [2022-11-02 20:24:56,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:24:56,047 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:56,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:56,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1219758973, now seen corresponding path program 1 times [2022-11-02 20:24:56,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:56,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481092287] [2022-11-02 20:24:56,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:56,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:56,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:24:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:56,103 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:24:56,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:56,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481092287] [2022-11-02 20:24:56,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481092287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:56,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:56,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:56,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022511464] [2022-11-02 20:24:56,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:56,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:56,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:56,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:56,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:56,109 INFO L87 Difference]: Start difference. First operand 694 states and 993 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 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:24:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:56,437 INFO L93 Difference]: Finished difference Result 779 states and 1121 transitions. [2022-11-02 20:24:56,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:24:56,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-11-02 20:24:56,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:56,441 INFO L225 Difference]: With dead ends: 779 [2022-11-02 20:24:56,442 INFO L226 Difference]: Without dead ends: 719 [2022-11-02 20:24:56,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:24:56,443 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 706 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:56,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1259 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:24:56,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-11-02 20:24:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 683. [2022-11-02 20:24:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 564 states have (on average 1.4113475177304964) internal successors, (796), 572 states have internal predecessors, (796), 86 states have call successors, (86), 26 states have call predecessors, (86), 32 states have return successors, (98), 84 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 20:24:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 980 transitions. [2022-11-02 20:24:56,512 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 980 transitions. Word has length 36 [2022-11-02 20:24:56,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:56,512 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 980 transitions. [2022-11-02 20:24:56,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 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:24:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 980 transitions. [2022-11-02 20:24:56,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:24:56,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:56,515 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] [2022-11-02 20:24:56,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:24:56,516 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:56,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:56,516 INFO L85 PathProgramCache]: Analyzing trace with hash 138802018, now seen corresponding path program 1 times [2022-11-02 20:24:56,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:56,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062418595] [2022-11-02 20:24:56,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:56,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:56,558 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:24:56,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:56,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062418595] [2022-11-02 20:24:56,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062418595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:56,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:56,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:24:56,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97592526] [2022-11-02 20:24:56,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:56,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:24:56,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:56,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:24:56,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:24:56,561 INFO L87 Difference]: Start difference. First operand 683 states and 980 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:24:56,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:56,709 INFO L93 Difference]: Finished difference Result 851 states and 1212 transitions. [2022-11-02 20:24:56,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:24:56,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 34 [2022-11-02 20:24:56,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:56,741 INFO L225 Difference]: With dead ends: 851 [2022-11-02 20:24:56,741 INFO L226 Difference]: Without dead ends: 835 [2022-11-02 20:24:56,742 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:24:56,743 INFO L413 NwaCegarLoop]: 774 mSDtfsCounter, 135 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:56,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1390 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:24:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-11-02 20:24:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 734. [2022-11-02 20:24:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 611 states have (on average 1.386252045826514) internal successors, (847), 612 states have internal predecessors, (847), 86 states have call successors, (86), 26 states have call predecessors, (86), 36 states have return successors, (109), 95 states have call predecessors, (109), 79 states have call successors, (109) [2022-11-02 20:24:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1042 transitions. [2022-11-02 20:24:56,827 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1042 transitions. Word has length 34 [2022-11-02 20:24:56,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:56,828 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1042 transitions. [2022-11-02 20:24:56,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:24:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1042 transitions. [2022-11-02 20:24:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:24:56,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:56,832 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] [2022-11-02 20:24:56,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:24:56,833 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:56,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:56,833 INFO L85 PathProgramCache]: Analyzing trace with hash -298326112, now seen corresponding path program 1 times [2022-11-02 20:24:56,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:56,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894226772] [2022-11-02 20:24:56,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:56,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:56,969 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:24:56,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:56,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894226772] [2022-11-02 20:24:56,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894226772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:56,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:56,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:56,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802172970] [2022-11-02 20:24:56,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:56,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:56,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:56,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:56,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:56,973 INFO L87 Difference]: Start difference. First operand 734 states and 1042 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:24:57,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:57,345 INFO L93 Difference]: Finished difference Result 762 states and 1073 transitions. [2022-11-02 20:24:57,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:57,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 34 [2022-11-02 20:24:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:57,351 INFO L225 Difference]: With dead ends: 762 [2022-11-02 20:24:57,351 INFO L226 Difference]: Without dead ends: 715 [2022-11-02 20:24:57,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:24:57,353 INFO L413 NwaCegarLoop]: 643 mSDtfsCounter, 674 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:57,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1105 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:24:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-11-02 20:24:57,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 705. [2022-11-02 20:24:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 585 states have (on average 1.3914529914529914) internal successors, (814), 592 states have internal predecessors, (814), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 20:24:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 998 transitions. [2022-11-02 20:24:57,440 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 998 transitions. Word has length 34 [2022-11-02 20:24:57,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:57,440 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 998 transitions. [2022-11-02 20:24:57,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:24:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 998 transitions. [2022-11-02 20:24:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:24:57,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:57,443 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] [2022-11-02 20:24:57,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:24:57,444 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:57,444 INFO L85 PathProgramCache]: Analyzing trace with hash 452395620, now seen corresponding path program 1 times [2022-11-02 20:24:57,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:57,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637668793] [2022-11-02 20:24:57,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:57,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:57,585 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:24:57,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:57,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637668793] [2022-11-02 20:24:57,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637668793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:57,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:57,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:57,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916141083] [2022-11-02 20:24:57,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:57,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:57,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:57,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:57,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:57,588 INFO L87 Difference]: Start difference. First operand 705 states and 998 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:24:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:58,047 INFO L93 Difference]: Finished difference Result 806 states and 1144 transitions. [2022-11-02 20:24:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:58,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 35 [2022-11-02 20:24:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:58,052 INFO L225 Difference]: With dead ends: 806 [2022-11-02 20:24:58,052 INFO L226 Difference]: Without dead ends: 802 [2022-11-02 20:24:58,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:24:58,054 INFO L413 NwaCegarLoop]: 741 mSDtfsCounter, 747 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:58,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1199 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:24:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-11-02 20:24:58,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 708. [2022-11-02 20:24:58,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 588 states have (on average 1.3911564625850341) internal successors, (818), 595 states have internal predecessors, (818), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 20:24:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1002 transitions. [2022-11-02 20:24:58,145 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1002 transitions. Word has length 35 [2022-11-02 20:24:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:58,146 INFO L495 AbstractCegarLoop]: Abstraction has 708 states and 1002 transitions. [2022-11-02 20:24:58,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:24:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1002 transitions. [2022-11-02 20:24:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:24:58,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:58,148 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] [2022-11-02 20:24:58,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:24:58,149 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:58,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:58,149 INFO L85 PathProgramCache]: Analyzing trace with hash 452672450, now seen corresponding path program 1 times [2022-11-02 20:24:58,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:58,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507097174] [2022-11-02 20:24:58,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:58,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:58,213 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:24:58,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:58,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507097174] [2022-11-02 20:24:58,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507097174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:58,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:58,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:24:58,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352825572] [2022-11-02 20:24:58,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:58,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:24:58,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:58,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:24:58,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:24:58,216 INFO L87 Difference]: Start difference. First operand 708 states and 1002 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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:24:58,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:58,370 INFO L93 Difference]: Finished difference Result 721 states and 1015 transitions. [2022-11-02 20:24:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:24:58,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 35 [2022-11-02 20:24:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:58,374 INFO L225 Difference]: With dead ends: 721 [2022-11-02 20:24:58,375 INFO L226 Difference]: Without dead ends: 691 [2022-11-02 20:24:58,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:24:58,376 INFO L413 NwaCegarLoop]: 651 mSDtfsCounter, 38 mSDsluCounter, 2556 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3207 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:58,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3207 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:24:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-11-02 20:24:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2022-11-02 20:24:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 571 states have (on average 1.3975481611208407) internal successors, (798), 578 states have internal predecessors, (798), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 20:24:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 982 transitions. [2022-11-02 20:24:58,491 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 982 transitions. Word has length 35 [2022-11-02 20:24:58,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:58,492 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 982 transitions. [2022-11-02 20:24:58,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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:24:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 982 transitions. [2022-11-02 20:24:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:24:58,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:58,495 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:24:58,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:24:58,495 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:58,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:58,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1417116411, now seen corresponding path program 1 times [2022-11-02 20:24:58,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:58,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403662886] [2022-11-02 20:24:58,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:58,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:58,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:24:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:58,541 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:24:58,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:58,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403662886] [2022-11-02 20:24:58,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403662886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:58,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:58,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:58,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026890520] [2022-11-02 20:24:58,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:58,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:58,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:58,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:58,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:58,546 INFO L87 Difference]: Start difference. First operand 691 states and 982 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:24:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:58,914 INFO L93 Difference]: Finished difference Result 732 states and 1051 transitions. [2022-11-02 20:24:58,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:24:58,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:24:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:58,918 INFO L225 Difference]: With dead ends: 732 [2022-11-02 20:24:58,918 INFO L226 Difference]: Without dead ends: 725 [2022-11-02 20:24:58,919 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:24:58,919 INFO L413 NwaCegarLoop]: 628 mSDtfsCounter, 153 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:58,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1553 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:24:58,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-11-02 20:24:59,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 705. [2022-11-02 20:24:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 585 states have (on average 1.393162393162393) internal successors, (815), 592 states have internal predecessors, (815), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 20:24:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 999 transitions. [2022-11-02 20:24:59,007 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 999 transitions. Word has length 37 [2022-11-02 20:24:59,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:59,007 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 999 transitions. [2022-11-02 20:24:59,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:24:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 999 transitions. [2022-11-02 20:24:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:24:59,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:59,010 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:24:59,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:24:59,011 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:59,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:59,011 INFO L85 PathProgramCache]: Analyzing trace with hash 607738208, now seen corresponding path program 1 times [2022-11-02 20:24:59,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:59,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857576612] [2022-11-02 20:24:59,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:59,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:59,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:24:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:59,197 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:24:59,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:59,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857576612] [2022-11-02 20:24:59,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857576612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:59,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:59,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:24:59,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817268062] [2022-11-02 20:24:59,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:59,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:24:59,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:59,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:24:59,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:24:59,200 INFO L87 Difference]: Start difference. First operand 705 states and 999 transitions. Second operand has 6 states, 6 states have (on average 6.0) 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:24:59,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:59,892 INFO L93 Difference]: Finished difference Result 731 states and 1047 transitions. [2022-11-02 20:24:59,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:24:59,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) 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:24:59,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:59,897 INFO L225 Difference]: With dead ends: 731 [2022-11-02 20:24:59,897 INFO L226 Difference]: Without dead ends: 725 [2022-11-02 20:24:59,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:24:59,898 INFO L413 NwaCegarLoop]: 622 mSDtfsCounter, 750 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:59,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1884 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:24:59,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-11-02 20:25:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 705. [2022-11-02 20:25:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 585 states have (on average 1.3914529914529914) internal successors, (814), 592 states have internal predecessors, (814), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 20:25:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 998 transitions. [2022-11-02 20:25:00,005 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 998 transitions. Word has length 39 [2022-11-02 20:25:00,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:00,006 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 998 transitions. [2022-11-02 20:25:00,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) 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:25:00,006 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 998 transitions. [2022-11-02 20:25:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:25:00,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:00,009 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:25:00,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:25:00,009 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:00,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:00,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1973073460, now seen corresponding path program 1 times [2022-11-02 20:25:00,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:00,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820921795] [2022-11-02 20:25:00,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:00,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:00,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:25:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:00,135 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:25:00,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:00,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820921795] [2022-11-02 20:25:00,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820921795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:00,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:00,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:25:00,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465440423] [2022-11-02 20:25:00,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:00,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:25:00,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:00,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:25:00,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:00,138 INFO L87 Difference]: Start difference. First operand 705 states and 998 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 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:25:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:00,699 INFO L93 Difference]: Finished difference Result 744 states and 1063 transitions. [2022-11-02 20:25:00,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:25:00,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 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:25:00,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:00,704 INFO L225 Difference]: With dead ends: 744 [2022-11-02 20:25:00,704 INFO L226 Difference]: Without dead ends: 712 [2022-11-02 20:25:00,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:25:00,705 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 158 mSDsluCounter, 3356 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 3977 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:00,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 3977 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:25:00,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-11-02 20:25:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 696. [2022-11-02 20:25:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 578 states have (on average 1.3737024221453287) internal successors, (794), 585 states have internal predecessors, (794), 84 states have call successors, (84), 26 states have call predecessors, (84), 33 states have return successors, (96), 84 states have call predecessors, (96), 77 states have call successors, (96) [2022-11-02 20:25:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 974 transitions. [2022-11-02 20:25:00,793 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 974 transitions. Word has length 40 [2022-11-02 20:25:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:00,793 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 974 transitions. [2022-11-02 20:25:00,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 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:25:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 974 transitions. [2022-11-02 20:25:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:25:00,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:00,796 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:25:00,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:25:00,796 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:00,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:00,797 INFO L85 PathProgramCache]: Analyzing trace with hash -577176493, now seen corresponding path program 1 times [2022-11-02 20:25:00,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:00,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292243719] [2022-11-02 20:25:00,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:00,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:00,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:25:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:00,856 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:25:00,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:00,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292243719] [2022-11-02 20:25:00,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292243719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:00,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:00,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:25:00,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407143256] [2022-11-02 20:25:00,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:00,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:25:00,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:00,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:25:00,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:25:00,859 INFO L87 Difference]: Start difference. First operand 696 states and 974 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 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:25:01,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:01,498 INFO L93 Difference]: Finished difference Result 777 states and 1087 transitions. [2022-11-02 20:25:01,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:25:01,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 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:25:01,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:01,502 INFO L225 Difference]: With dead ends: 777 [2022-11-02 20:25:01,503 INFO L226 Difference]: Without dead ends: 741 [2022-11-02 20:25:01,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:01,504 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 792 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:01,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1517 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:25:01,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-11-02 20:25:01,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 696. [2022-11-02 20:25:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 578 states have (on average 1.3719723183391004) internal successors, (793), 585 states have internal predecessors, (793), 84 states have call successors, (84), 26 states have call predecessors, (84), 33 states have return successors, (96), 84 states have call predecessors, (96), 77 states have call successors, (96) [2022-11-02 20:25:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 973 transitions. [2022-11-02 20:25:01,615 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 973 transitions. Word has length 41 [2022-11-02 20:25:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:01,615 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 973 transitions. [2022-11-02 20:25:01,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 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:25:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 973 transitions. [2022-11-02 20:25:01,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:25:01,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:01,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:01,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:25:01,619 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:01,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:01,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1220210391, now seen corresponding path program 1 times [2022-11-02 20:25:01,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:01,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586246923] [2022-11-02 20:25:01,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:01,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:01,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:25:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:01,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:25:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:01,676 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:25:01,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:01,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586246923] [2022-11-02 20:25:01,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586246923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:01,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:01,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:25:01,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502975308] [2022-11-02 20:25:01,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:01,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:25:01,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:01,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:25:01,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:25:01,679 INFO L87 Difference]: Start difference. First operand 696 states and 973 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:02,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:02,256 INFO L93 Difference]: Finished difference Result 906 states and 1276 transitions. [2022-11-02 20:25:02,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:25:02,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-11-02 20:25:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:02,260 INFO L225 Difference]: With dead ends: 906 [2022-11-02 20:25:02,260 INFO L226 Difference]: Without dead ends: 688 [2022-11-02 20:25:02,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:02,262 INFO L413 NwaCegarLoop]: 605 mSDtfsCounter, 252 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:02,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1799 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:25:02,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-11-02 20:25:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 672. [2022-11-02 20:25:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 557 states have (on average 1.3698384201077198) internal successors, (763), 563 states have internal predecessors, (763), 83 states have call successors, (83), 26 states have call predecessors, (83), 31 states have return successors, (94), 82 states have call predecessors, (94), 77 states have call successors, (94) [2022-11-02 20:25:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 940 transitions. [2022-11-02 20:25:02,349 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 940 transitions. Word has length 43 [2022-11-02 20:25:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:02,350 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 940 transitions. [2022-11-02 20:25:02,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:02,350 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 940 transitions. [2022-11-02 20:25:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:25:02,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:02,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:02,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:25:02,354 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:02,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:02,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1828304678, now seen corresponding path program 1 times [2022-11-02 20:25:02,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:02,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644125980] [2022-11-02 20:25:02,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:02,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:02,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:25:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:02,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:02,666 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:25:02,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:02,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644125980] [2022-11-02 20:25:02,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644125980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:02,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:02,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:25:02,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554764514] [2022-11-02 20:25:02,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:02,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:25:02,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:02,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:25:02,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:25:02,669 INFO L87 Difference]: Start difference. First operand 672 states and 940 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:03,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:03,785 INFO L93 Difference]: Finished difference Result 702 states and 994 transitions. [2022-11-02 20:25:03,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:25:03,785 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-11-02 20:25:03,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:03,789 INFO L225 Difference]: With dead ends: 702 [2022-11-02 20:25:03,789 INFO L226 Difference]: Without dead ends: 686 [2022-11-02 20:25:03,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:25:03,791 INFO L413 NwaCegarLoop]: 611 mSDtfsCounter, 98 mSDsluCounter, 3850 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 4461 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:03,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 4461 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:25:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-11-02 20:25:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 670. [2022-11-02 20:25:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 556 states have (on average 1.368705035971223) internal successors, (761), 562 states have internal predecessors, (761), 82 states have call successors, (82), 26 states have call predecessors, (82), 31 states have return successors, (93), 81 states have call predecessors, (93), 76 states have call successors, (93) [2022-11-02 20:25:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 936 transitions. [2022-11-02 20:25:03,876 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 936 transitions. Word has length 43 [2022-11-02 20:25:03,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:03,876 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 936 transitions. [2022-11-02 20:25:03,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:03,876 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 936 transitions. [2022-11-02 20:25:03,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 20:25:03,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:03,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:03,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:25:03,880 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:03,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:03,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1534576112, now seen corresponding path program 1 times [2022-11-02 20:25:03,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:03,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302478930] [2022-11-02 20:25:03,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:03,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:04,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:25:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:04,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:04,193 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:25:04,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:04,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302478930] [2022-11-02 20:25:04,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302478930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:04,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:04,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:25:04,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435114849] [2022-11-02 20:25:04,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:04,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:25:04,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:04,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:25:04,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:25:04,196 INFO L87 Difference]: Start difference. First operand 670 states and 936 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 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:25:05,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:05,552 INFO L93 Difference]: Finished difference Result 722 states and 1014 transitions. [2022-11-02 20:25:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:25:05,552 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 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) Word has length 47 [2022-11-02 20:25:05,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:05,556 INFO L225 Difference]: With dead ends: 722 [2022-11-02 20:25:05,556 INFO L226 Difference]: Without dead ends: 702 [2022-11-02 20:25:05,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:25:05,558 INFO L413 NwaCegarLoop]: 597 mSDtfsCounter, 247 mSDsluCounter, 4106 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 4703 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:05,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 4703 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:25:05,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-11-02 20:25:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 668. [2022-11-02 20:25:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 555 states have (on average 1.3675675675675676) internal successors, (759), 561 states have internal predecessors, (759), 81 states have call successors, (81), 26 states have call predecessors, (81), 31 states have return successors, (92), 80 states have call predecessors, (92), 75 states have call successors, (92) [2022-11-02 20:25:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 932 transitions. [2022-11-02 20:25:05,643 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 932 transitions. Word has length 47 [2022-11-02 20:25:05,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:05,643 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 932 transitions. [2022-11-02 20:25:05,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 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:25:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 932 transitions. [2022-11-02 20:25:05,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:25:05,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:05,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:05,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:25:05,646 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:05,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:05,647 INFO L85 PathProgramCache]: Analyzing trace with hash 397890919, now seen corresponding path program 1 times [2022-11-02 20:25:05,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:05,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134782070] [2022-11-02 20:25:05,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:05,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:05,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:25:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:05,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:05,947 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:25:05,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:05,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134782070] [2022-11-02 20:25:05,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134782070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:05,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:05,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:25:05,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983657158] [2022-11-02 20:25:05,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:05,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:25:05,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:05,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:25:05,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:25:05,951 INFO L87 Difference]: Start difference. First operand 668 states and 932 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 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:25:07,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:07,290 INFO L93 Difference]: Finished difference Result 720 states and 1010 transitions. [2022-11-02 20:25:07,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:25:07,291 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 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) Word has length 44 [2022-11-02 20:25:07,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:07,295 INFO L225 Difference]: With dead ends: 720 [2022-11-02 20:25:07,295 INFO L226 Difference]: Without dead ends: 699 [2022-11-02 20:25:07,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:25:07,297 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 168 mSDsluCounter, 4915 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 5496 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:07,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 5496 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:25:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-11-02 20:25:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 667. [2022-11-02 20:25:07,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 554 states have (on average 1.3501805054151625) internal successors, (748), 560 states have internal predecessors, (748), 81 states have call successors, (81), 26 states have call predecessors, (81), 31 states have return successors, (92), 80 states have call predecessors, (92), 75 states have call successors, (92) [2022-11-02 20:25:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 921 transitions. [2022-11-02 20:25:07,379 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 921 transitions. Word has length 44 [2022-11-02 20:25:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:07,380 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 921 transitions. [2022-11-02 20:25:07,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 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:25:07,380 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 921 transitions. [2022-11-02 20:25:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:25:07,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:07,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:07,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:25:07,383 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:07,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:07,383 INFO L85 PathProgramCache]: Analyzing trace with hash 117751789, now seen corresponding path program 1 times [2022-11-02 20:25:07,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:07,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654602536] [2022-11-02 20:25:07,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:07,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:07,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:25:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:07,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:07,630 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:25:07,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:07,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654602536] [2022-11-02 20:25:07,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654602536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:07,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:07,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:25:07,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043828799] [2022-11-02 20:25:07,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:07,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:25:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:07,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:25:07,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:25:07,636 INFO L87 Difference]: Start difference. First operand 667 states and 921 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:08,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:08,628 INFO L93 Difference]: Finished difference Result 696 states and 974 transitions. [2022-11-02 20:25:08,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:25:08,629 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-11-02 20:25:08,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:08,632 INFO L225 Difference]: With dead ends: 696 [2022-11-02 20:25:08,632 INFO L226 Difference]: Without dead ends: 680 [2022-11-02 20:25:08,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:25:08,633 INFO L413 NwaCegarLoop]: 589 mSDtfsCounter, 98 mSDsluCounter, 3693 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 4282 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:08,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 4282 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:25:08,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2022-11-02 20:25:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 664. [2022-11-02 20:25:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 552 states have (on average 1.3496376811594204) internal successors, (745), 558 states have internal predecessors, (745), 80 states have call successors, (80), 26 states have call predecessors, (80), 31 states have return successors, (91), 79 states have call predecessors, (91), 74 states have call successors, (91) [2022-11-02 20:25:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 916 transitions. [2022-11-02 20:25:08,717 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 916 transitions. Word has length 44 [2022-11-02 20:25:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:08,718 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 916 transitions. [2022-11-02 20:25:08,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 916 transitions. [2022-11-02 20:25:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:25:08,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:08,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:08,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:25:08,721 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash -914670889, now seen corresponding path program 1 times [2022-11-02 20:25:08,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:08,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24880787] [2022-11-02 20:25:08,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:08,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:08,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:25:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:08,842 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:25:08,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:08,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24880787] [2022-11-02 20:25:08,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24880787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:08,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:08,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:25:08,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226618736] [2022-11-02 20:25:08,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:08,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:25:08,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:08,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:25:08,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:08,845 INFO L87 Difference]: Start difference. First operand 664 states and 916 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 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:25:09,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:09,326 INFO L93 Difference]: Finished difference Result 698 states and 974 transitions. [2022-11-02 20:25:09,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:25:09,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 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 44 [2022-11-02 20:25:09,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:09,334 INFO L225 Difference]: With dead ends: 698 [2022-11-02 20:25:09,334 INFO L226 Difference]: Without dead ends: 668 [2022-11-02 20:25:09,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:25:09,340 INFO L413 NwaCegarLoop]: 572 mSDtfsCounter, 158 mSDsluCounter, 3081 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 3653 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:09,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 3653 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:25:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-11-02 20:25:09,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 652. [2022-11-02 20:25:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 543 states have (on average 1.3443830570902393) internal successors, (730), 549 states have internal predecessors, (730), 77 states have call successors, (77), 26 states have call predecessors, (77), 31 states have return successors, (88), 76 states have call predecessors, (88), 71 states have call successors, (88) [2022-11-02 20:25:09,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 895 transitions. [2022-11-02 20:25:09,441 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 895 transitions. Word has length 44 [2022-11-02 20:25:09,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:09,441 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 895 transitions. [2022-11-02 20:25:09,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 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:25:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 895 transitions. [2022-11-02 20:25:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:25:09,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:09,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:09,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:25:09,445 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:09,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:09,446 INFO L85 PathProgramCache]: Analyzing trace with hash -501722536, now seen corresponding path program 1 times [2022-11-02 20:25:09,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:09,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806708950] [2022-11-02 20:25:09,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:09,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:09,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:25:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:09,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:25:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:09,526 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:25:09,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:09,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806708950] [2022-11-02 20:25:09,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806708950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:09,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:09,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:25:09,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849581690] [2022-11-02 20:25:09,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:09,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:25:09,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:09,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:25:09,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:25:09,529 INFO L87 Difference]: Start difference. First operand 652 states and 895 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:25:10,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:10,051 INFO L93 Difference]: Finished difference Result 797 states and 1137 transitions. [2022-11-02 20:25:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:25:10,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-11-02 20:25:10,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:10,056 INFO L225 Difference]: With dead ends: 797 [2022-11-02 20:25:10,056 INFO L226 Difference]: Without dead ends: 703 [2022-11-02 20:25:10,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:25:10,058 INFO L413 NwaCegarLoop]: 538 mSDtfsCounter, 225 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:10,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1842 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:25:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2022-11-02 20:25:10,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 659. [2022-11-02 20:25:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 548 states have (on average 1.344890510948905) internal successors, (737), 555 states have internal predecessors, (737), 78 states have call successors, (78), 26 states have call predecessors, (78), 32 states have return successors, (95), 77 states have call predecessors, (95), 72 states have call successors, (95) [2022-11-02 20:25:10,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 910 transitions. [2022-11-02 20:25:10,144 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 910 transitions. Word has length 45 [2022-11-02 20:25:10,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:10,145 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 910 transitions. [2022-11-02 20:25:10,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:25:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 910 transitions. [2022-11-02 20:25:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:25:10,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:10,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:10,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:25:10,148 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:10,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:10,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1011195626, now seen corresponding path program 1 times [2022-11-02 20:25:10,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:10,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017426617] [2022-11-02 20:25:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:10,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:25:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:10,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:25:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:10,272 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:25:10,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:10,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017426617] [2022-11-02 20:25:10,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017426617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:10,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:10,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:25:10,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515145233] [2022-11-02 20:25:10,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:10,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:25:10,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:10,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:25:10,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:25:10,275 INFO L87 Difference]: Start difference. First operand 659 states and 910 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:25:10,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:10,917 INFO L93 Difference]: Finished difference Result 697 states and 978 transitions. [2022-11-02 20:25:10,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:25:10,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-11-02 20:25:10,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:10,923 INFO L225 Difference]: With dead ends: 697 [2022-11-02 20:25:10,923 INFO L226 Difference]: Without dead ends: 677 [2022-11-02 20:25:10,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:25:10,925 INFO L413 NwaCegarLoop]: 567 mSDtfsCounter, 161 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 3814 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:10,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 3814 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:25:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-11-02 20:25:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 657. [2022-11-02 20:25:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 547 states have (on average 1.3436928702010968) internal successors, (735), 554 states have internal predecessors, (735), 77 states have call successors, (77), 26 states have call predecessors, (77), 32 states have return successors, (94), 76 states have call predecessors, (94), 71 states have call successors, (94) [2022-11-02 20:25:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 906 transitions. [2022-11-02 20:25:11,046 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 906 transitions. Word has length 45 [2022-11-02 20:25:11,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:11,046 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 906 transitions. [2022-11-02 20:25:11,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:25:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 906 transitions. [2022-11-02 20:25:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:25:11,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:11,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:11,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:25:11,049 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:11,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:11,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1504244121, now seen corresponding path program 1 times [2022-11-02 20:25:11,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:11,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265770996] [2022-11-02 20:25:11,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:11,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:11,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:25:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:11,163 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:25:11,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:11,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265770996] [2022-11-02 20:25:11,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265770996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:11,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:11,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:25:11,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623448082] [2022-11-02 20:25:11,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:11,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:25:11,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:11,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:25:11,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:11,166 INFO L87 Difference]: Start difference. First operand 657 states and 906 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 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:25:11,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:11,688 INFO L93 Difference]: Finished difference Result 704 states and 988 transitions. [2022-11-02 20:25:11,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:25:11,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 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 45 [2022-11-02 20:25:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:11,693 INFO L225 Difference]: With dead ends: 704 [2022-11-02 20:25:11,693 INFO L226 Difference]: Without dead ends: 669 [2022-11-02 20:25:11,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:25:11,695 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 166 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 3532 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:11,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 3532 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:25:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-11-02 20:25:11,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 649. [2022-11-02 20:25:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 541 states have (on average 1.3364140480591498) internal successors, (723), 548 states have internal predecessors, (723), 75 states have call successors, (75), 26 states have call predecessors, (75), 32 states have return successors, (92), 74 states have call predecessors, (92), 69 states have call successors, (92) [2022-11-02 20:25:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 890 transitions. [2022-11-02 20:25:11,781 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 890 transitions. Word has length 45 [2022-11-02 20:25:11,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:11,782 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 890 transitions. [2022-11-02 20:25:11,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 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:25:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 890 transitions. [2022-11-02 20:25:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:25:11,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:11,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:11,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:25:11,785 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:11,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:11,786 INFO L85 PathProgramCache]: Analyzing trace with hash -945301524, now seen corresponding path program 1 times [2022-11-02 20:25:11,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:11,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607254432] [2022-11-02 20:25:11,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:11,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:11,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:25:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:12,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:12,090 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:25:12,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:12,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607254432] [2022-11-02 20:25:12,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607254432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:12,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:12,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:25:12,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418917233] [2022-11-02 20:25:12,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:12,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:25:12,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:12,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:25:12,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:25:12,093 INFO L87 Difference]: Start difference. First operand 649 states and 890 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:13,241 INFO L93 Difference]: Finished difference Result 684 states and 955 transitions. [2022-11-02 20:25:13,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:25:13,247 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-11-02 20:25:13,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:13,251 INFO L225 Difference]: With dead ends: 684 [2022-11-02 20:25:13,252 INFO L226 Difference]: Without dead ends: 666 [2022-11-02 20:25:13,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:25:13,254 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 110 mSDsluCounter, 3773 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 4317 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:13,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 4317 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:25:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-11-02 20:25:13,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 646. [2022-11-02 20:25:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 539 states have (on average 1.3358070500927643) internal successors, (720), 546 states have internal predecessors, (720), 74 states have call successors, (74), 26 states have call predecessors, (74), 32 states have return successors, (91), 73 states have call predecessors, (91), 68 states have call successors, (91) [2022-11-02 20:25:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 885 transitions. [2022-11-02 20:25:13,363 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 885 transitions. Word has length 46 [2022-11-02 20:25:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:13,363 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 885 transitions. [2022-11-02 20:25:13,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 885 transitions. [2022-11-02 20:25:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:25:13,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:13,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:13,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:25:13,367 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:13,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:13,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1146484836, now seen corresponding path program 1 times [2022-11-02 20:25:13,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:13,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618563040] [2022-11-02 20:25:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:13,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:13,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:25:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:13,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:25:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:13,449 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:25:13,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:13,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618563040] [2022-11-02 20:25:13,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618563040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:13,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:13,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:25:13,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005735252] [2022-11-02 20:25:13,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:13,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:25:13,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:13,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:25:13,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:13,452 INFO L87 Difference]: Start difference. First operand 646 states and 885 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 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:25:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:13,884 INFO L93 Difference]: Finished difference Result 703 states and 992 transitions. [2022-11-02 20:25:13,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:25:13,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 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) Word has length 46 [2022-11-02 20:25:13,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:13,889 INFO L225 Difference]: With dead ends: 703 [2022-11-02 20:25:13,889 INFO L226 Difference]: Without dead ends: 676 [2022-11-02 20:25:13,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:13,891 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 187 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:13,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 2309 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:25:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-11-02 20:25:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 650. [2022-11-02 20:25:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 541 states have (on average 1.33456561922366) internal successors, (722), 550 states have internal predecessors, (722), 74 states have call successors, (74), 26 states have call predecessors, (74), 34 states have return successors, (107), 73 states have call predecessors, (107), 68 states have call successors, (107) [2022-11-02 20:25:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 903 transitions. [2022-11-02 20:25:13,973 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 903 transitions. Word has length 46 [2022-11-02 20:25:13,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:13,973 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 903 transitions. [2022-11-02 20:25:13,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 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:25:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 903 transitions. [2022-11-02 20:25:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 20:25:13,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:13,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:25:13,976 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:13,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:13,976 INFO L85 PathProgramCache]: Analyzing trace with hash -876237255, now seen corresponding path program 1 times [2022-11-02 20:25:13,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:13,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084582881] [2022-11-02 20:25:13,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:13,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:14,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:25:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:14,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:14,286 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:25:14,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:14,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084582881] [2022-11-02 20:25:14,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084582881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:14,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:14,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:25:14,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236551412] [2022-11-02 20:25:14,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:14,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:25:14,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:14,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:25:14,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:25:14,289 INFO L87 Difference]: Start difference. First operand 650 states and 903 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:15,484 INFO L93 Difference]: Finished difference Result 685 states and 968 transitions. [2022-11-02 20:25:15,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:25:15,493 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-11-02 20:25:15,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:15,504 INFO L225 Difference]: With dead ends: 685 [2022-11-02 20:25:15,505 INFO L226 Difference]: Without dead ends: 667 [2022-11-02 20:25:15,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:25:15,507 INFO L413 NwaCegarLoop]: 538 mSDtfsCounter, 123 mSDsluCounter, 4152 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4690 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:15,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 4690 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:25:15,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-11-02 20:25:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 647. [2022-11-02 20:25:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 539 states have (on average 1.3339517625231911) internal successors, (719), 548 states have internal predecessors, (719), 73 states have call successors, (73), 26 states have call predecessors, (73), 34 states have return successors, (106), 72 states have call predecessors, (106), 67 states have call successors, (106) [2022-11-02 20:25:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 898 transitions. [2022-11-02 20:25:15,589 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 898 transitions. Word has length 47 [2022-11-02 20:25:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:15,589 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 898 transitions. [2022-11-02 20:25:15,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 898 transitions. [2022-11-02 20:25:15,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 20:25:15,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:15,592 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:15,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:25:15,592 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:15,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:15,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1600404883, now seen corresponding path program 1 times [2022-11-02 20:25:15,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:15,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15759338] [2022-11-02 20:25:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:15,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:15,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:25:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:15,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:25:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:15,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:25:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:15,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:25:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:15,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:15,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15759338] [2022-11-02 20:25:15,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15759338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:15,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:15,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:25:15,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413581491] [2022-11-02 20:25:15,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:15,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:25:15,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:15,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:25:15,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:15,715 INFO L87 Difference]: Start difference. First operand 647 states and 898 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:25:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:16,598 INFO L93 Difference]: Finished difference Result 1017 states and 1421 transitions. [2022-11-02 20:25:16,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:25:16,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 63 [2022-11-02 20:25:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:16,602 INFO L225 Difference]: With dead ends: 1017 [2022-11-02 20:25:16,602 INFO L226 Difference]: Without dead ends: 647 [2022-11-02 20:25:16,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:25:16,604 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 759 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:16,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1991 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:25:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-11-02 20:25:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2022-11-02 20:25:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 539 states have (on average 1.3265306122448979) internal successors, (715), 548 states have internal predecessors, (715), 73 states have call successors, (73), 26 states have call predecessors, (73), 34 states have return successors, (101), 72 states have call predecessors, (101), 67 states have call successors, (101) [2022-11-02 20:25:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 889 transitions. [2022-11-02 20:25:16,704 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 889 transitions. Word has length 63 [2022-11-02 20:25:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:16,704 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 889 transitions. [2022-11-02 20:25:16,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:25:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 889 transitions. [2022-11-02 20:25:16,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-02 20:25:16,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:16,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:16,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:25:16,707 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:16,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:16,708 INFO L85 PathProgramCache]: Analyzing trace with hash 814598827, now seen corresponding path program 1 times [2022-11-02 20:25:16,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:16,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762466917] [2022-11-02 20:25:16,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:16,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:16,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:25:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:16,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:25:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:16,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:25:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:16,798 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:25:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:16,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762466917] [2022-11-02 20:25:16,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762466917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:16,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:16,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:25:16,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949830690] [2022-11-02 20:25:16,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:16,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:25:16,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:16,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:25:16,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:25:16,800 INFO L87 Difference]: Start difference. First operand 647 states and 889 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:25:17,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:17,271 INFO L93 Difference]: Finished difference Result 801 states and 1086 transitions. [2022-11-02 20:25:17,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:25:17,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-11-02 20:25:17,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:17,276 INFO L225 Difference]: With dead ends: 801 [2022-11-02 20:25:17,276 INFO L226 Difference]: Without dead ends: 718 [2022-11-02 20:25:17,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:17,278 INFO L413 NwaCegarLoop]: 571 mSDtfsCounter, 303 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:17,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1330 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:25:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-11-02 20:25:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 701. [2022-11-02 20:25:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 585 states have (on average 1.3282051282051281) internal successors, (777), 593 states have internal predecessors, (777), 76 states have call successors, (76), 30 states have call predecessors, (76), 39 states have return successors, (107), 77 states have call predecessors, (107), 71 states have call successors, (107) [2022-11-02 20:25:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 960 transitions. [2022-11-02 20:25:17,364 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 960 transitions. Word has length 50 [2022-11-02 20:25:17,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:17,365 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 960 transitions. [2022-11-02 20:25:17,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:25:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 960 transitions. [2022-11-02 20:25:17,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:25:17,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:17,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:17,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:25:17,368 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:17,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:17,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1131207190, now seen corresponding path program 1 times [2022-11-02 20:25:17,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:17,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146219086] [2022-11-02 20:25:17,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:17,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:17,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:25:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:17,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:25:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:17,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:17,611 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:25:17,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:17,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146219086] [2022-11-02 20:25:17,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146219086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:17,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:17,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:25:17,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828121397] [2022-11-02 20:25:17,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:17,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:25:17,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:17,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:25:17,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:25:17,614 INFO L87 Difference]: Start difference. First operand 701 states and 960 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:25:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:18,812 INFO L93 Difference]: Finished difference Result 735 states and 995 transitions. [2022-11-02 20:25:18,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:25:18,813 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-11-02 20:25:18,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:18,816 INFO L225 Difference]: With dead ends: 735 [2022-11-02 20:25:18,816 INFO L226 Difference]: Without dead ends: 715 [2022-11-02 20:25:18,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:25:18,817 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 343 mSDsluCounter, 3805 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 4317 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:18,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 4317 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:25:18,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-11-02 20:25:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 699. [2022-11-02 20:25:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 584 states have (on average 1.327054794520548) internal successors, (775), 592 states have internal predecessors, (775), 75 states have call successors, (75), 30 states have call predecessors, (75), 39 states have return successors, (106), 76 states have call predecessors, (106), 70 states have call successors, (106) [2022-11-02 20:25:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 956 transitions. [2022-11-02 20:25:18,904 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 956 transitions. Word has length 51 [2022-11-02 20:25:18,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:18,904 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 956 transitions. [2022-11-02 20:25:18,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:25:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 956 transitions. [2022-11-02 20:25:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:25:18,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:18,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:18,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:25:18,907 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:18,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:18,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1095084481, now seen corresponding path program 1 times [2022-11-02 20:25:18,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:18,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768458967] [2022-11-02 20:25:18,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:18,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:19,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:25:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:19,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:25:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:19,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:19,154 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:25:19,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:19,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768458967] [2022-11-02 20:25:19,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768458967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:19,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:19,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:25:19,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078383313] [2022-11-02 20:25:19,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:19,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:25:19,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:19,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:25:19,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:25:19,157 INFO L87 Difference]: Start difference. First operand 699 states and 956 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:25:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:20,396 INFO L93 Difference]: Finished difference Result 733 states and 991 transitions. [2022-11-02 20:25:20,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:25:20,397 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2022-11-02 20:25:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:20,412 INFO L225 Difference]: With dead ends: 733 [2022-11-02 20:25:20,412 INFO L226 Difference]: Without dead ends: 713 [2022-11-02 20:25:20,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:25:20,413 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 247 mSDsluCounter, 4021 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 4530 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:20,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 4530 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:25:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-11-02 20:25:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 697. [2022-11-02 20:25:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 583 states have (on average 1.3259005145797598) internal successors, (773), 591 states have internal predecessors, (773), 74 states have call successors, (74), 30 states have call predecessors, (74), 39 states have return successors, (105), 75 states have call predecessors, (105), 69 states have call successors, (105) [2022-11-02 20:25:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 952 transitions. [2022-11-02 20:25:20,497 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 952 transitions. Word has length 52 [2022-11-02 20:25:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:20,497 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 952 transitions. [2022-11-02 20:25:20,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:25:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 952 transitions. [2022-11-02 20:25:20,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:25:20,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:20,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:20,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:25:20,500 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:20,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:20,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1640527845, now seen corresponding path program 1 times [2022-11-02 20:25:20,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:20,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26630308] [2022-11-02 20:25:20,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:20,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:20,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:25:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:20,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:20,715 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:25:20,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:20,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26630308] [2022-11-02 20:25:20,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26630308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:20,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:20,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:25:20,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352386887] [2022-11-02 20:25:20,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:20,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:25:20,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:20,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:25:20,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:25:20,717 INFO L87 Difference]: Start difference. First operand 697 states and 952 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 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:25:21,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:21,745 INFO L93 Difference]: Finished difference Result 715 states and 970 transitions. [2022-11-02 20:25:21,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:25:21,745 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 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) Word has length 48 [2022-11-02 20:25:21,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:21,749 INFO L225 Difference]: With dead ends: 715 [2022-11-02 20:25:21,749 INFO L226 Difference]: Without dead ends: 695 [2022-11-02 20:25:21,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:25:21,751 INFO L413 NwaCegarLoop]: 492 mSDtfsCounter, 238 mSDsluCounter, 3343 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 3835 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:21,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 3835 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:25:21,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-11-02 20:25:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2022-11-02 20:25:21,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 582 states have (on average 1.324742268041237) internal successors, (771), 590 states have internal predecessors, (771), 73 states have call successors, (73), 30 states have call predecessors, (73), 39 states have return successors, (104), 74 states have call predecessors, (104), 68 states have call successors, (104) [2022-11-02 20:25:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 948 transitions. [2022-11-02 20:25:21,849 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 948 transitions. Word has length 48 [2022-11-02 20:25:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:21,849 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 948 transitions. [2022-11-02 20:25:21,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 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:25:21,849 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 948 transitions. [2022-11-02 20:25:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:25:21,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:21,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:21,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:25:21,852 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:21,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:21,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1335817887, now seen corresponding path program 1 times [2022-11-02 20:25:21,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:21,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854784065] [2022-11-02 20:25:21,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:21,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:21,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:25:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:21,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:25:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:21,905 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:25:21,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:21,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854784065] [2022-11-02 20:25:21,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854784065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:21,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:21,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:25:21,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994377242] [2022-11-02 20:25:21,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:21,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:25:21,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:21,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:25:21,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:25:21,910 INFO L87 Difference]: Start difference. First operand 695 states and 948 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:25:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:22,252 INFO L93 Difference]: Finished difference Result 933 states and 1271 transitions. [2022-11-02 20:25:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:25:22,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-11-02 20:25:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:22,255 INFO L225 Difference]: With dead ends: 933 [2022-11-02 20:25:22,255 INFO L226 Difference]: Without dead ends: 643 [2022-11-02 20:25:22,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:25:22,257 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 97 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:22,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1558 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:25:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-11-02 20:25:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 626. [2022-11-02 20:25:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 528 states have (on average 1.3200757575757576) internal successors, (697), 534 states have internal predecessors, (697), 64 states have call successors, (64), 27 states have call predecessors, (64), 33 states have return successors, (74), 64 states have call predecessors, (74), 59 states have call successors, (74) [2022-11-02 20:25:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 835 transitions. [2022-11-02 20:25:22,334 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 835 transitions. Word has length 48 [2022-11-02 20:25:22,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:22,335 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 835 transitions. [2022-11-02 20:25:22,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:25:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 835 transitions. [2022-11-02 20:25:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-02 20:25:22,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:22,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:22,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:25:22,337 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:22,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:22,338 INFO L85 PathProgramCache]: Analyzing trace with hash 233509778, now seen corresponding path program 1 times [2022-11-02 20:25:22,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:22,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119183700] [2022-11-02 20:25:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:22,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:22,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:25:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:22,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:22,642 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:25:22,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:22,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119183700] [2022-11-02 20:25:22,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119183700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:22,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:22,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:25:22,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360353474] [2022-11-02 20:25:22,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:22,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:25:22,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:22,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:25:22,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:25:22,647 INFO L87 Difference]: Start difference. First operand 626 states and 835 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:23,593 INFO L93 Difference]: Finished difference Result 642 states and 851 transitions. [2022-11-02 20:25:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:25:23,594 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2022-11-02 20:25:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:23,597 INFO L225 Difference]: With dead ends: 642 [2022-11-02 20:25:23,597 INFO L226 Difference]: Without dead ends: 624 [2022-11-02 20:25:23,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:25:23,598 INFO L413 NwaCegarLoop]: 493 mSDtfsCounter, 116 mSDsluCounter, 3815 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 4308 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:23,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 4308 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:25:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-11-02 20:25:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2022-11-02 20:25:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 527 states have (on average 1.3187855787476281) internal successors, (695), 533 states have internal predecessors, (695), 63 states have call successors, (63), 27 states have call predecessors, (63), 33 states have return successors, (73), 63 states have call predecessors, (73), 58 states have call successors, (73) [2022-11-02 20:25:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 831 transitions. [2022-11-02 20:25:23,686 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 831 transitions. Word has length 57 [2022-11-02 20:25:23,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:23,687 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 831 transitions. [2022-11-02 20:25:23,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:23,687 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 831 transitions. [2022-11-02 20:25:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:25:23,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:23,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:23,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:25:23,689 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:23,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1066234985, now seen corresponding path program 1 times [2022-11-02 20:25:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:23,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605491] [2022-11-02 20:25:23,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:23,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:23,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:25:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:23,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:23,934 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:25:23,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:23,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605491] [2022-11-02 20:25:23,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:23,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:23,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:25:23,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327676240] [2022-11-02 20:25:23,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:23,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:25:23,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:23,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:25:23,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:25:23,937 INFO L87 Difference]: Start difference. First operand 624 states and 831 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:24,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:24,850 INFO L93 Difference]: Finished difference Result 639 states and 846 transitions. [2022-11-02 20:25:24,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:25:24,851 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-11-02 20:25:24,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:24,853 INFO L225 Difference]: With dead ends: 639 [2022-11-02 20:25:24,854 INFO L226 Difference]: Without dead ends: 621 [2022-11-02 20:25:24,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:25:24,855 INFO L413 NwaCegarLoop]: 485 mSDtfsCounter, 116 mSDsluCounter, 3768 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 4253 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:24,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 4253 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:25:24,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-11-02 20:25:24,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2022-11-02 20:25:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 525 states have (on average 1.318095238095238) internal successors, (692), 531 states have internal predecessors, (692), 62 states have call successors, (62), 27 states have call predecessors, (62), 33 states have return successors, (72), 62 states have call predecessors, (72), 57 states have call successors, (72) [2022-11-02 20:25:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 826 transitions. [2022-11-02 20:25:24,930 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 826 transitions. Word has length 48 [2022-11-02 20:25:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:24,931 INFO L495 AbstractCegarLoop]: Abstraction has 621 states and 826 transitions. [2022-11-02 20:25:24,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 826 transitions. [2022-11-02 20:25:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-02 20:25:24,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:24,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:24,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:25:24,933 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:24,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:24,934 INFO L85 PathProgramCache]: Analyzing trace with hash -480998912, now seen corresponding path program 1 times [2022-11-02 20:25:24,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:24,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577239369] [2022-11-02 20:25:24,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:24,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:24,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:25:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:25,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:25:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:25,012 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:25:25,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:25,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577239369] [2022-11-02 20:25:25,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577239369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:25,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:25,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:25:25,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074435077] [2022-11-02 20:25:25,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:25,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:25:25,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:25,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:25:25,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:25,015 INFO L87 Difference]: Start difference. First operand 621 states and 826 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:25:25,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:25,531 INFO L93 Difference]: Finished difference Result 712 states and 930 transitions. [2022-11-02 20:25:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:25:25,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-11-02 20:25:25,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:25,543 INFO L225 Difference]: With dead ends: 712 [2022-11-02 20:25:25,544 INFO L226 Difference]: Without dead ends: 686 [2022-11-02 20:25:25,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:25:25,545 INFO L413 NwaCegarLoop]: 521 mSDtfsCounter, 257 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:25,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 2383 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:25:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-11-02 20:25:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 627. [2022-11-02 20:25:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 530 states have (on average 1.3169811320754716) internal successors, (698), 536 states have internal predecessors, (698), 63 states have call successors, (63), 27 states have call predecessors, (63), 33 states have return successors, (73), 63 states have call predecessors, (73), 58 states have call successors, (73) [2022-11-02 20:25:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 834 transitions. [2022-11-02 20:25:25,618 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 834 transitions. Word has length 50 [2022-11-02 20:25:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:25,618 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 834 transitions. [2022-11-02 20:25:25,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:25:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 834 transitions. [2022-11-02 20:25:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 20:25:25,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:25,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:25,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 20:25:25,623 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:25,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:25,623 INFO L85 PathProgramCache]: Analyzing trace with hash 266979750, now seen corresponding path program 1 times [2022-11-02 20:25:25,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:25,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732986291] [2022-11-02 20:25:25,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:25,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:25,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:25:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:25,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:25:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:25,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:25:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:25,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:25:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:25,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:25,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732986291] [2022-11-02 20:25:25,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732986291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:25,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:25,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:25:25,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95906917] [2022-11-02 20:25:25,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:25,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:25:25,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:25,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:25:25,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:25:25,717 INFO L87 Difference]: Start difference. First operand 627 states and 834 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:25:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:26,284 INFO L93 Difference]: Finished difference Result 732 states and 975 transitions. [2022-11-02 20:25:26,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:25:26,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2022-11-02 20:25:26,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:26,287 INFO L225 Difference]: With dead ends: 732 [2022-11-02 20:25:26,287 INFO L226 Difference]: Without dead ends: 627 [2022-11-02 20:25:26,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:25:26,289 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 110 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:26,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1707 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:25:26,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-11-02 20:25:26,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2022-11-02 20:25:26,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 530 states have (on average 1.3132075471698113) internal successors, (696), 536 states have internal predecessors, (696), 63 states have call successors, (63), 27 states have call predecessors, (63), 33 states have return successors, (73), 63 states have call predecessors, (73), 58 states have call successors, (73) [2022-11-02 20:25:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 832 transitions. [2022-11-02 20:25:26,363 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 832 transitions. Word has length 53 [2022-11-02 20:25:26,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:26,364 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 832 transitions. [2022-11-02 20:25:26,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:25:26,364 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 832 transitions. [2022-11-02 20:25:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:25:26,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:26,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:26,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 20:25:26,366 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:26,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:26,367 INFO L85 PathProgramCache]: Analyzing trace with hash 309046761, now seen corresponding path program 1 times [2022-11-02 20:25:26,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:26,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112580990] [2022-11-02 20:25:26,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:26,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:26,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:25:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:26,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:25:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:26,470 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:25:26,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:26,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112580990] [2022-11-02 20:25:26,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112580990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:26,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:26,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:25:26,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11868225] [2022-11-02 20:25:26,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:26,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:25:26,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:26,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:25:26,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:25:26,472 INFO L87 Difference]: Start difference. First operand 627 states and 832 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:25:27,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:27,108 INFO L93 Difference]: Finished difference Result 661 states and 872 transitions. [2022-11-02 20:25:27,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:25:27,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-11-02 20:25:27,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:27,111 INFO L225 Difference]: With dead ends: 661 [2022-11-02 20:25:27,111 INFO L226 Difference]: Without dead ends: 607 [2022-11-02 20:25:27,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:25:27,113 INFO L413 NwaCegarLoop]: 475 mSDtfsCounter, 185 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:27,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 3080 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:25:27,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2022-11-02 20:25:27,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 600. [2022-11-02 20:25:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 508 states have (on average 1.2992125984251968) internal successors, (660), 514 states have internal predecessors, (660), 58 states have call successors, (58), 27 states have call predecessors, (58), 33 states have return successors, (67), 58 states have call predecessors, (67), 53 states have call successors, (67) [2022-11-02 20:25:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 785 transitions. [2022-11-02 20:25:27,193 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 785 transitions. Word has length 51 [2022-11-02 20:25:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:27,193 INFO L495 AbstractCegarLoop]: Abstraction has 600 states and 785 transitions. [2022-11-02 20:25:27,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:25:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 785 transitions. [2022-11-02 20:25:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:25:27,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:27,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:27,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 20:25:27,196 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:27,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:27,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1614181273, now seen corresponding path program 1 times [2022-11-02 20:25:27,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:27,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995204032] [2022-11-02 20:25:27,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:27,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:27,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:25:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:27,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:25:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:27,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:25:27,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:27,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995204032] [2022-11-02 20:25:27,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995204032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:27,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:27,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:25:27,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415262128] [2022-11-02 20:25:27,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:27,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:25:27,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:27,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:25:27,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:27,298 INFO L87 Difference]: Start difference. First operand 600 states and 785 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 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:25:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:27,713 INFO L93 Difference]: Finished difference Result 641 states and 827 transitions. [2022-11-02 20:25:27,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:25:27,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 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) Word has length 51 [2022-11-02 20:25:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:27,715 INFO L225 Difference]: With dead ends: 641 [2022-11-02 20:25:27,716 INFO L226 Difference]: Without dead ends: 594 [2022-11-02 20:25:27,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:27,728 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 175 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:27,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1757 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:25:27,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-11-02 20:25:27,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 590. [2022-11-02 20:25:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 500 states have (on average 1.296) internal successors, (648), 506 states have internal predecessors, (648), 56 states have call successors, (56), 27 states have call predecessors, (56), 33 states have return successors, (65), 56 states have call predecessors, (65), 51 states have call successors, (65) [2022-11-02 20:25:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 769 transitions. [2022-11-02 20:25:27,807 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 769 transitions. Word has length 51 [2022-11-02 20:25:27,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:27,807 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 769 transitions. [2022-11-02 20:25:27,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 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:25:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 769 transitions. [2022-11-02 20:25:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:25:27,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:27,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:27,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 20:25:27,810 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:27,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:27,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1624287433, now seen corresponding path program 1 times [2022-11-02 20:25:27,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:27,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647146446] [2022-11-02 20:25:27,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:27,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:27,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:25:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:27,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:25:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:27,893 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:25:27,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:27,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647146446] [2022-11-02 20:25:27,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647146446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:27,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:27,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:25:27,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904956317] [2022-11-02 20:25:27,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:27,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:25:27,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:27,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:25:27,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:27,896 INFO L87 Difference]: Start difference. First operand 590 states and 769 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 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:25:28,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:28,397 INFO L93 Difference]: Finished difference Result 617 states and 797 transitions. [2022-11-02 20:25:28,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:25:28,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 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) Word has length 52 [2022-11-02 20:25:28,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:28,400 INFO L225 Difference]: With dead ends: 617 [2022-11-02 20:25:28,400 INFO L226 Difference]: Without dead ends: 585 [2022-11-02 20:25:28,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:28,401 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 94 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 2012 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:28,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 2012 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:25:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-11-02 20:25:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2022-11-02 20:25:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 496 states have (on average 1.2963709677419355) internal successors, (643), 502 states have internal predecessors, (643), 55 states have call successors, (55), 27 states have call predecessors, (55), 33 states have return successors, (64), 55 states have call predecessors, (64), 50 states have call successors, (64) [2022-11-02 20:25:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 762 transitions. [2022-11-02 20:25:28,479 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 762 transitions. Word has length 52 [2022-11-02 20:25:28,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:28,480 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 762 transitions. [2022-11-02 20:25:28,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 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:25:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 762 transitions. [2022-11-02 20:25:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:25:28,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:28,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:28,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 20:25:28,482 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:28,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:28,483 INFO L85 PathProgramCache]: Analyzing trace with hash 576638373, now seen corresponding path program 1 times [2022-11-02 20:25:28,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:28,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153467305] [2022-11-02 20:25:28,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:28,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:28,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:25:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:28,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:28,541 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:25:28,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:28,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153467305] [2022-11-02 20:25:28,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153467305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:28,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:28,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:25:28,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454343309] [2022-11-02 20:25:28,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:28,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:25:28,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:28,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:25:28,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:25:28,544 INFO L87 Difference]: Start difference. First operand 585 states and 762 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:29,041 INFO L93 Difference]: Finished difference Result 701 states and 910 transitions. [2022-11-02 20:25:29,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:25:29,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2022-11-02 20:25:29,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:29,043 INFO L225 Difference]: With dead ends: 701 [2022-11-02 20:25:29,043 INFO L226 Difference]: Without dead ends: 689 [2022-11-02 20:25:29,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:29,044 INFO L413 NwaCegarLoop]: 470 mSDtfsCounter, 210 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:29,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1358 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:25:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-11-02 20:25:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 617. [2022-11-02 20:25:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 526 states have (on average 1.290874524714829) internal successors, (679), 532 states have internal predecessors, (679), 55 states have call successors, (55), 27 states have call predecessors, (55), 35 states have return successors, (66), 57 states have call predecessors, (66), 50 states have call successors, (66) [2022-11-02 20:25:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 800 transitions. [2022-11-02 20:25:29,127 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 800 transitions. Word has length 52 [2022-11-02 20:25:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:29,127 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 800 transitions. [2022-11-02 20:25:29,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 800 transitions. [2022-11-02 20:25:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 20:25:29,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:29,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:29,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-02 20:25:29,129 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:29,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:29,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1140697567, now seen corresponding path program 1 times [2022-11-02 20:25:29,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:29,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750357092] [2022-11-02 20:25:29,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:29,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:29,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:25:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:29,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:29,213 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:25:29,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:29,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750357092] [2022-11-02 20:25:29,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750357092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:29,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:29,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:25:29,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399178550] [2022-11-02 20:25:29,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:29,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:25:29,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:29,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:25:29,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:29,215 INFO L87 Difference]: Start difference. First operand 617 states and 800 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 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:25:29,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:29,911 INFO L93 Difference]: Finished difference Result 695 states and 899 transitions. [2022-11-02 20:25:29,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:25:29,912 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 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) Word has length 53 [2022-11-02 20:25:29,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:29,914 INFO L225 Difference]: With dead ends: 695 [2022-11-02 20:25:29,914 INFO L226 Difference]: Without dead ends: 686 [2022-11-02 20:25:29,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:25:29,915 INFO L413 NwaCegarLoop]: 457 mSDtfsCounter, 804 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:29,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1280 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:25:29,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-11-02 20:25:29,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 617. [2022-11-02 20:25:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 526 states have (on average 1.2870722433460076) internal successors, (677), 532 states have internal predecessors, (677), 55 states have call successors, (55), 27 states have call predecessors, (55), 35 states have return successors, (66), 57 states have call predecessors, (66), 50 states have call successors, (66) [2022-11-02 20:25:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 798 transitions. [2022-11-02 20:25:29,999 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 798 transitions. Word has length 53 [2022-11-02 20:25:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:29,999 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 798 transitions. [2022-11-02 20:25:29,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 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:25:30,000 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 798 transitions. [2022-11-02 20:25:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 20:25:30,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:30,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:30,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-02 20:25:30,002 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:30,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1478759627, now seen corresponding path program 1 times [2022-11-02 20:25:30,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:30,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17020990] [2022-11-02 20:25:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:30,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:25:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:30,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:25:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:30,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:30,290 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:25:30,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:30,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17020990] [2022-11-02 20:25:30,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17020990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:30,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:30,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-02 20:25:30,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648388026] [2022-11-02 20:25:30,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:30,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:25:30,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:30,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:25:30,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:25:30,293 INFO L87 Difference]: Start difference. First operand 617 states and 798 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:25:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:31,653 INFO L93 Difference]: Finished difference Result 637 states and 819 transitions. [2022-11-02 20:25:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:25:31,654 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2022-11-02 20:25:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:31,655 INFO L225 Difference]: With dead ends: 637 [2022-11-02 20:25:31,655 INFO L226 Difference]: Without dead ends: 614 [2022-11-02 20:25:31,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:25:31,656 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 232 mSDsluCounter, 4094 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 4510 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:31,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 4510 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:25:31,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-11-02 20:25:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2022-11-02 20:25:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 524 states have (on average 1.286259541984733) internal successors, (674), 530 states have internal predecessors, (674), 54 states have call successors, (54), 27 states have call predecessors, (54), 35 states have return successors, (65), 56 states have call predecessors, (65), 49 states have call successors, (65) [2022-11-02 20:25:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 793 transitions. [2022-11-02 20:25:31,732 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 793 transitions. Word has length 55 [2022-11-02 20:25:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:31,732 INFO L495 AbstractCegarLoop]: Abstraction has 614 states and 793 transitions. [2022-11-02 20:25:31,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:25:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 793 transitions. [2022-11-02 20:25:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:25:31,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:31,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:31,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-02 20:25:31,735 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:31,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:31,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1170302788, now seen corresponding path program 1 times [2022-11-02 20:25:31,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:31,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860694477] [2022-11-02 20:25:31,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:31,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:31,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:25:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:32,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:32,057 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:25:32,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:32,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860694477] [2022-11-02 20:25:32,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860694477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:32,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:32,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:25:32,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550905829] [2022-11-02 20:25:32,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:32,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:25:32,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:32,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:25:32,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:25:32,060 INFO L87 Difference]: Start difference. First operand 614 states and 793 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:32,989 INFO L93 Difference]: Finished difference Result 629 states and 808 transitions. [2022-11-02 20:25:32,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:25:32,989 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-11-02 20:25:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:32,991 INFO L225 Difference]: With dead ends: 629 [2022-11-02 20:25:32,992 INFO L226 Difference]: Without dead ends: 604 [2022-11-02 20:25:32,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:25:32,993 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 116 mSDsluCounter, 3115 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 3529 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:32,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 3529 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:25:32,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-11-02 20:25:33,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2022-11-02 20:25:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 516 states have (on average 1.2868217054263567) internal successors, (664), 522 states have internal predecessors, (664), 52 states have call successors, (52), 27 states have call predecessors, (52), 35 states have return successors, (63), 54 states have call predecessors, (63), 47 states have call successors, (63) [2022-11-02 20:25:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 779 transitions. [2022-11-02 20:25:33,078 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 779 transitions. Word has length 54 [2022-11-02 20:25:33,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:33,079 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 779 transitions. [2022-11-02 20:25:33,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 779 transitions. [2022-11-02 20:25:33,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:25:33,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:33,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:33,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-02 20:25:33,081 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:33,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:33,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1059320829, now seen corresponding path program 1 times [2022-11-02 20:25:33,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:33,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743270590] [2022-11-02 20:25:33,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:33,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:33,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:25:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:33,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:25:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:33,160 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:25:33,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:33,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743270590] [2022-11-02 20:25:33,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743270590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:33,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:33,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:25:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356394429] [2022-11-02 20:25:33,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:33,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:25:33,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:33,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:25:33,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:33,162 INFO L87 Difference]: Start difference. First operand 604 states and 779 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 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:25:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:33,557 INFO L93 Difference]: Finished difference Result 631 states and 807 transitions. [2022-11-02 20:25:33,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:25:33,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 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) Word has length 54 [2022-11-02 20:25:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:33,559 INFO L225 Difference]: With dead ends: 631 [2022-11-02 20:25:33,560 INFO L226 Difference]: Without dead ends: 599 [2022-11-02 20:25:33,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:33,561 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 171 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:33,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1651 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:25:33,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-11-02 20:25:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2022-11-02 20:25:33,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 512 states have (on average 1.287109375) internal successors, (659), 518 states have internal predecessors, (659), 51 states have call successors, (51), 27 states have call predecessors, (51), 35 states have return successors, (62), 53 states have call predecessors, (62), 46 states have call successors, (62) [2022-11-02 20:25:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 772 transitions. [2022-11-02 20:25:33,646 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 772 transitions. Word has length 54 [2022-11-02 20:25:33,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:33,647 INFO L495 AbstractCegarLoop]: Abstraction has 599 states and 772 transitions. [2022-11-02 20:25:33,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 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:25:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 772 transitions. [2022-11-02 20:25:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:25:33,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:33,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:33,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-02 20:25:33,650 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:33,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1513227889, now seen corresponding path program 1 times [2022-11-02 20:25:33,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:33,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075029934] [2022-11-02 20:25:33,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:33,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:33,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:25:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:33,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:25:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:33,789 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:25:33,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:33,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075029934] [2022-11-02 20:25:33,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075029934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:33,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:33,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:25:33,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347269138] [2022-11-02 20:25:33,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:33,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:25:33,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:33,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:25:33,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:25:33,792 INFO L87 Difference]: Start difference. First operand 599 states and 772 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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:25:34,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:34,414 INFO L93 Difference]: Finished difference Result 622 states and 797 transitions. [2022-11-02 20:25:34,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:25:34,415 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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) Word has length 54 [2022-11-02 20:25:34,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:34,416 INFO L225 Difference]: With dead ends: 622 [2022-11-02 20:25:34,416 INFO L226 Difference]: Without dead ends: 596 [2022-11-02 20:25:34,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:25:34,417 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 155 mSDsluCounter, 2864 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 3269 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:34,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 3269 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:25:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-11-02 20:25:34,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2022-11-02 20:25:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 510 states have (on average 1.2862745098039217) internal successors, (656), 516 states have internal predecessors, (656), 50 states have call successors, (50), 27 states have call predecessors, (50), 35 states have return successors, (61), 52 states have call predecessors, (61), 45 states have call successors, (61) [2022-11-02 20:25:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 767 transitions. [2022-11-02 20:25:34,477 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 767 transitions. Word has length 54 [2022-11-02 20:25:34,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:34,478 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 767 transitions. [2022-11-02 20:25:34,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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:25:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 767 transitions. [2022-11-02 20:25:34,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:25:34,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:34,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:34,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-02 20:25:34,479 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:34,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:34,480 INFO L85 PathProgramCache]: Analyzing trace with hash 362195338, now seen corresponding path program 1 times [2022-11-02 20:25:34,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:34,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950959708] [2022-11-02 20:25:34,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:34,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:34,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:25:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:34,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:34,594 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:25:34,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:34,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950959708] [2022-11-02 20:25:34,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950959708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:34,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:34,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:25:34,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762378756] [2022-11-02 20:25:34,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:34,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:25:34,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:34,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:25:34,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:34,597 INFO L87 Difference]: Start difference. First operand 596 states and 767 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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:25:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:35,258 INFO L93 Difference]: Finished difference Result 669 states and 859 transitions. [2022-11-02 20:25:35,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:25:35,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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) Word has length 54 [2022-11-02 20:25:35,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:35,261 INFO L225 Difference]: With dead ends: 669 [2022-11-02 20:25:35,261 INFO L226 Difference]: Without dead ends: 665 [2022-11-02 20:25:35,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:25:35,262 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 692 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:35,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1449 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:25:35,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-11-02 20:25:35,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 593. [2022-11-02 20:25:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 507 states have (on average 1.2840236686390532) internal successors, (651), 513 states have internal predecessors, (651), 50 states have call successors, (50), 27 states have call predecessors, (50), 35 states have return successors, (61), 52 states have call predecessors, (61), 45 states have call successors, (61) [2022-11-02 20:25:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 762 transitions. [2022-11-02 20:25:35,346 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 762 transitions. Word has length 54 [2022-11-02 20:25:35,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:35,347 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 762 transitions. [2022-11-02 20:25:35,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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:25:35,347 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 762 transitions. [2022-11-02 20:25:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:25:35,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:35,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:35,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-02 20:25:35,349 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:35,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:35,350 INFO L85 PathProgramCache]: Analyzing trace with hash 362472168, now seen corresponding path program 1 times [2022-11-02 20:25:35,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:35,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20644056] [2022-11-02 20:25:35,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:35,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:35,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:25:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:35,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:35,580 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:25:35,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:35,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20644056] [2022-11-02 20:25:35,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20644056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:35,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:35,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:25:35,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935781124] [2022-11-02 20:25:35,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:35,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:25:35,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:35,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:25:35,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:25:35,583 INFO L87 Difference]: Start difference. First operand 593 states and 762 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:36,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:36,477 INFO L93 Difference]: Finished difference Result 603 states and 771 transitions. [2022-11-02 20:25:36,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:25:36,477 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-11-02 20:25:36,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:36,479 INFO L225 Difference]: With dead ends: 603 [2022-11-02 20:25:36,479 INFO L226 Difference]: Without dead ends: 575 [2022-11-02 20:25:36,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:25:36,480 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 211 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2726 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:36,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 2726 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:25:36,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-11-02 20:25:36,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 571. [2022-11-02 20:25:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 486 states have (on average 1.2777777777777777) internal successors, (621), 492 states have internal predecessors, (621), 50 states have call successors, (50), 27 states have call predecessors, (50), 34 states have return successors, (60), 51 states have call predecessors, (60), 45 states have call successors, (60) [2022-11-02 20:25:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 731 transitions. [2022-11-02 20:25:36,565 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 731 transitions. Word has length 54 [2022-11-02 20:25:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:36,566 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 731 transitions. [2022-11-02 20:25:36,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 731 transitions. [2022-11-02 20:25:36,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:25:36,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:36,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:36,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-02 20:25:36,568 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:36,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:36,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1415863677, now seen corresponding path program 1 times [2022-11-02 20:25:36,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:36,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636888676] [2022-11-02 20:25:36,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:36,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:36,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:25:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:36,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:36,627 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:25:36,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:36,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636888676] [2022-11-02 20:25:36,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636888676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:36,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:36,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:25:36,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787920477] [2022-11-02 20:25:36,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:36,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:25:36,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:36,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:25:36,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:25:36,629 INFO L87 Difference]: Start difference. First operand 571 states and 731 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:37,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:37,049 INFO L93 Difference]: Finished difference Result 597 states and 761 transitions. [2022-11-02 20:25:37,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:25:37,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-11-02 20:25:37,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:37,052 INFO L225 Difference]: With dead ends: 597 [2022-11-02 20:25:37,052 INFO L226 Difference]: Without dead ends: 564 [2022-11-02 20:25:37,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:37,053 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 156 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:37,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1182 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:25:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-11-02 20:25:37,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 560. [2022-11-02 20:25:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 476 states have (on average 1.26890756302521) internal successors, (604), 482 states have internal predecessors, (604), 50 states have call successors, (50), 27 states have call predecessors, (50), 33 states have return successors, (59), 50 states have call predecessors, (59), 45 states have call successors, (59) [2022-11-02 20:25:37,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 713 transitions. [2022-11-02 20:25:37,112 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 713 transitions. Word has length 54 [2022-11-02 20:25:37,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:37,112 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 713 transitions. [2022-11-02 20:25:37,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:37,113 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 713 transitions. [2022-11-02 20:25:37,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:25:37,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:37,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:37,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-02 20:25:37,115 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:37,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:37,115 INFO L85 PathProgramCache]: Analyzing trace with hash -275547021, now seen corresponding path program 1 times [2022-11-02 20:25:37,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:37,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611252567] [2022-11-02 20:25:37,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:37,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:37,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:25:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:37,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:25:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:37,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:37,210 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:25:37,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:37,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611252567] [2022-11-02 20:25:37,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611252567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:37,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:37,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:25:37,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074705877] [2022-11-02 20:25:37,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:37,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:25:37,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:37,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:25:37,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:37,212 INFO L87 Difference]: Start difference. First operand 560 states and 713 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:25:37,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:37,759 INFO L93 Difference]: Finished difference Result 609 states and 765 transitions. [2022-11-02 20:25:37,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:25:37,759 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2022-11-02 20:25:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:37,761 INFO L225 Difference]: With dead ends: 609 [2022-11-02 20:25:37,762 INFO L226 Difference]: Without dead ends: 578 [2022-11-02 20:25:37,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:25:37,763 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 189 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:37,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1727 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:25:37,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-11-02 20:25:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 560. [2022-11-02 20:25:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 476 states have (on average 1.2668067226890756) internal successors, (603), 482 states have internal predecessors, (603), 50 states have call successors, (50), 27 states have call predecessors, (50), 33 states have return successors, (59), 50 states have call predecessors, (59), 45 states have call successors, (59) [2022-11-02 20:25:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 712 transitions. [2022-11-02 20:25:37,848 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 712 transitions. Word has length 56 [2022-11-02 20:25:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:37,848 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 712 transitions. [2022-11-02 20:25:37,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:25:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 712 transitions. [2022-11-02 20:25:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:25:37,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:37,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:37,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-02 20:25:37,851 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:37,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:37,851 INFO L85 PathProgramCache]: Analyzing trace with hash -252914767, now seen corresponding path program 1 times [2022-11-02 20:25:37,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:37,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184057146] [2022-11-02 20:25:37,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:37,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:38,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:25:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:38,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:25:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:38,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:38,123 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:25:38,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:38,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184057146] [2022-11-02 20:25:38,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184057146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:38,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:38,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:25:38,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439037941] [2022-11-02 20:25:38,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:38,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:25:38,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:38,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:25:38,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:25:38,125 INFO L87 Difference]: Start difference. First operand 560 states and 712 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:25:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:39,074 INFO L93 Difference]: Finished difference Result 603 states and 761 transitions. [2022-11-02 20:25:39,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:25:39,074 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2022-11-02 20:25:39,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:39,077 INFO L225 Difference]: With dead ends: 603 [2022-11-02 20:25:39,077 INFO L226 Difference]: Without dead ends: 573 [2022-11-02 20:25:39,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:25:39,079 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 354 mSDsluCounter, 2521 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 2911 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:39,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 2911 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:25:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-11-02 20:25:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 555. [2022-11-02 20:25:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 472 states have (on average 1.2627118644067796) internal successors, (596), 478 states have internal predecessors, (596), 49 states have call successors, (49), 27 states have call predecessors, (49), 33 states have return successors, (57), 49 states have call predecessors, (57), 44 states have call successors, (57) [2022-11-02 20:25:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 702 transitions. [2022-11-02 20:25:39,184 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 702 transitions. Word has length 56 [2022-11-02 20:25:39,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:39,184 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 702 transitions. [2022-11-02 20:25:39,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:25:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 702 transitions. [2022-11-02 20:25:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:25:39,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:39,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:39,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-02 20:25:39,186 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:39,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:39,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1949554969, now seen corresponding path program 1 times [2022-11-02 20:25:39,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:39,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68433208] [2022-11-02 20:25:39,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:39,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:39,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:25:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:39,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:25:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:39,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:25:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:39,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:39,443 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:25:39,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:39,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68433208] [2022-11-02 20:25:39,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68433208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:39,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:39,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:25:39,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954436837] [2022-11-02 20:25:39,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:39,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:25:39,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:39,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:25:39,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:25:39,445 INFO L87 Difference]: Start difference. First operand 555 states and 702 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:25:40,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:40,402 INFO L93 Difference]: Finished difference Result 591 states and 740 transitions. [2022-11-02 20:25:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:25:40,403 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 59 [2022-11-02 20:25:40,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:40,405 INFO L225 Difference]: With dead ends: 591 [2022-11-02 20:25:40,405 INFO L226 Difference]: Without dead ends: 571 [2022-11-02 20:25:40,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:25:40,406 INFO L413 NwaCegarLoop]: 375 mSDtfsCounter, 344 mSDsluCounter, 2683 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:40,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 3058 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:25:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-11-02 20:25:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 553. [2022-11-02 20:25:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 471 states have (on average 1.2611464968152866) internal successors, (594), 477 states have internal predecessors, (594), 48 states have call successors, (48), 27 states have call predecessors, (48), 33 states have return successors, (56), 48 states have call predecessors, (56), 43 states have call successors, (56) [2022-11-02 20:25:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 698 transitions. [2022-11-02 20:25:40,476 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 698 transitions. Word has length 59 [2022-11-02 20:25:40,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:40,477 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 698 transitions. [2022-11-02 20:25:40,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:25:40,477 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 698 transitions. [2022-11-02 20:25:40,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:25:40,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:40,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:40,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-02 20:25:40,479 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:40,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1867013461, now seen corresponding path program 1 times [2022-11-02 20:25:40,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:40,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528617843] [2022-11-02 20:25:40,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:40,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:40,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:25:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:40,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:25:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:40,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:40,571 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:25:40,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:40,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528617843] [2022-11-02 20:25:40,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528617843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:40,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:40,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:25:40,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420791371] [2022-11-02 20:25:40,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:40,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:25:40,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:40,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:25:40,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:40,573 INFO L87 Difference]: Start difference. First operand 553 states and 698 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:25:41,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:41,162 INFO L93 Difference]: Finished difference Result 584 states and 730 transitions. [2022-11-02 20:25:41,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:25:41,163 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2022-11-02 20:25:41,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:41,164 INFO L225 Difference]: With dead ends: 584 [2022-11-02 20:25:41,165 INFO L226 Difference]: Without dead ends: 547 [2022-11-02 20:25:41,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:25:41,165 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 170 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:41,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1792 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:25:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-11-02 20:25:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2022-11-02 20:25:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 466 states have (on average 1.261802575107296) internal successors, (588), 472 states have internal predecessors, (588), 47 states have call successors, (47), 27 states have call predecessors, (47), 33 states have return successors, (55), 47 states have call predecessors, (55), 42 states have call successors, (55) [2022-11-02 20:25:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 690 transitions. [2022-11-02 20:25:41,247 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 690 transitions. Word has length 56 [2022-11-02 20:25:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:41,247 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 690 transitions. [2022-11-02 20:25:41,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:25:41,247 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 690 transitions. [2022-11-02 20:25:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:25:41,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:41,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:41,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-02 20:25:41,249 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:41,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:41,250 INFO L85 PathProgramCache]: Analyzing trace with hash -929165957, now seen corresponding path program 1 times [2022-11-02 20:25:41,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:41,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979006522] [2022-11-02 20:25:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:41,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:41,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:25:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:41,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:41,448 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:25:41,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:41,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979006522] [2022-11-02 20:25:41,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979006522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:41,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:41,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:25:41,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549452959] [2022-11-02 20:25:41,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:41,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:25:41,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:41,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:25:41,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:25:41,450 INFO L87 Difference]: Start difference. First operand 547 states and 690 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:42,349 INFO L93 Difference]: Finished difference Result 704 states and 874 transitions. [2022-11-02 20:25:42,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:25:42,350 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2022-11-02 20:25:42,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:42,352 INFO L225 Difference]: With dead ends: 704 [2022-11-02 20:25:42,352 INFO L226 Difference]: Without dead ends: 586 [2022-11-02 20:25:42,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:25:42,353 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 214 mSDsluCounter, 2440 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:42,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 2809 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:25:42,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-11-02 20:25:42,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 553. [2022-11-02 20:25:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 472 states have (on average 1.25) internal successors, (590), 478 states have internal predecessors, (590), 47 states have call successors, (47), 27 states have call predecessors, (47), 33 states have return successors, (55), 47 states have call predecessors, (55), 42 states have call successors, (55) [2022-11-02 20:25:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 692 transitions. [2022-11-02 20:25:42,434 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 692 transitions. Word has length 56 [2022-11-02 20:25:42,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:42,434 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 692 transitions. [2022-11-02 20:25:42,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:25:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 692 transitions. [2022-11-02 20:25:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:25:42,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:42,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:42,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-02 20:25:42,436 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:42,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:42,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1927582732, now seen corresponding path program 1 times [2022-11-02 20:25:42,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:42,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251970623] [2022-11-02 20:25:42,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:42,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:42,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:25:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:42,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:25:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:42,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:42,545 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:25:42,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:42,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251970623] [2022-11-02 20:25:42,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251970623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:42,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:42,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:25:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154698249] [2022-11-02 20:25:42,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:42,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:25:42,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:42,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:25:42,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:42,547 INFO L87 Difference]: Start difference. First operand 553 states and 692 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:25:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:43,111 INFO L93 Difference]: Finished difference Result 584 states and 724 transitions. [2022-11-02 20:25:43,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:25:43,112 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-11-02 20:25:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:43,113 INFO L225 Difference]: With dead ends: 584 [2022-11-02 20:25:43,113 INFO L226 Difference]: Without dead ends: 541 [2022-11-02 20:25:43,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:25:43,114 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 167 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:43,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1736 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:25:43,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-11-02 20:25:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2022-11-02 20:25:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 461 states have (on average 1.245119305856833) internal successors, (574), 467 states have internal predecessors, (574), 46 states have call successors, (46), 27 states have call predecessors, (46), 33 states have return successors, (54), 46 states have call predecessors, (54), 41 states have call successors, (54) [2022-11-02 20:25:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 674 transitions. [2022-11-02 20:25:43,197 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 674 transitions. Word has length 58 [2022-11-02 20:25:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:43,198 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 674 transitions. [2022-11-02 20:25:43,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:25:43,198 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 674 transitions. [2022-11-02 20:25:43,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:25:43,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:43,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:43,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-02 20:25:43,200 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:43,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:43,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1034079897, now seen corresponding path program 1 times [2022-11-02 20:25:43,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:43,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239607414] [2022-11-02 20:25:43,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:43,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:43,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:25:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:43,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:43,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:25:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:43,426 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:25:43,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:43,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239607414] [2022-11-02 20:25:43,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239607414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:43,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:43,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:25:43,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682594663] [2022-11-02 20:25:43,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:43,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:25:43,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:43,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:25:43,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:25:43,428 INFO L87 Difference]: Start difference. First operand 541 states and 674 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:25:45,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:45,284 INFO L93 Difference]: Finished difference Result 1123 states and 1388 transitions. [2022-11-02 20:25:45,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-02 20:25:45,284 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2022-11-02 20:25:45,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:45,287 INFO L225 Difference]: With dead ends: 1123 [2022-11-02 20:25:45,287 INFO L226 Difference]: Without dead ends: 1003 [2022-11-02 20:25:45,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=1287, Unknown=0, NotChecked=0, Total=1560 [2022-11-02 20:25:45,289 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 884 mSDsluCounter, 2084 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 2503 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:45,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 2503 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:25:45,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-11-02 20:25:45,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 766. [2022-11-02 20:25:45,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 648 states have (on average 1.25) internal successors, (810), 661 states have internal predecessors, (810), 66 states have call successors, (66), 42 states have call predecessors, (66), 51 states have return successors, (80), 62 states have call predecessors, (80), 61 states have call successors, (80) [2022-11-02 20:25:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 956 transitions. [2022-11-02 20:25:45,369 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 956 transitions. Word has length 58 [2022-11-02 20:25:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:45,370 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 956 transitions. [2022-11-02 20:25:45,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:25:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 956 transitions. [2022-11-02 20:25:45,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:25:45,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:45,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:45,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-02 20:25:45,372 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:45,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:45,373 INFO L85 PathProgramCache]: Analyzing trace with hash -158060891, now seen corresponding path program 1 times [2022-11-02 20:25:45,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:45,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987948041] [2022-11-02 20:25:45,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:45,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:45,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:25:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:45,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:45,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:25:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:45,450 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:25:45,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:45,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987948041] [2022-11-02 20:25:45,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987948041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:45,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:45,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:25:45,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772708783] [2022-11-02 20:25:45,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:45,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:25:45,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:45,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:25:45,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:45,453 INFO L87 Difference]: Start difference. First operand 766 states and 956 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:25:46,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:46,288 INFO L93 Difference]: Finished difference Result 1109 states and 1368 transitions. [2022-11-02 20:25:46,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:25:46,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2022-11-02 20:25:46,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:46,292 INFO L225 Difference]: With dead ends: 1109 [2022-11-02 20:25:46,292 INFO L226 Difference]: Without dead ends: 1000 [2022-11-02 20:25:46,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:25:46,293 INFO L413 NwaCegarLoop]: 673 mSDtfsCounter, 1026 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:46,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 1947 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:25:46,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-11-02 20:25:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 585. [2022-11-02 20:25:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 500 states have (on average 1.232) internal successors, (616), 506 states have internal predecessors, (616), 48 states have call successors, (48), 31 states have call predecessors, (48), 36 states have return successors, (56), 47 states have call predecessors, (56), 43 states have call successors, (56) [2022-11-02 20:25:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 720 transitions. [2022-11-02 20:25:46,386 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 720 transitions. Word has length 58 [2022-11-02 20:25:46,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:46,386 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 720 transitions. [2022-11-02 20:25:46,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:25:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 720 transitions. [2022-11-02 20:25:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:25:46,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:46,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:46,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-02 20:25:46,388 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:46,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:46,389 INFO L85 PathProgramCache]: Analyzing trace with hash -535968494, now seen corresponding path program 1 times [2022-11-02 20:25:46,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:46,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843760213] [2022-11-02 20:25:46,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:46,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:46,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:25:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:46,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:25:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:46,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:25:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:46,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:46,616 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:25:46,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:46,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843760213] [2022-11-02 20:25:46,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843760213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:46,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:46,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:25:46,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488804818] [2022-11-02 20:25:46,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:46,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:25:46,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:46,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:25:46,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:25:46,618 INFO L87 Difference]: Start difference. First operand 585 states and 720 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:25:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:47,684 INFO L93 Difference]: Finished difference Result 605 states and 741 transitions. [2022-11-02 20:25:47,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:25:47,684 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 62 [2022-11-02 20:25:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:47,686 INFO L225 Difference]: With dead ends: 605 [2022-11-02 20:25:47,686 INFO L226 Difference]: Without dead ends: 583 [2022-11-02 20:25:47,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:25:47,687 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 231 mSDsluCounter, 2491 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 2840 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:47,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 2840 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:25:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-11-02 20:25:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2022-11-02 20:25:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 498 states have (on average 1.2309236947791165) internal successors, (613), 504 states have internal predecessors, (613), 48 states have call successors, (48), 31 states have call predecessors, (48), 36 states have return successors, (56), 47 states have call predecessors, (56), 43 states have call successors, (56) [2022-11-02 20:25:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 717 transitions. [2022-11-02 20:25:47,823 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 717 transitions. Word has length 62 [2022-11-02 20:25:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:47,824 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 717 transitions. [2022-11-02 20:25:47,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:25:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 717 transitions. [2022-11-02 20:25:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 20:25:47,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:47,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:47,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-02 20:25:47,828 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:47,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash -274878733, now seen corresponding path program 1 times [2022-11-02 20:25:47,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:47,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218917361] [2022-11-02 20:25:47,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:47,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:47,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:25:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:47,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:25:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:47,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:25:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:47,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:47,929 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:25:47,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:47,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218917361] [2022-11-02 20:25:47,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218917361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:47,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:47,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:25:47,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045178353] [2022-11-02 20:25:47,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:47,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:25:47,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:47,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:25:47,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:47,932 INFO L87 Difference]: Start difference. First operand 583 states and 717 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:25:48,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:48,524 INFO L93 Difference]: Finished difference Result 614 states and 749 transitions. [2022-11-02 20:25:48,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:25:48,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 63 [2022-11-02 20:25:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:48,527 INFO L225 Difference]: With dead ends: 614 [2022-11-02 20:25:48,527 INFO L226 Difference]: Without dead ends: 566 [2022-11-02 20:25:48,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:25:48,528 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 166 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:48,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1546 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:25:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-11-02 20:25:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2022-11-02 20:25:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 484 states have (on average 1.2272727272727273) internal successors, (594), 490 states have internal predecessors, (594), 45 states have call successors, (45), 31 states have call predecessors, (45), 36 states have return successors, (52), 44 states have call predecessors, (52), 40 states have call successors, (52) [2022-11-02 20:25:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 691 transitions. [2022-11-02 20:25:48,637 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 691 transitions. Word has length 63 [2022-11-02 20:25:48,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:48,637 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 691 transitions. [2022-11-02 20:25:48,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:25:48,637 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 691 transitions. [2022-11-02 20:25:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:25:48,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:48,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:48,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-02 20:25:48,640 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:48,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:48,640 INFO L85 PathProgramCache]: Analyzing trace with hash 273629316, now seen corresponding path program 1 times [2022-11-02 20:25:48,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:48,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084808317] [2022-11-02 20:25:48,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:48,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:48,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:25:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:48,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:25:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:48,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:25:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:48,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:25:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:48,898 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:25:48,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:48,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084808317] [2022-11-02 20:25:48,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084808317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:48,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:48,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:25:48,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322578511] [2022-11-02 20:25:48,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:48,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:25:48,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:48,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:25:48,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:25:48,915 INFO L87 Difference]: Start difference. First operand 566 states and 691 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:25:49,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:49,848 INFO L93 Difference]: Finished difference Result 583 states and 708 transitions. [2022-11-02 20:25:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:25:49,848 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2022-11-02 20:25:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:49,850 INFO L225 Difference]: With dead ends: 583 [2022-11-02 20:25:49,850 INFO L226 Difference]: Without dead ends: 545 [2022-11-02 20:25:49,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:25:49,851 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 318 mSDsluCounter, 2145 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 2469 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:49,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 2469 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:25:49,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2022-11-02 20:25:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2022-11-02 20:25:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 468 states have (on average 1.2264957264957266) internal successors, (574), 474 states have internal predecessors, (574), 41 states have call successors, (41), 30 states have call predecessors, (41), 35 states have return successors, (47), 40 states have call predecessors, (47), 36 states have call successors, (47) [2022-11-02 20:25:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 662 transitions. [2022-11-02 20:25:49,925 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 662 transitions. Word has length 60 [2022-11-02 20:25:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:49,925 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 662 transitions. [2022-11-02 20:25:49,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:25:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 662 transitions. [2022-11-02 20:25:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:25:49,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:49,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:49,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-11-02 20:25:49,928 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:49,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:49,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1406802114, now seen corresponding path program 1 times [2022-11-02 20:25:49,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:49,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793288621] [2022-11-02 20:25:49,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:49,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:49,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:25:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:50,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:25:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:50,004 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:25:50,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:50,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793288621] [2022-11-02 20:25:50,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793288621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:50,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:50,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:25:50,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651838630] [2022-11-02 20:25:50,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:50,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:25:50,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:50,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:25:50,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:50,007 INFO L87 Difference]: Start difference. First operand 545 states and 662 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 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:25:50,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:50,348 INFO L93 Difference]: Finished difference Result 572 states and 690 transitions. [2022-11-02 20:25:50,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:25:50,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 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) Word has length 58 [2022-11-02 20:25:50,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:50,350 INFO L225 Difference]: With dead ends: 572 [2022-11-02 20:25:50,350 INFO L226 Difference]: Without dead ends: 537 [2022-11-02 20:25:50,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:50,350 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 159 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:50,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1172 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:25:50,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-11-02 20:25:50,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2022-11-02 20:25:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 461 states have (on average 1.2255965292841648) internal successors, (565), 467 states have internal predecessors, (565), 40 states have call successors, (40), 30 states have call predecessors, (40), 35 states have return successors, (45), 39 states have call predecessors, (45), 35 states have call successors, (45) [2022-11-02 20:25:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 650 transitions. [2022-11-02 20:25:50,459 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 650 transitions. Word has length 58 [2022-11-02 20:25:50,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:50,459 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 650 transitions. [2022-11-02 20:25:50,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 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:25:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 650 transitions. [2022-11-02 20:25:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:25:50,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:50,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:50,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-02 20:25:50,462 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:50,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:50,462 INFO L85 PathProgramCache]: Analyzing trace with hash 472047151, now seen corresponding path program 1 times [2022-11-02 20:25:50,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:50,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562000917] [2022-11-02 20:25:50,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:50,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:25:50,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:25:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:25:50,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:25:50,553 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:25:50,554 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:25:50,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-11-02 20:25:50,560 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:50,564 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:25:50,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:25:50 BoogieIcfgContainer [2022-11-02 20:25:50,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:25:50,693 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:25:50,694 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:25:50,694 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:25:50,694 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:24:51" (3/4) ... [2022-11-02 20:25:50,697 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:25:50,794 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c93dc56-9253-4b34-af50-de167d3d4f8f/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:25:50,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:25:50,795 INFO L158 Benchmark]: Toolchain (without parser) took 62398.14ms. Allocated memory was 117.4MB in the beginning and 541.1MB in the end (delta: 423.6MB). Free memory was 71.9MB in the beginning and 425.9MB in the end (delta: -354.1MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2022-11-02 20:25:50,795 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 117.4MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:25:50,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 632.57ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 72.2MB in the end (delta: -520.8kB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-11-02 20:25:50,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 152.27ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 65.4MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:25:50,796 INFO L158 Benchmark]: Boogie Preprocessor took 69.06ms. Allocated memory is still 117.4MB. Free memory was 65.0MB in the beginning and 60.0MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:25:50,796 INFO L158 Benchmark]: RCFGBuilder took 1853.61ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 60.0MB in the beginning and 98.6MB in the end (delta: -38.6MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2022-11-02 20:25:50,796 INFO L158 Benchmark]: TraceAbstraction took 59579.30ms. Allocated memory was 159.4MB in the beginning and 541.1MB in the end (delta: 381.7MB). Free memory was 98.6MB in the beginning and 435.4MB in the end (delta: -336.7MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2022-11-02 20:25:50,796 INFO L158 Benchmark]: Witness Printer took 101.17ms. Allocated memory is still 541.1MB. Free memory was 435.4MB in the beginning and 425.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:25:50,797 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.33ms. Allocated memory is still 117.4MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 632.57ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 72.2MB in the end (delta: -520.8kB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 152.27ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 65.4MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.06ms. Allocated memory is still 117.4MB. Free memory was 65.0MB in the beginning and 60.0MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1853.61ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 60.0MB in the beginning and 98.6MB in the end (delta: -38.6MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * TraceAbstraction took 59579.30ms. Allocated memory was 159.4MB in the beginning and 541.1MB in the end (delta: 381.7MB). Free memory was 98.6MB in the beginning and 435.4MB in the end (delta: -336.7MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. * Witness Printer took 101.17ms. Allocated memory is still 541.1MB. Free memory was 435.4MB in the beginning and 425.9MB in the end (delta: 9.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 - CounterExampleResult [Line: 59]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int s ; [L33] int UNLOADED ; [L34] int NP ; [L35] int DC ; [L36] int SKIP1 ; [L37] int SKIP2 ; [L38] int MPR1 ; [L39] int MPR3 ; [L40] int IPC ; [L41] int pended ; [L42] int compFptr ; [L43] int compRegistered ; [L44] int lowerDriverReturn ; [L45] int setEventCalled ; [L46] int customIrp ; [L47] int routine ; [L48] int myStatus ; [L49] int pirp ; [L50] int Executive ; [L51] int Suspended ; [L52] int KernelMode ; [L53] int DeviceUsageTypePaging ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L1718] int pirp__IoStatus__Status ; [L1719] int d = __VERIFIER_nondet_int() ; [L1720] int status = __VERIFIER_nondet_int() ; [L1721] int irp = __VERIFIER_nondet_int() ; [L1722] int we_should_unload = __VERIFIER_nondet_int() ; [L1723] int irp_choice = __VERIFIER_nondet_int() ; [L1724] int devobj = __VERIFIER_nondet_int() ; [L1725] int __cil_tmp9 ; [L1730] s = 0 [L1731] UNLOADED = 0 [L1732] NP = 0 [L1733] DC = 0 [L1734] SKIP1 = 0 [L1735] SKIP2 = 0 [L1736] MPR1 = 0 [L1737] MPR3 = 0 [L1738] IPC = 0 [L1739] pended = 0 [L1740] compFptr = 0 [L1741] compRegistered = 0 [L1742] lowerDriverReturn = 0 [L1743] setEventCalled = 0 [L1744] customIrp = 0 [L1745] routine = 0 [L1746] myStatus = 0 [L1747] pirp = 0 [L1748] Executive = 0 [L1749] Suspended = 5 [L1750] KernelMode = 0 [L1751] DeviceUsageTypePaging = 1 [L1754] pirp = irp [L1755] CALL _BLAST_init() [L67] UNLOADED = 0 [L68] NP = 1 [L69] DC = 2 [L70] SKIP1 = 3 [L71] SKIP2 = 4 [L72] MPR1 = 5 [L73] MPR3 = 6 [L74] IPC = 7 [L75] s = UNLOADED [L76] pended = 0 [L77] compFptr = 0 [L78] compRegistered = 0 [L79] lowerDriverReturn = 0 [L80] setEventCalled = 0 [L81] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1755] RET _BLAST_init() [L1757] COND TRUE status >= 0 [L1758] s = NP [L1759] customIrp = 0 [L1760] setEventCalled = customIrp [L1761] lowerDriverReturn = setEventCalled [L1762] compRegistered = lowerDriverReturn [L1763] compFptr = compRegistered [L1764] pended = compFptr [L1765] pirp__IoStatus__Status = 0 [L1766] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1767] COND TRUE irp_choice == 0 [L1768] pirp__IoStatus__Status = -1073741637 [L1769] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1772] CALL stub_driver_init() [L1707] s = NP [L1708] customIrp = 0 [L1709] setEventCalled = customIrp [L1710] lowerDriverReturn = setEventCalled [L1711] compRegistered = lowerDriverReturn [L1712] compFptr = compRegistered [L1713] pended = compFptr VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1772] RET stub_driver_init() [L1775] COND FALSE !(status < 0) [L1779] int tmp_ndt_1; [L1780] tmp_ndt_1 = __VERIFIER_nondet_int() [L1781] COND TRUE tmp_ndt_1 == 2 VAL [compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1798] CALL, EXPR CdAudioDeviceControl(devobj, pirp) [L313] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L314] int status ; VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L317] COND FALSE !(deviceExtension__Active == 2) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L320] COND FALSE !(deviceExtension__Active == 3) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L323] COND FALSE !(deviceExtension__Active == 1) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L326] COND TRUE deviceExtension__Active == 7 VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L348] CALL, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L1591] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1592] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1593] int irpSp__Control ; [L1594] int tmp ; [L1595] int tmp___0 ; [L1596] int __cil_tmp8 ; [L1597] int __cil_tmp9 ; [L1598] int __cil_tmp10 ; [L1599] int __cil_tmp11 ; [L1600] int __cil_tmp12 ; [L1604] __cil_tmp8 = 56 [L1605] __cil_tmp9 = 16384 [L1606] __cil_tmp10 = 131072 [L1607] __cil_tmp11 = 147456 [L1608] __cil_tmp12 = 147512 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1610] COND FALSE !(s != NP) VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1615] COND FALSE !(compRegistered != 0) [L1620] compRegistered = 1 [L1621] routine = 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] irpSp__Control = 224 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] CALL, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1900] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1901] int returnVal2 ; [L1902] int compRetStatus ; [L1903] int lcontext = __VERIFIER_nondet_int() ; [L1904] unsigned long __cil_tmp8 ; VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE \read(compRegistered) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1908] COND TRUE routine == 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] CALL, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1569] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1570] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1573] COND TRUE \read(Irp__PendingReturned) VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, Context=-1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1574] COND TRUE pended == 0 [L1575] pended = 1 VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, Context=-1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1582] COND FALSE !(myStatus >= 0) VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, Context=-1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1587] return (myStatus); VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \result=-1073741637, compFptr=0, compRegistered=1, Context=-1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] RET, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, HPCdrCompletion(DeviceObject, Irp, lcontext)=-1073741637, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1920] __cil_tmp8 = (unsigned long )compRetStatus VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1921] COND FALSE !(__cil_tmp8 == -1073741802) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1928] COND FALSE !(\read(Irp__PendingReturned)) [L1931] int tmp_ndt_4; [L1932] tmp_ndt_4 = __VERIFIER_nondet_int() [L1933] COND TRUE tmp_ndt_4 == 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1944] returnVal2 = 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1958] COND TRUE s == NP [L1959] s = IPC [L1960] lowerDriverReturn = returnVal2 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1981] return (returnVal2); VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \result=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1626] RET, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IofCallDriver(deviceExtension__TargetDeviceObject, Irp)=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1628] return (tmp); VAL [\old(DeviceObject)=0, \old(Irp)=0, \result=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp=0, UNLOADED=0] [L348] RET, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L348] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L363] return (status); VAL [\old(DeviceObject)=0, \old(Irp)=0, \result=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0] [L1798] RET, EXPR CdAudioDeviceControl(devobj, pirp) [L1798] status = CdAudioDeviceControl(devobj, pirp) [L1819] COND FALSE !(\read(we_should_unload)) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1825] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1826] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1833] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1834] COND FALSE !(s == MPR3) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1841] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1842] COND TRUE status != -1 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1843] COND TRUE s != SKIP2 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1844] COND FALSE !(s != IPC) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1857] COND FALSE !(pended != 1) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1869] COND TRUE status != 259 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1871] CALL errorFn() VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L59] reach_error() VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 470 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.3s, OverallIterations: 66, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 43.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20979 SdHoareTripleChecker+Valid, 32.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20646 mSDsluCounter, 159113 SdHoareTripleChecker+Invalid, 26.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124170 mSDsCounter, 5797 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40764 IncrementalHoareTripleChecker+Invalid, 46561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5797 mSolverCounterUnsat, 34943 mSDtfsCounter, 40764 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 923 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 629 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=821occurred in iteration=4, InterpolantAutomatonStates: 573, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.5s AutomataMinimizationTime, 65 MinimizatonAttempts, 2310 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 3023 NumberOfCodeBlocks, 3023 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 2900 ConstructedInterpolants, 0 QuantifiedInterpolants, 7935 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 65 InterpolantComputations, 65 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-02 20:25:50,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c93dc56-9253-4b34-af50-de167d3d4f8f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE